diff options
| author | James Smith <js5@sanger.ac.uk> | 2022-06-14 17:26:28 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-06-14 17:26:28 +0100 |
| commit | 36bfcead37e31c5e18d56199fb356964b5713652 (patch) | |
| tree | bc5314aedd3ca9859e528666af978e6d249e5a4d /challenge-169/james-smith | |
| parent | 30558d0b3f7cba8113cb3ca478bdf8472a21be93 (diff) | |
| download | perlweeklychallenge-club-36bfcead37e31c5e18d56199fb356964b5713652.tar.gz perlweeklychallenge-club-36bfcead37e31c5e18d56199fb356964b5713652.tar.bz2 perlweeklychallenge-club-36bfcead37e31c5e18d56199fb356964b5713652.zip | |
Update README.md
Diffstat (limited to 'challenge-169/james-smith')
| -rw-r--r-- | challenge-169/james-smith/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-169/james-smith/README.md b/challenge-169/james-smith/README.md index 6d54da8720..9b6a55a364 100644 --- a/challenge-169/james-smith/README.md +++ b/challenge-169/james-smith/README.md @@ -91,7 +91,7 @@ The output is the brilliant number and the two primes which are it's factors. # Challenge 2 - Achilles Number -***Write a script to generate first 20 Achilles Numbers. An Achilles number is a number that is powerful but imperfect (not a perfect power). Named after Achilles, a hero of the Trojan war, who was also powerful but imperfect. A positive integer n is a powerful number if, for every prime factor p of n, p^2 is also a divisor, AND that the GCD of the powers is 1. A number is a perfect power if it has any integer roots (square root, cube root, etc.). +***Write a script to generate first 20 Achilles Numbers. An Achilles number is a number that is powerful but imperfect (not a perfect power). Named after Achilles, a hero of the Trojan war, who was also powerful but imperfect. A positive integer n is a powerful number if, for every prime factor p of n, p^2 is also a divisor, AND that the GCD of the powers is 1. A number is a perfect power if it has any integer roots (square root, cube root, etc.).*** ## Solution |