# Mathematical Algorithms | Prime numbers and Primality Tests

### Recent Articles on Prime Number !

- Prime Numbers
- Special prime numbers
- Prime numbers and Fibonacci
- Left-Truncatable Prime
- Mersenne Prime
- Super Prime
- Palindromic Primes
- Sophie Germain Prime
- Almost Prime Numbers
- Twin Prime Numbers
- Pernicious number
- Twisted Prime Number
- Balanced Prime
- Sexy Prime
- Pierpont Prime
- Newman–Shanks–Williams prime
- Right-Truncatable Prime
- Prime Triplet
- Hardy-Ramanujan Theorem
- Rosser’s Theorem
- Fermat’s little theorem
- Composite Number
- Euclid Euler Theorem
- Euclid’s Lemma
- Bertrand’s Postulate
- Legendre’s Conjecture
- The Ulam Spiral
- Co-prime pair with given sum minimum difference
- Primality Test | Set 1 (Introduction and School Method)
- Primality Test | Set 2 (Fermat Method)
- Primality Test | Set 3 (Miller–Rabin)
- Primality Test | Set 4 (Solovay-Strassen)
- Primality Test | Set 5 (Using Lucas-Lehmer Series)
- Vantieghems Theorem for Primality Test
- AKS Primality Test
- Lucas Primality Test
- 2^x + 1 and Prime
- Recursive program for prime number
- Circular primes less than n
- Check a number for Permutable Prime
- Check whether a number is Emirpimes or not
- Check if a number is sandwiched between primes
- Check whether a number is semiprime or not
- Check if given number is Emirp Number or not
- Check whether a number is circular prime or not
- Check whether given three numbers are adjacent primes
- Check if a number is Full Prime
- Check if two numbers are co-prime or not
- Check whether a number can be expressed as a product of single digit numbers
- Check if a number can be written as a sum of ‘k’ prime numbers
- Twin Prime Numbers between 1 and n
- Finding a Non Transitive Coprime Triplet in a Range
- Largest number in [2, 3, .. n] which is co-prime with numbers in [2, 3, .. m]
- Sum of largest divisible powers of p (a prime number) in a range
- Express an odd number as sum of prime numbers
- Queries for maximum difference between prime numbers in given ranges
- Recursive sum of digits of a number is prime or not
- Number of co-prime pairs in an array
- Count Primes in Ranges
- Count pairs with sum as a prime number and less than n
- N expressed as sum of 4 prime numbers
- Prime Number of Set Bits in Binary Representation
- Analysis of Different Methods to find Prime Number in Python
- An interesting solution to get all prime numbers smaller than n
- Insert minimum number in array so that sum of array becomes prime
- Find the prime numbers which can written as sum of most consecutive primes
- Find coordinates of a prime number in a Prime Spiral
- Program to find sum of prime numbers between 1 to n
- Print prime numbers from 1 to N in reverse order
- Finding n-th number made of prime digits (2, 3, 5 and 7) only
- Find two prime numbers with given sum
- Find the highest occurring digit in prime numbers in a range
- Prime points (Points that split a number into two primes)
- Program for Goldbach’s Conjecture (Two Primes with given Sum)

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.