## Count of square free divisors of a given number

Given an integer N, the task is to count the number of square-free divisors of the given number. A number is said to be square-free,… Read More »

- Find two numbers such that difference of their squares equal to N
- Program to find all Factors of a Number using recursion
- Check if there exists a number with X factors out of which exactly K are prime
- Count minimum factor jumps required to reach the end of an Array
- Count of multiples in an Array before every element
- Find all divisors of first N natural numbers
- Find numbers that divide X and Y to produce the same remainder
- Fermat's Factorization method for large numbers
- Count of pairs in an array whose product is a perfect square
- Count of pairs of integers whose difference of squares is equal to N
- Minimize the cost of selecting two numbers whose product is X
- Largest palindrome which is product of two N-digit numbers : Set 2
- Length of longest Powerful number subsequence in an Array
- Panarithmic numbers within a given range
- Parity of the given mathematical expression using given N numbers
- Sum of all perfect numbers present in an Linked list
- Count of pairs (i, j) in the array such that arr[i] is a factor of arr[j]
- Count of nodes in a Binary tree with immediate children as its factors
- Count the nodes in the given tree whose weight is a powerful number
- Euler's Factorization method
- Find product of all elements at indexes which are factors of M for all possible sorted subsequences of length M
- Count the factors of K present in the given Array
- Find the element having maximum premutiples in the array
- Greatest odd factor of an even number
- Dixon's Factorization Method with implementation
- Palindromic divisors of a number
- Sum of M maximum distinct digit sum from 1 to N that are factors of K

Given an integer N, the task is to count the number of square-free divisors of the given number. A number is said to be square-free,… Read More »

Given an array arr[] of N positive integers, the task is to count the number of array elements which can be expressed as the product… Read More »

Given an integer array arr[] of size N, the task is to find the minimum number of array elements required to be divided by 2,… Read More »

Given a number N, the task is to find a pair of integers in the range [2, N] with maximum GCD. Examples: Input: N =… Read More »

Given an array A[] of N integers, the task is to generate an array B[] such that B[i] contains the count of indices j in… Read More »

Given an integer N, the task is to make an array of unique elements of length N such that all subarrays sum modulo N equals… Read More »

Given a number X, the task is to find the minimum number N such that the sum of the count of all factors from 1… Read More »

Given an even number N, the task is to find the greatest possible odd factor of N. Examples: Input: N = 8642 Output: 4321 Explanation:… Read More »

Given a positive integer N, the task is to find the count of pairs of integers (x, y) whose difference of squares is equal to… Read More »

Given N positive integers A1, A2, …, AN, the task is to determine the parity of the expression S. For the given N numbers, the… Read More »

Given an integer N, the task is to find two non-negative integers A and B, such that A2 – B2 = N. If no such… Read More »

Given two positive numbers A and B.The task is to print all the Panarithmic Number between two numbers (inclusively). Panarithmic Numbers or Practical number is… Read More »

Given an array of integers arr, the task is to calculate the number of pairs (i, j) where i < j such that arr[j] %… Read More »

Given an Linked list containing N positive integer, the task is to find the sum of all the perfect numbers from the list. A number… Read More »

Given an array arr[] of N distinct integers and a positive integer M, the task is to find the product of all the elements at… Read More »