Primes which contain only one odd digit: Difference between revisions

m
→‎{{header|Sidef}}: minor optimizations
m (→‎{{header|Sidef}}: minor optimizations)
Line 880:
=={{header|Sidef}}==
<lang ruby>func primes_with_one_odd_digit(upto, base = 10) {
 
upto = prev_prime(upto+1)
 
var list = []
Line 889 ⟶ 891:
list << digits.grep { .is_odd && .is_prime && !.is_coprime(base) }...
 
for k in (0 .. upto.lenilog(base)-1) {
even_digits.variations_with_repetition(k, {|*a|
next if (a.last == 0)
breakvar ifv ([1,= a...].digits2num(base) > upto)
odd_digits.each {|d|
var n = [d, a...].digits2num(v*base + d)
list << n if (n.is_prime && (n <= upto))
}
})
2,747

edits