Skip to content
</>
CodingGyan
Topics
About
Search problems
☾
Home
/
Math and Number Theory
➗
Math and Number Theory
GCD, modular math, primes and number theory. 22 problems · Intermediate level.
All
Easy
Medium
Hard
22 problems
Primes
✓
Goldbach Pair
easy
✓
Count Primes up to N (Sieve of Eratosthenes)
medium
✓
N-th Prime Number
medium
Modular arithmetic
✓
Large Factorial Modulo M
easy
✓
Modular Exponentiation (Fast Power)
medium
✓
Modular Inverse (Extended Euclid)
hard
GCD and LCM
✓
GCD of an Array
easy
✓
LCM of an Array
easy
✓
Co-prime Check
beginner
Bit manipulation
✓
Count Set Bits
easy
✓
Power of Two Check
easy
✓
Single Number (XOR)
medium
✓
Reverse Bits of a 32-bit Number
medium
✓
Add Two Numbers Without + or -
hard
Big numbers
✓
Factorial of a Big Number
easy
✓
Add Two Huge Numbers (Strings)
medium
✓
Multiply Two Huge Numbers (Strings)
hard
number theory
✓
Digital Root
easy
✓
Trailing Zeros of n!
easy
✓
Euler's Totient Function
medium
✓
Chinese Remainder: Two Congruences
hard
number systems
✓
Convert a Number to Any Base
medium