List of Mathematical Algorithms Hall's Marriage Theorem Hall's Marriage Theorem is a key concept in graph theory, proven by Philip Hall in 1935. It helps solve the marriage problem: given a set of girls and boys, under what conditions can each girl be matched to a boy she knows? This theorem is useful in various fields, such as job assignments.

List of Mathematical Algorithms Quota Sampling Quota Sampling is a non-probability sampling method in which researchers divide a certain population into certain groups basing on certain unique characteristics.

List of Mathematical Algorithms Causal Inference The process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system is called Causal inference. Usual statistical methods like correlation does not ensures causality. That's why we need a more scientific method to ensure causation.

List of Mathematical Algorithms Projection Pursuit (PP) Projection Pursuit is a statistical technique to find the most "interesting" possible projections of multidimensional data. Generally, projections with more deviation from normal distribution are preferred and considered as more interesting.

Algorithms Zellerâ€™s Congruence Zeller's Congruence is a mathematical algorithm devised by Christian Zeller to calculate the day of the week for any date in both the Julian and Gregorian calendars.

Algorithms Cook-Levin's Theorem The Cookâ€“Levin theorem, states that the Boolean satisfiability problem(SAT) is NP-complete.

Algorithms Legendre and His Formula: Speeding Up Factorial Calculations Factorial calculations are a fundamental mathematical operation in computer science, commonly used in algorithms and equations. The factorial of a non-negative integer 'n' is defined as the product of all positive integers from 1 to 'n.'

Algorithms Complexity analysis of Sieve of Eratosthenes In this article, we will discuss the Sieve of Eratosthenes method for identifying prime numbers, including its implementation, computational complexity, and alternative solutions.

List of Mathematical Algorithms Brocardâ€™s conjecture The Brocard conjecture states that the number of prime numbers lying between the squares of two consecutive prime numbers is four or more.

List of Mathematical Algorithms Oppermann's conjecture In this article, we have explored Oppermann's conjecture and implemented a program in an attempt to prove or disprove it. This is an important conjecture for prime numbers.

List of Mathematical Algorithms Brocard's problem In this article, we have explained the famous Brocard's problem and implemented solutions to find the 3 solutions to the problem.

Algorithms Super Pow Problem [LeetCode: 372] Your task is to calculate a^b mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.

Algorithms Different approaches to calculate Euler's Number (e) In this article, we have explored different approaches to calculate Euler's Number (e) along with sample implementations to calculate Euler's number to different precision.

List of Mathematical Algorithms Fermat number and Pepin's test In this article, we have explored the concept of Fermat number, demonstrated C++ implementations to compute and verify fermat number and explained Pepin's test for Fermat number.

Algorithms Sparse matrix multiplication In this article, we aim to study sparse matrices and the sparse matrix multiplication.

List of Mathematical Algorithms Lagrangeâ€™s Four Squares Theorem In this article, we will discus Lagrangeâ€™s four square theorem in detail with examples and an algorithm to verify it.

List of Mathematical Algorithms Mersenne prime numbers When 2^n -1 is prime, it is said to be a Mersenne prime. In this article, we have explored this concept of Mersenne prime numbers in depth along with algorithms + implementations to find Mersenne prime numbers.

List of Mathematical Algorithms Andrica's conjecture Andrica's conjecture states that for every gap between two consecutive square roots of prime numbers, the value of it is less than 1.

Algorithms Generate all palindromes less than N In this problem, we will see how to generate palindromic number in a given range efficiently by exploring the patterns of palindromes.

List of Mathematical Algorithms Cramer's conjecture In this article, we have explored Cramer's conjecture which is an important conjecture for prime numbers. We have developed a code to verify this conjecture.

List of Mathematical Algorithms Zeckendorf's theorem The Zeckendorf's theorem states that every positive integer can be represented uniquely as a sum of one or more distinct non-neighboring or non-consecutive Fibonacci numbers.

Algorithms Convert Binary to Hexadecimal, Octal, Decimal In this article, we will discuss how we can convert a binary number to a hexadecimal, octal, and decimal number.

List of Mathematical Algorithms Check if given year is a leap year [Algorithm] In this article, we have present the concept and algorithm to check if a given year is a leap year or not.

recursion Print all combinations of factors In this article, we will discuss about the algorithms to print every combination of factors of a given number (all factorization). We have explored recursive and partially iterative approach.

Algorithms Generate 0 and 1 with 25% and 75% probability Given a function that generates 0, 1 50% of the time (like most of the random function in modern programming languages do), how can we design a function that return 0, 1 25%, 75% of the time?