number-theory

420+ posts

Similar Topics

DSA

20.6k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Competitive Programming

1.4k+ articles

620+ articles

580+ articles

540+ articles

330+ articles

310+ articles

190+ articles

Fermat's little theorem

Last Updated: 21 August 2022

Fermat's little theorem states that if p is a prime number, then for any integer a, the number a p - a is an integer multiple of p.Here p is a prime numberap ≡ a (mod p).S ...read more

Modulo 10^9+7 (1000000007)

Last Updated: 28 November 2022

In most programming competitions, we are required to answer the result in 10^9+7 modulo. The reason behind this is, if problem constraints are large integers, only efficie ...read more

Mathematical

Competitive Programming

Modular Arithmetic

number-theory

DSA

RSA Algorithm in Cryptography

Last Updated: 31 August 2023

RSA algorithm is an asymmetric cryptography algorithm. Asymmetric actually means that it works on two different keys i.e. Public Key and Private Key. As the name describes ...read more

cryptography

Computer Networks

number-theory

Finding sum of digits of a number until sum becomes single digit

Last Updated: 13 June 2022

Given a number n, we need to find the sum of its digits such that:If n 10 digSum(n) = nElse digSum(n) = Sum(digSum(n))Examples :Input : 1234Output : 1E...read more

Top 10 Algorithms and Data Structures for Competitive Programming

Last Updated: 15 December 2022

In this post, we will discuss Important top 10 algorithms and data structures for competitive coding.Topics :Graph algorithmsDynamic programmingSearching and Sorting:Numbe...read more

GBlog

Competitive Programming

GBlog-Competitive-Programming

DSA

Primality Test | Set 3 (Miller–Rabin)

Last Updated: 14 November 2022

Given a number n, check if it is prime or not. We have introduced and discussed School and Fermat methods for primality testing.Primality Test | Set 1 (Introduction and Sc ...read more

Introduction to Primality Test and School Method

Last Updated: 11 January 2023

Given a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Examples o ...read more

Modular multiplicative inverse

Last Updated: 17 February 2023

Given two integers A and M, find the modular multiplicative inverse of A under modulo M.The modular multiplicative inverse is an integer X such that:A X ≅ 1 (mod M) Note: ...read more

Euler's Totient Function

Last Updated: 25 January 2023

Euler's Totient function Φ (n) for an input n is the count of numbers in {1, 2, 3, ..., n-1} that are relatively prime to n, i.e., the numbers whose GCD (Greatest Common D...read more

Find the Factorial of a large number

Last Updated: 27 September 2023

Find the factorial of a large number.What is Factorial of a number?Factorial of a non-negative integer, is the multiplication of all integers smaller than or equal to n. E...read more

Find Excel column name from a given column number

Last Updated: 17 August 2022

MS Excel columns have a pattern like A, B, C, …, Z, AA, AB, AC, …., AZ, BA, BB, … ZZ, AAA, AAB ..... etc. In other words, column 1 is named "A", column 2 as "B", and colum ...read more

Sieve of Eratosthenes

Last Updated: 24 March 2023

Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.Example:Input : n =10Output : 2 3 5 7Input : n = 20Output: 2 3 5 7...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>