## Nambiar Number Generator

M. Nambiar has devised a mechanism to process any given number and thus generating a new resultant number. He calls this mechanism as the “Nambiar… Read More »

- Count rotations of N which are Odd and Even
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Find the Nth Mosaic number
- Predict the winner in Coin Game
- Length of the longest increasing subsequence such that no two adjacent elements are coprime
- Largest number N which can be reduced to 0 in K steps
- Check if factorial of N is divisible by the sum of squares of first N natural numbers
- Check if each element of the given array is the product of exactly K prime numbers
- Count number of trailing zeros in Binary representation of a number using Bitset
- Count Distinct Rectangles in N*N Chessboard
- Smallest and Largest Palindrome with N Digits
- Number of trailing zeroes in base B representation of N!
- Modular Exponentiation of Complex Numbers
- Find a number containing N - 1 set bits at even positions from the right
- Sum of all perfect numbers present in an array
- Count non-negative triplets with sum equal to N
- Number of ways of writing N as a sum of 4 squares
- Count of numbers from range [L, R] whose sum of digits is Y
- Find last five digits of a given five digit number raised to power five
- Find the maximum number of composite summands of a number
- 3-digit Osiris number
- Addition of two numbers without propagating Carry
- Find the value at kth position in the generated array
- Count of all N digit numbers such that num + Rev(num) = 10^N - 1
- Smallest Even number with N digits
- Number of elements from the array which are reachable after performing given operations on D
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
- Sum of multiplication of triplet of divisors of a number
- Print n numbers such that their sum is a perfect square
- Find the number of integers x in range (1,N) for which x and x+1 have same number of divisors

M. Nambiar has devised a mechanism to process any given number and thus generating a new resultant number. He calls this mechanism as the “Nambiar… Read More »

Fermat numbers are non-negative odd numbers which is valid for all values of k>=0. Only the first seven terms of the sequence are known till… Read More »

Given four integers A, B, K, M. The task is to find (A + iB)K % M which is a complex number too. A +… Read More »

Given an integer N. The task is to find the number of different ordered triplets(a, b, c) of non-negative integers such that a + b… Read More »

Given a positive integer N, the task is to find a number which contains (N – 1) set bits in its binary form at every… Read More »

Given an array arr[] and three integers D, A and B. You start with the number D and at any time you can add or… Read More »

Given an integer N, the task is to print first N Mosaic numbers. A Mosaic number can be expressed as follows: If N = p1a1p2a2…pkak… Read More »

Given a number N, the task is to find the number of ways of writing N as a sum of 4 squares. Two representations are… Read More »

Given an integer N, the task is to find the Nth Mosaic number. A Mosaic number can be expressed as follows: If N = Aa… Read More »

Given a N x N Chessboard. The task is to count distinct rectangles from the chessboard. For example, if the input is 8 then the… Read More »

Given an array arr[] containing N positive integer. The task is to find the sum of all the perfect numbers from the array. A number… Read More »

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

Apart from Sieve of Eratosthenes method to generate Prime numbers, we can implement a new Algorithm for generating prime numbers from 1 to N. It… Read More »

There are two players P1 and P2 and two piles of coins consisting of M and N coins respectively. At each turn, a player can… Read More »

Given a number X and an array of N numbers. The task is to print all the numbers in the array whose set of prime… Read More »