Skip to content

Tag Archives: number-theory

Given a large number N in the form of a string, the task is to determine the count of distinct numbers that can be formed… Read More
Given two numbers L and R, the task is to find two distinct minimum positive integers X and Y such that whose LCM lies in… Read More
Given an array arr[] of N positive integers and an integer K., The task is to create a set of prime numbers such that the… Read More
Given a number N, the task is to find two numbers a and b such that a + b = N and LCM(a, b) is… Read More
Given an integer N and an integer P denoting the product of two primes, the task is to find all possible Square Root of N… Read More
Given an integer N, the task is to find the sum of exponents of prime factors of numbers 1 to N. Examples: Input: N =… Read More
Given a number N, the task is to count the number of unique digits in the given number. Examples: Input: N = 22342 Output: 2 Explanation:The digits… Read More
Given three positive integers N, A, and B, the task is to check if it is possible to obtain N by adding or subtracting A… Read More
Given a number N, the task is to find the sum of Hamming difference of consecutive numbers from 0 to N.   Hamming Distance between two… Read More
Given an array A[] of size N, the task is to maximize the count of distinct elements in the array by inserting the absolute differences… Read More
Given two integers A and B, the task is to print the integer among the two, which will be converted to an odd integer by… Read More
Given a number N, the task is to check whether the given number is Armstrong number or not. If the given number is Armstrong Number… Read More
Given two numbers N and K, the task is to find the minimum value X such that N < X*K. Examples:  Input: N = 8,… Read More
Given three integers N, L, and R. The task is to calculate the number of natural numbers in the range [L, R] (both inclusive) which… Read More
Given two integers N and X, the task is to find the minimum count of integers with sum N and having unit digit X. If… Read More

Start Your Coding Journey Now!