Sha256: 3337a47881c87ad9f1d0ec6b469d817e7663e2dc39c03b74b21c6cef0165a4e4
Contents?: true
Size: 776 Bytes
Versions: 56
Compression:
Stored size: 776 Bytes
Contents
Compute the prime factors of a given natural number. A prime number is only evenly divisible by itself and 1. Note that 1 is not a prime number. ## Example What are the prime factors of 60? - Our first divisor is 2. 2 goes into 60, leaving 30. - 2 goes into 30, leaving 15. - 2 doesn't go cleanly into 15. So let's move on to our next divisor, 3. - 3 goes cleanly into 15, leaving 5. - 3 does not go cleanly into 5. The next possible factor is 4. - 4 does not go cleanly into 5. The next possible factor is 5. - 5 does go cleanly into 5. - We're left only with 1, so now, we're done. Our successful divisors in that computation represent the list of prime factors of 60: 2, 2, 3, and 5. You can check this yourself: - 2 * 2 * 3 * 5 - = 4 * 15 - = 60 - Success!
Version data entries
56 entries across 56 versions & 1 rubygems