euler-totient

28 posts

Count of non co-prime pairs from the range [1, arr[i]] for every array element

Last Updated: 10 November 2021

Given an array arr[] consisting of N integers, the task for every ith element of the array is to find the number of non co-prime pairs from ...read more

Arrays

Mathematical

HCF

prefix-sum

euler-totient

DSA

Count numbers up to N whose GCD with N is less than that number

Last Updated: 01 February 2023

Given an integer N, the task is to count the values of K ( where 1 ? K? N ), such that 1 GCD(K, N) K.Examples:Input: N = 10Output: 3Explana ...read more

Generate an array having sum of Euler Totient Function of all elements equal to N

Last Updated: 17 January 2022

Given a positive integer N, the task is to generate an array such that the sum of the Euler Totient Function of each element is equal to N.E ...read more

Technical Scripter 2020

DSA

Similar Topics

DSA

21.8k+ articles

Mathematical

7.7k+ articles

Arrays

6.3k+ articles

Prime Number

550+ articles

number-theory

410+ articles

sieve

310+ articles

GCD-LCM

310+ articles

Modular Arithmetic

190+ articles

prime-factor

170+ articles

HCF

89+ articles

Count all possible values of K less than Y such that GCD(X, Y) = GCD(X+K, Y)

Last Updated: 14 April 2021

Given two integers X and Y, the task is to find the number of integers, K, such that gcd(X, Y) is equal to gcd(X+K, Y), where 0 K Y.Example ...read more

Technical Scripter 2020

DSA

Sum of GCD of all numbers upto N with N itself

Last Updated: 23 November 2022

Given an integer N, the task is to find the sum of Greatest Common Divisors of all numbers up to N with N itself.Examples:Input: N = 12Outpu ...read more

Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2

Last Updated: 09 June 2022

Given a very large number N. The task is to find (1n + 2n + 3n + 4n) mod 5.Examples:Input: N = 4Output: 4(1 + 16 + 81 + 256) % 5 = 354 % 5 = ...read more

Mathematical

Competitive Programming

euler-totient

DSA

Find the number of primitive roots modulo prime

Last Updated: 29 June 2022

Given a prime[Tex]p[/Tex]. The task is to count all the primitive roots of[Tex]p[/Tex].A primitive root is an integer x (1 = x p) such that ...read more

Mathematical

Competitive Programming

Queries to count the number of unordered co-prime pairs from 1 to N

Last Updated: 01 September 2022

Given a number N. The task is to find the number of unordered coprime pairs of integers from 1 to N. There can be multiple queries.Examples: ...read more

Compute power of power k times % m

Last Updated: 24 May 2022

Given x, k and m. Compute (xxxx...k)%m, x is in power k times. Given x is always prime and m is greater than x.Examples:Input : 2 3 3Output ...read more

Minimum insertions to make a Co-prime array

Last Updated: 10 October 2022

Given an array of N elements, find the minimum number of insertions to convert the given array into a co-prime array. Print the resultant ar ...read more

Optimized Euler Totient Function for Multiple Evaluations

Last Updated: 17 September 2022

Euler Totient Function (ETF) ?(n) for an input n is count of numbers in {1, 2, 3, …, n} that are relatively prime to n, i.e., the numbers ...read more

Number Theory | Generators of finite cyclic group under addition

Last Updated: 20 February 2023

Given a number n, find all generators of cyclic additive group under modulo n. Generator of a set {0, 1, ... n-1} is an element x such that ...read more

Primitive root of a prime number n modulo n

Last Updated: 08 March 2023

Given a prime number n, the task is to find its primitive root under modulo n. The primitive root of a prime number n is an integer r betwee ...read more

Euler's Totient function for all numbers smaller than or equal to n

Last Updated: 27 December 2023

Euler's Totient function ?(n) for an input n is the count of numbers in {1, 2, 3, ..., n} that are relatively prime to n, i.e., the numbers ...read more

Euler's Totient Function

Last Updated: 15 April 2024

Euler's Totient function Φ(n) for an input n is the count of numbers in {1, 2, 3, ..., n-1} that are relatively prime to n, i.e., the numbe...read more

1 2 >>

1 2 >>

1 2 >>