## Check if all Prime factors of number N are unique or not

Given a number N. The task is to check whether the given number N has unique prime factors or not. If yes then print YES… Read More »

- Ternary number system or Base 3 numbers
- Find all divisors of first N natural numbers
- Find the largest composite number that divides N but is strictly lesser than N
- Check whether count of odd and even factors of a number are equal
- Split N natural numbers into two sets having GCD of their sums greater than 1
- Count of unique digits in a given number N
- Check if a number is Prime, Semi-Prime or Composite for very large numbers
- Split a number as sum of K numbers which are not divisible by K
- Transform N to Minimum possible value
- Sum of GCD of all numbers upto N with N itself
- Program to Convert Octal to Hexadecimal
- Count of perfect squares of given length
- Find two numbers whose difference of fourth power is equal to N
- Largest number M less than N such that XOR of M and N is even
- Count of nodes having odd divisors in the given subtree for Q queries
- Check if N can be expressed as product of 3 distinct numbers
- Determine whether the given integer N is a Peculiar Number or not
- Sum of Hamming difference of consecutive numbers from 0 to N | Set 2
- Sum of product of all subsets formed by only divisors of N
- Count of triplets in a given Array having GCD K
- Check if N can be obtained by repetitive addition or subtraction of two given numbers
- Sum of all divisors from 1 to N | Set 2
- Check if all Prime factors of number N are unique or not
- Find K numbers with sum equal to N and sum of their squares maximized
- Last digit in a power of 2
- Count all prime numbers in a given range whose sum of digits is also prime
- Program to Convert BCD number into Decimal number
- Count of subsequences of length 4 in form (x, x, x+1, x+1) | Set 2
- Find pairs of elements from two different arrays whose product is a perfect square
- Find if it is possible to make all elements of an array equal by the given operations

Given a number N. The task is to check whether the given number N has unique prime factors or not. If yes then print YES… Read More »

Dixon’s Factorization method is an integer factorization algorithm. In this article, this method is explained to find the factors of a composite number. Dixon Factorization… Read More »

Given a composite number N, the task is to find the largest composite number that divides N and is strictly lesser than N. If there… Read More »

Prerequisites: Prime Factorization using Sieve Given two arrays arr1[] and arr2[] of size M and N with distinct elements in each of the arrays, the… Read More »

Given a very large number N (> 150), the task is to check whether this number is Prime, Semi-Prime or Composite. Example: Input: N =… Read More »

Given three integers X, Y and Z, the task is to find the sum of all the numbers formed having 4 atmost X times, 5… Read More »

Given an array arr[] of size N. The task is to find the size of the set of numbers from the given array such that… Read More »

Fermat’s Factorization method is based on the representation of an odd integer as the difference of two squares. For an integer n, we want a… Read More »

Given an odd number N, the task is to find if the number can be represented as the sum of 3 prime numbers. Examples: Input:… Read More »

Given N coins, the task is to find who win the coin game. Coin game is a game in which each player picks coins from… Read More »

Given an integer N, the task is to find the count of natural Hexadecimal numbers with N digits. Examples: Input: N = 1 Output: 15… Read More »

Given an integer N, the task is to find the largest even and odd N-digit numbers in Octal Number System. Examples: Input: N = 4… Read More »

Given an array a of size N. The task is to find the number of pairs such that gcd(a[i], a[j]) where 1 ≤ i <… Read More »

Given an integer N. The task is to find Mobius function of all numbers from 1 to N. Examples: Input: N = 5 Output: 1… Read More »

Given an integer N. Consider the set of first N natural numbers A = {1, 2, 3, …, N}. Let M and P be two… Read More »