Achilles numbers: Difference between revisions
→{{header|Wren}}: Tidied and moved totient function to Math library as it's used quite often.
(Added BASIC256) |
(→{{header|Wren}}: Tidied and moved totient function to Math library as it's used quite often.) |
||
Line 3,281:
===Version 1 (Brute force)===
This finds the number of 6 digit Achilles numbers in 2.5 seconds, 7 digits in 51 seconds but 8 digits needs a whopping 21 minutes!
<syntaxhighlight lang="
import "./seq" for Lst
import "./fmt" for Fmt
Line 3,288:
var limit = 10.pow(maxDigits)
var c = Int.primeSieve(limit-1, false)
var isPerfectPower = Fn.new { |n|
Line 3,346 ⟶ 3,331:
var isStrongAchilles = Fn.new { |n|
if (!isAchilles.call(n)) return false
var tot =
return isAchilles.call(tot)
}
Line 3,361 ⟶ 3,346:
n = n + 1
}
Fmt.tprint("$4d", achilles, 10)
System.print("\nFirst 30 strong Achilles numbers:")
Line 3,374 ⟶ 3,359:
n = n + 1
}
Fmt.tprint("$5d", strongAchilles, 10)
System.print("\nNumber of Achilles numbers with:")
Line 3,415 ⟶ 3,400:
Ridiculously fast compared to the previous method: 12 digits can now be reached in 1.03 seconds, 13 digits in 3.7 seconds, 14 digits in 12.2 seconds and 15 digits in 69 seconds.
<syntaxhighlight lang="
import "./seq" for Lst
import "./math" for Int
import "./fmt" for Fmt
var pps = Set.new()
Line 3,469 ⟶ 3,440:
System.print("First 50 Achilles numbers:")
Fmt.tprint("$4d", achilles.take(50), 10)
System.print("\nFirst 30 strong Achilles numbers:")
Line 3,476 ⟶ 3,447:
var n = 0
while (count < 30) {
var tot =
if (achillesSet.contains(tot)) {
strongAchilles.add(achilles[n])
Line 3,483 ⟶ 3,454:
n = n + 1
}
Fmt.tprint("$5d", strongAchilles, 10)
System.print("\nNumber of Achilles numbers with:")
| |||