Composite numbers k with no single digit factors whose factors are all substrings of k: Difference between revisions

Content added Content deleted
m (syntax highlighting fixup automation)
Line 972: Line 972:
5,526,173 11,610,313 13,436,683 13,731,373 13,737,841 13,831,103 15,813,251 17,692,313 19,173,071 28,118,827</pre>
5,526,173 11,610,313 13,436,683 13,731,373 13,737,841 13,831,103 15,813,251 17,692,313 19,173,071 28,118,827</pre>


=={{header|Ruby}}==
<syntaxhighlight lang="ruby">require 'prime'

generator2357 = Enumerator.new do |y|
gen23 = Prime::Generator23.new
gen23.each {|n| y << n unless (n%5 == 0 || n%7 == 0) }
end

res = generator2357.lazy.select do |n|
primes, exp = n.prime_division.transpose
next if exp.sum < 2 #exclude primes
s = n.to_s
primes.all?{|pr| s.match?(-pr.to_s) }
end

res.take(10).each{|n| puts n}</syntaxhighlight>
{{out}}
<pre>15317
59177
83731
119911
183347
192413
1819231
2111317
2237411
3129361
</pre>
=={{header|Sidef}}==
=={{header|Sidef}}==
<syntaxhighlight lang="ruby">var e = Enumerator({|f|
<syntaxhighlight lang="ruby">var e = Enumerator({|f|
Retrieved from "https://rosettacode.org/wiki/Composite_numbers_k_with_no_single_digit_factors_whose_factors_are_all_substrings_of_k"