# Mathematical Algorithms | Prime Factorization and Divisors

### Recent articles on Prime Factorization and Divisors !

- Prime factors
- Smith Numbers
- Sphenic Number
- Hoax Number
- Frugal Number
- Blum Integer
- Superperfect Number
- Powerful Number
- Deficient Number
- Perfect Number
- Betrothed numbers
- k-Rough Number or k-Jagged Number
- Aliquot sum
- Fermat’s Last Theorem
- Lemoine’s Conjecture
- Fast inverse square root
- Program for Mobius Function
- Ordered Prime Signature
- k-th prime factor of a given number
- Pollard’s Rho Algorithm for Prime Factorization
- Prime Factorization using Sieve O(log n) for multiple queries
- Find politeness of a number
- Find sum of even factors of a number
- Find sum of odd factors of a number
- Find largest prime factor of a number
- Find minimum sum of factors of number
- Finding power of prime number p in n!
- Find if n can be written as product of k numbers
- Find sum of divisors of all the divisors of a natural number
- Find numbers with K odd divisors in a given range
- Find all divisors of a natural number | Set 1
- Find all divisors of a natural number | Set 2
- Find all divisors of a natural number
- Find numbers with n-divisors in a given range
- Find minimum number to be divided to make a number a perfect square
- Sum of all proper divisors of a natural number
- Sum of all the factors of a number
- Sum of largest prime factor of each number less than equal to n
- Sum of all divisors from 1 to n
- Check for Amicable Pair
- Check if the given two numbers are friendly pair or not
- Check if a number is divisible by all prime divisors of another number
- Check whether a number has exactly three distinct factors or not
- Check if the door is open or closed
- Check if count of divisors is even or odd
- Product of factors of number
- Product of unique prime factors of a number
- P – smooth numbers in given ranges
- P-Smooth Numbers or P-friable Number
- Power of a prime number ‘r’ in n!
- Print all combinations of factors (Ways to factorize)
- Total number of divisors for a given number
- Max occurring divisor in an interval
- Smallest integer which has n factors or more
- Break a number such that sum of maximum divisors of all parts is minimum
- K-Primes (Numbers with k prime factors) in a range
- Queries to print all divisors of number
- Maximum factors formed by two numbers
- Prime factors of a big number
- Divisors of n-square that are not divisors of n
- Number of steps to convert to prime factors
- Queries to find whether a number has exactly four distinct factors or not
- Total number of divisors for a given number
- Ways to express a number as product of two different factors
- Count divisors of n that have at-least one digit common with n
- Count divisors of array multiplication
- Count total divisors of A or B in a given range
- Count Divisors of n in O(n^1/3)
- Count all perfect divisors of a number
- Efficient program to print the number of factors of n numbers
- Total number of divisors for a given number
- Maximum number of unique prime factors
- Numbers with exactly 3 divisors
- Determine whether a given number is a Hyperperfect Number
- Nearest element with at-least one common prime factor
- Number with maximum number of prime factors
- Queries on the sum of prime factor counts in a range
- Generation of n numbers with given set of factors
- Prime factors of LCM of array elements
- Querying maximum number of divisors that a number in a given range has
- Exactly n distinct prime factor numbers from a to b
- Common Divisors of Two Numbers
- Least prime factor of numbers till n
- Print all prime factors and their powers
- Number of elements with odd factors in given range
- No of Factors of n!

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