# Tag Archives: Numbers

## Count rotations which are divisible by 10

Given a number N, the task is to count all the rotations of the given number which are divisible by 10. Examples: Input: N =… Read More »

## Check if a given pair of Numbers are Betrothed numbers or not

Given two positive numbers N and M, the task is to check whether the given pairs of numbers (N, M) form a Betrothed Numbers or… Read More »

## Count of Fibonacci pairs with sum N in range 0 to N

Given a number N, the task is to find the count of Fibonacci pairs in range 0 to N whose sum is N. Examples: Input:… Read More »

## Minimize the cost of selecting two numbers whose product is X

Prerequisite: To Find Maximum and Minimum Prime Number Given four integers A, B, C and X, the task is to minimize the cost of selecting… Read More »

## Find the Nth Pure number

Given an integer N, the task is to find the Nth pure number. A pure number has to satisfy three conditions: 1) It has even… Read More »

## Minimum operations required to make two numbers equal

Given two integers A and B. the task is to find the minimum number of operations required to make A and B equal. In each… Read More »

## Find two Fibonacci numbers whose sum can be represented as N

Given an even number N, the task is to find two Fibonacci numbers whose sum can be represented as N. There may be several combinations… Read More »

## Modulus of a Complex Number

Given a complex number z, the task is to determine the modulus of this complex number. Note: Given a complex number z = a +… Read More »

## Print a pair of numbers with the given Sum and Product

Given a sum S and product P, the task is to print any pair of integers which has the sum S and the product P.… Read More »

## Dixon’s Factorization Method with implementation

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 »

## Find any K distinct odd integers such that their sum is equal to N

Given two integers N and K, the task is to find any K distinct odd integers such that their sum is equal to N. If… Read More »

## Largest and Smallest N-digit Octal Numbers

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

## Sort the Array by reversing the numbers in it

Given an array arr[] of N non-negative integers, the task is to sort these integers according to their reverse Examples: Input: arr[] = {12, 10,… Read More »

## Find Maximum and Minimum of two numbers using Absolute function

Given two numbers, the task is to print the maximum and minimum of the given numbers using Absolute function. Examples: Input: 99, 18 Output: Maximum… Read More »

## Check if a number has prime count of divisors

Given an integer N, the task is to check if the count of divisors of N is prime or not. Examples: Input: N = 13… Read More »