Skip to content

Tag Archives: euler-totient

Given an integer N, the task is to count the values of K ( where 1 ≤ K≤ N ), such that 1< GCD(K, N)… Read More
Given a positive integer N, the task is to find the sum of the Euler Totient Function for all the divisor of the given number… Read More
Given a positive even integer N, the task is to find the number of pairs (i, j) from the range [1, N] such that the… Read More
Given an integer N, the task is to count the number of integers from the range [1, N] having at least one in common prime… Read More
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… Read More
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),… Read More
Given an integer N, the task is to check whether the Euler’s Totient Function of N and 2 * N are the same or not.… Read More
Given three integers L, R, and M, the task is to find the probability of Euler’s Totient Function of a number in the range [L,… Read More
Given an integer N, the task is to find the count of all possible integers less than N satisfying the following properties: The number is… Read More
Given an array arr[] of N integers, and a range L to R, the task is to find the total number of elements in the… Read More
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:… Read More
Given a number N, the task is to find the number of pairs (a, b) in the range [1, N] such that their LCM is… Read More
Given two integers M and K, the task is to count the number of integers between [0, M] such that GCD of that integer with… Read More
A highly totient number k is an integer that has more solutions to the equation φ(x) = k, where φ is Euler’s totient functionThe sequence… Read More