Mathematical Algorithms | Prime Factorization and Divisors


Recent articles on Prime Factorization and Divisors !

  1. Prime factors
  2. Smith Numbers
  3. Sphenic Number
  4. Hoax Number
  5. Frugal Number
  6. Blum Integer
  7. Superperfect Number
  8. Powerful Number
  9. Deficient Number
  10. Perfect Number
  11. Betrothed numbers
  12. k-Rough Number or k-Jagged Number
  13. Aliquot sum
  14. Fermat’s Last Theorem
  15. Lemoine’s Conjecture
  16. Fast inverse square root
  17. Program for Mobius Function
  18. Ordered Prime Signature
  19. k-th prime factor of a given number
  20. Pollard’s Rho Algorithm for Prime Factorization
  21. Prime Factorization using Sieve O(log n) for multiple queries
  22. Find politeness of a number
  23. Find sum of even factors of a number
  24. Find sum of odd factors of a number
  25. Find largest prime factor of a number
  26. Find minimum sum of factors of number
  27. Finding power of prime number p in n!
  28. Find if n can be written as product of k numbers
  29. Find sum of divisors of all the divisors of a natural number
  30. Find numbers with K odd divisors in a given range
  31. Find all divisors of a natural number | Set 1
  32. Find all divisors of a natural number | Set 2
  33. Find all divisors of a natural number
  34. Find numbers with n-divisors in a given range
  35. Find minimum number to be divided to make a number a perfect square
  36. Sum of all proper divisors of a natural number
  37. Sum of all the factors of a number
  38. Sum of largest prime factor of each number less than equal to n
  39. Sum of all divisors from 1 to n
  40. Check for Amicable Pair
  41. Check if the given two numbers are friendly pair or not
  42. Check if a number is divisible by all prime divisors of another number
  43. Check whether a number has exactly three distinct factors or not
  44. Check if the door is open or closed
  45. Check if count of divisors is even or odd
  46. Product of factors of number
  47. Product of unique prime factors of a number
  48. P – smooth numbers in given ranges
  49. P-Smooth Numbers or P-friable Number
  50. Power of a prime number ‘r’ in n!
  51. Print all combinations of factors (Ways to factorize)
  52. Total number of divisors for a given number
  53. Max occurring divisor in an interval
  54. Smallest integer which has n factors or more
  55. Break a number such that sum of maximum divisors of all parts is minimum
  56. K-Primes (Numbers with k prime factors) in a range
  57. Queries to print all divisors of number
  58. Maximum factors formed by two numbers
  59. Prime factors of a big number
  60. Divisors of n-square that are not divisors of n
  61. Number of steps to convert to prime factors
  62. Queries to find whether a number has exactly four distinct factors or not
  63. Total number of divisors for a given number
  64. Ways to express a number as product of two different factors
  65. Count divisors of n that have at-least one digit common with n
  66. Count divisors of array multiplication
  67. Count total divisors of A or B in a given range
  68. Count Divisors of n in O(n^1/3)
  69. Count all perfect divisors of a number
  70. Efficient program to print the number of factors of n numbers
  71. Total number of divisors for a given number
  72. Maximum number of unique prime factors
  73. Numbers with exactly 3 divisors
  74. Determine whether a given number is a Hyperperfect Number
  75. Nearest element with at-least one common prime factor
  76. Number with maximum number of prime factors
  77. Queries on the sum of prime factor counts in a range
  78. Generation of n numbers with given set of factors
  79. Prime factors of LCM of array elements
  80. Querying maximum number of divisors that a number in a given range has
  81. Exactly n distinct prime factor numbers from a to b
  82. Common Divisors of Two Numbers
  83. Least prime factor of numbers till n
  84. Print all prime factors and their powers
  85. Number of elements with odd factors in given range
  86. 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.



My Personal Notes arrow_drop_up