Similar Topics

20.6k+ articles

7.6k+ articles

6.3k+ articles

2k+ articles

Competitive Programming

1.4k+ articles

School Programming

1.4k+ articles

1.2k+ articles

580+ articles

420+ articles

290+ articles

GCD-LCM

310+ posts

Popular articles

Recent articles

Python Program to Find the Gcd of Two Numbers

Last Updated: 22 June 2023

Given two numbers, The task is to find the GCD of the two numbers.Python Program to Find the Gcd of Two Numbers Using STLIn Python, the math module contains a number of ma ...read more

Python Programs

Must do Math for Competitive Programming

Last Updated: 19 February 2023

Competitive Programming (CP) doesn’t typically require one to know high-level calculus or some rocket science. But there are some concepts and tricks which are sufficient ...read more

Competitive Programming

Modular Arithmetic

Write From Home

GBlog-Competitive-Programming

Reduce the fraction to its lowest form

Last Updated: 17 March 2023

Given two integers x and y and where x is divisible by y. It can be represented in the form of a fraction x/y. The task is to reduce the fraction to its lowest form.Exampl ...read more

school-programming

Similar Topics

20.6k+ articles

7.6k+ articles

6.3k+ articles

2k+ articles

Competitive Programming

1.4k+ articles

School Programming

1.4k+ articles

1.2k+ articles

580+ articles

420+ articles

290+ articles

Program to calculate the value of nCr Efficiently

Last Updated: 20 August 2022

Given two numbers n, r ( n=r ). The task is to find the value of C(n, r) for big value of n.Examples:Input: n = 30, r = 15Output: 155117520C(30, 15) is 155117520 by 30!/( ...read more

Permutation and Combination

Technical Scripter 2018

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

Check if two numbers are co-prime or not

Last Updated: 16 February 2023

Two numbers A and B are said to be Co-Prime or mutually prime if the Greatest Common Divisor of them is 1. You have been given two numbers A and B, find if they are Co-pri ...read more

Basic Coding Problems

Find pair with maximum GCD in an array

Last Updated: 24 April 2023

We are given an array of positive integers. Find the pair in array with maximum GCD.Examples:Input : arr[] : { 1 2 3 4 5 }Output : 2Explanation : Pair {2, 4} has GCD 2 whi ...read more

GCD of more than two (or array) numbers

Last Updated: 13 September 2023

Given an array of numbers, find GCD of the array elements. In a previous post we find GCD of two number.Examples:Input : arr[] = {1, 2, 3}Output : 1Input : arr[] = {2, 4 ...read more

Smallest number divisible by first n numbers

Last Updated: 30 December 2022

Given a number n find the smallest number evenly divisible by each number 1 to n.Examples:Input : n = 4Output : 12Explanation : 12 is the smallest numbers divisible ...read more

Stein's Algorithm for finding GCD

Last Updated: 04 July 2022

Stein's algorithm or binary GCD algorithm is an algorithm that computes the greatest common divisor of two non-negative integers. Stein’s algorithm replaces division with ...read more

LCM of given array elements

Last Updated: 04 April 2023

Given an array of n numbers, find the LCM of it.Example:Input : {1, 2, 8, 3}Output : 24Input : {2, 7, 3, 9, 4}Output : 252Recommended PracticeLCM of given array elementsTr ...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

Modular Arithmetic

Euclidean algorithms (Basic and Extended)

Last Updated: 01 September 2022

The Euclidean algorithm is a way to find the greatest common divisor of two positive integers. GCD of two numbers is the largest number that divides both of them. A simple...read more

Program to find LCM of two numbers

Last Updated: 16 March 2023

LCM (Least Common Multiple) of two numbers is the smallest number which can be divided by both numbers.For example, LCM of 15 and 20 is 60, and LCM of 5 and 7 is 35.A simp...read more

Basic Coding Problems

Program to Find GCD or HCF of Two Numbers

Last Updated: 26 September 2023

Given two numbers a and b, the task is to find the GCD of the two numbers.Note: GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest ...read more

Basic Coding Problems

1 2 3 4 5 6 7 8 >>