Answer can be found in the back of the book.
Every natural number n ≥ 2 can be written n = p1p2… p1as the product of distinct prime numbers p1, p2, …, pr.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.