Penholodigital squares: Difference between revisions

Content added Content deleted
(→‎{{header|Raku}}: prepend Free Pascal Version)
(→‎{{header|Wren}}: Added a minimum starting value for the search.)
Line 474: Line 474:
for (d in 1...b) master = master * primes[d-1]
for (d in 1...b) master = master * primes[d-1]
var phd = []
var phd = []
var min = Conv.atoi(digits[0..(b-2)].join(), b).sqrt.ceil
var max = Conv.atoi(digits[(b-2)..0].join(), b).sqrt.floor
var max = Conv.atoi(digits[(b-2)..0].join(), b).sqrt.floor
for (i in 1..max) {
for (i in min..max) {
var sq = i * i
var sq = i * i
if (b == 10 && (sq % 3) != 0) continue
if (b == 10 && (sq % 3) != 0) continue