Number Theory
Modular Arithmetic
By SHIKHAR SONI
● Published At Jan 2022
Binary Exponentiation
By Shreya Deep
● Published At Jan 2022
GCD Euclidean Algorithm
By Gaurish Anand
● Published At Feb 2022
In this article, we will learn to calculate the GCD using the euclidean algorithm.... Keep reading ..
Extended Euclidean Algorithm
By SHIKHAR SONI
● Published At Jan 2022
Modular Multiplicative Inverse
By SHIKHAR SONI
● Published At Jan 2022
In this article, we discuss the implementation of brute force and optimized approaches in detail to calculate the modular multiplicative inverse.... Keep reading ..
Introduction to Chinese Remainder Theorem
By GAZAL ARORA
● Published At Mar 2022
In this article, we will learn about the Chinese Remainder Theorem discovered by a Chinese mathematician Sun Zi. It is an important theorem, so read until the end to understand better.... Keep reading ..
Euler’s Totient Function
By Nishant Rana
● Published At Feb 2022
This blog will cover the theory and implementation part of Euler’s Totient function and discussion over its Time and Space complexity. ... Keep reading ..
Applications
Modular exponentiation with GCD
By Shreya Deep
● Published At Feb 2022
Hidden squares
By Abhishek Ranjan
● Published At Mar 2022
In this article, we will solve a number theory problem, the concealed square. ... Keep reading ..
Remainders Game
By Apoorv
● Published At Feb 2022
This article will discuss the solution for the problem statement “ Game of Remainders”. Along with the solution, the article focuses on the time and space complexity of the solution. ... Keep reading ..
Aman and Multiplicative Queries for two arrays
By Apoorv
● Published At Mar 2022
This article will discuss the solution for the problem statement “Multiplicative Queries for two arrays”. Along with the solution, the article focuses on the time and space complexity of the solution.... Keep reading ..
Number Of Ways To Get A Sum Equal To N Using Odd Consecutive Natural Numbers
By Jaglike Makkar
● Published At Mar 2022
In this article, we will discuss finding the number of ways to get a sum equal to N by adding consecutive odd natural numbers. We will also focus on the complexity of our solution.... Keep reading ..