## Numbers with sum of digits equal to the sum of digits of its all prime factor

Given a range, the task is to find the count of the numbers in the given range such that the sum of its digit is… Read More »

Given a range, the task is to find the count of the numbers in the given range such that the sum of its digit is… Read More »

Given Q queries which consist of two integers, one is number(1 <= number <= 106) and the other is N., the task is to find… Read More »

Given two integers L and R. The task is to find the sum of all prime factors of every number in the range[L-R]. Examples: Input:… Read More »

Given a number n, the task of the programmer is to print the factors of the number in such a way that they occur in… Read More »

Given a number ‘n’, the task is to generate the first ‘n’ Stormer numbers. A Stormer Number is a positive integer ‘i’ such that the… Read More »

Given two numbers M and N. The task is to print the number which has the maximum number of distinct prime factors of numbers in… Read More »

Given a number N, find the number of distinct prime factors for all numbers in the range [1, N]. Examples : Input : N =… Read More »

Given Q queries. Each query contain a positive integer n. The task is to output the sum of sum of odd number digit contained in… Read More »

Blum Integer is the number which only haves 2 factors suppose p and q (i.e. n = p * q), both are Semi-prime and also… Read More »

Given a number ‘n’, check whether it is a hoax number or not. A Hoax Number is defined as a composite number, whose sum of… Read More »

A k-rough or k-jagged number is a number whose smallest prime factor is greater than or equal to the number ‘k’. Given numbers ‘n’ and… Read More »

Given a number n, find the ordered prime signatures and using this find the number of divisor of given n. Any positive integer, ‘n’ can… Read More »

According to Euclid Euler Theorem, a perfect number which is even, can be represented in the form where n is a prime number and is… Read More »

A frugal number is a number whose number of digits is strictly greater than the number of digits in its prime factorization (including exponents). If… Read More »

Given a number n, we need to find the product of all of its unique prime factors. Prime factors: It is basically a factor of… Read More »