## Minimum number of moves to reach N starting from (1, 1)

Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… Read More »

- Find sum of inverse of the divisors when sum of divisors and the number is given
- Sum of all second largest divisors after splitting a number into one or more parts
- Find number from its divisors
- Check if the given array contains all the divisors of some integer
- Maximum value of division of two numbers in an Array
- Count of numbers below N whose sum of prime divisors is K

Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… Read More »

Given an integer N, the task is to find all of its divisors using its prime factorization. Examples: Input: N = 6 Output: 1 2… Read More »

Given two integers K and N, the task is to find the count of integers from the range [2, N – 1] whose sum of… Read More »

Given an array A of size N (> 2). The task is to find the maximum value of A[i] / A[j] Note: A[i] ≠ 0.… Read More »

Given an integer N( 2 <= N <= 10^9 ), split the number into one or more parts(possibly none), where each part must be greater… Read More »

Given an integer N and the sum of its divisors. The task is to find the sum of the inverse of the divisors of N.… Read More »

Given an integer array arr[], the task is to check if that array contains all the divisor of some integer. Examples: Input: arr[] = {… Read More »

Given an array arr[] of N integers. The integers represent all the divisors of a number X except 1 and X itself. The task is… Read More »

Given three integers A, B, C, the task is to find ΣAi=1 ΣBj=1ΣCk=1 d(i.j.k), where d(x) is the number of divisors of x. Answer can… Read More »

Given an integer N. The task is to find the number of integers 1 < x < N, for which x and x + 1… Read More »

Given an array arr[] of integers of size n. For each element, you have to print the summation of multiplication of every triplet formed using… Read More »

Given two positive integers N and M., The task is to find the smallest divisor D of N such that gcd(D, M) > 1. If… Read More »

Given a range [l, r], the task is to find the sum of all the odd factors of the numbers from the given range. Examples:… Read More »

Given an array arr[] of integers, the task is to find the element (other than 1) which is the factor of maximum number of elements… Read More »

Given two positive integers N and M, the task is to find the smallest positive integer which is divisible by N and whose digit sum… Read More »