Mathematical Algorithms Last Updated : 23 Jul, 2025 Comments Improve Suggest changes Like Article Like Report The following is the list of mathematical coding problem ordered topic wise. Please refer Mathematical Algorithms (Difficulty Wise) for the difficulty wise list of problems. GCD and LCM: GCD of Two Numbers LCM of Two Numbers LCM of array GCD of array Basic and Extended Euclidean Stein’s Algorithm for GCD GCD, LCM and Distributive Property Count pairs with gcd (A, B) as B GCD of floating point numbers Series with largest GCD and sum equals to n Largest Subset with GCD 1 Summation of GCD of all the pairs up to N Divisibility & Large Numbers: Divisibility by 3 Divisibility by 4 Divisibility by 6 Divisibility by 7 Divisibility by 9 Divisibility by 11 Divisibility by 12 Divisibility by 13 Divisibility by 15 Divisibility by 29 Series: Juggler Sequence Padovan Sequence Aliquot Sequence Moser-de Bruijn Sequence Stern-Brocot Sequence Newman-Conway Sequence Sylvester’s sequence Recaman’s sequence Sum of 2, 22, 222, ……… Sum of 1^2 + 3^2 + 5^2 + . . . + (2*n – 1)^2 Sum of 0.6, 0.06, 0.006, 0.0006, …to n terms n-th term of 2, 12, 36, 80, 150…. Number Digits: Minimum digits to remove to make a number Perfect Square Print first k digits of 1/n where n is a positive integer Check if a given number can be represented in given a no. of digits in any base Find element using minimum segments in Seven Segment Display Find next greater number with same set of digits Check if a number is jumbled or not Numbers having difference with digit sum more than s Total numbers with no repeated digits in a range K-th digit in ‘a’ raised to power ‘b’ Algebra: Program to add two polynomials Multiply two polynomials Find number of solutions of a linear equation of n variables Calculate the Discriminant Value Program for dot product and cross product of two vectors Iterated Logarithm log*(n) Program to find correlation coefficient Program for Muller Method Number of non-negative integral solutions of a + b + c = n Generate Pythagorean Triplets Number System: Exponential notation of a decimal number Check if a number is power of k using base changing method Convert a binary number to hexadecimal number Program for decimal to hexadecimal conversion Converting a Real Number (between 0 and 1) to Binary String Convert from any base to decimal and vice versa Decimal to binary conversion without using arithmetic operators Prime Numbers & Primality Tests: Prime Numbers Left-Truncatable Prime Mersenne Prime Super Prime Hardy-Ramanujan Theorem Rosser’s Theorem Fermat’s little theorem Introduction to Primality Test and School Method Vantieghems Theorem for Primality Test AKS Primality Test Lucas Primality Test Prime Factorization & Divisors: Prime factors Smith Numbers Sphenic Number Hoax Number k-th prime factor of a given number Pollard’s Rho Algorithm for Prime Factorization Finding power of prime number p in n! Find all divisors of a natural number Find numbers with n-divisors in a given range Modular Arithmetic: Modular Exponentiation (Power in Modular Arithmetic) Modular multiplicative inverse Modular Division Euler’s criterion (Check if square root under modulo p exists) Find sum of modulo K of first N natural number How to compute mod of a big number? Exponential Squaring (Fast Modulo Multiplication) Trick for modular division ( (x1 * x2 …. xn) / b ) mod (m) Factorial: Program for factorial of a number Legendre’s formula (Given p and n, find the largest x such that p^x divides n!) Count trailing zeroes in factorial of a number Factorial of a large number Primorial of a number Find maximum power of a number that divides a factorial Largest power of k in n! (factorial) where k may not be prime Check if a number is a Krishnamurthy Number or not Last non-zero digit of a factorial Count digits in a factorial using Logarithm Fibonacci Numbers: Fibonacci Numbers Interesting facts about Fibonacci numbers Zeckendorf’s Theorem (Non-Neighbouring Fibonacci Representation) Finding nth Fibonacci Number using Golden Ratio Matrix Exponentiation Fibonacci Coding Cassini’s Identity Tail Recursion for Fibonacci Catalan Numbers: Catalan numbers Applications of Catalan Numbers Dyck path Succinct Encoding of Binary Tree Find the number of valid parentheses expressions of given length nCr Computations: Binomial Coefficient Introduction and Dynamic Programming solution to compute nCr%p Program to calculate value of nCr Rencontres Number (Counting partial derangements) Sum of squares of binomial coefficients Space and time efficient Binomial Coefficient Horner’s Method for Polynomial Evaluation Set Theory: Power Set Minimize the absolute difference of sum of two subsets Sum of all subsets of a set formed by first n natural numbers Sum of average of all subsets Bell Numbers (Number of ways to Partition a Set) Sieve Algorithms: Sieve of Eratosthenes Segmented Sieve Sieve of Atkin Sieve of Sundaram to print all primes smaller than n Sieve of Eratosthenes in 0(n) time complexity Prime Factorization using Sieve O(log n) for multiple queries Euler Totient Function: Euler’s Totient Function Optimized Euler Totient Function for Multiple Evaluations Euler’s Totient function for all numbers smaller than or equal to n Primitive root of a prime number n modulo n Euler’s Four Square Identity Chinese Remainder Theorem: Introduction to Chinese Remainder Theorem Implementation of Chinese Remainder theorem (Inverse Modulo based implementation) Cyclic Redundancy Check and Modulo-2 Division Using Chinese Remainder Theorem to Combine Modular equations Some Practice Problems: Interquartile Range (IQR) Simulated Annealing Pseudo Random Number Generator (PRNG) Square root of a number using log Find ways an Integer can be expressed as sum of n-th power of unique natural numbers N-th root of a number Fast Fourier Transformation for poynomial multiplication Find Harmonic mean using Arithmetic mean and Geometric mean Double Base Palindrome Program for Derivative of a Polynomial Sgn value of a polynomial Check if a number is a power of another number Program to evaluate simple expressions Make a fair coin from a biased coin Implement *, – and / operations using only + arithmetic operator Quick Links : Learn Data Structure and Algorithms | DSA Tutorial Practrice Problems on Mathematical Algorithms Quizzes on Mathematical Algorithms Videos on Mathematical Algorithms Comment More infoAdvertise with us H harendrakumar123 Follow Improve Article Tags : Mathematical DSA Practice Tags : Mathematical Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. It’s the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like