Finding the set of all possible divisor products to form a number

Правка en1, от Impostor_Syndrome, 2022-05-08 21:39:16

Like for 75 we have (5,5,3), (25,3),(15,5),(75,1). Similarly how to do this for any given number if that number is given in its prime-factorised form?

Теги prime factorization, recursion, divisors

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Impostor_Syndrome 2022-05-08 21:39:16 216 Initial revision (published)