Composite numbers k with no single digit factors whose factors are all substrings of k: Difference between revisions
Content added Content deleted
Line 934: | Line 934: | ||
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Total time:%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)})</span> |
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Total time:%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)})</span> |
||
<!--</lang>--> |
<!--</lang>--> |
||
=={{header|Python}}== |
|||
<lang python>from sympy import isprime, factorint |
|||
def contains_its_prime_factors_all_over_7(n): |
|||
if n < 10 or isprime(n): |
|||
return False |
|||
strn = str(n) |
|||
pfacs = factorint(n).keys() |
|||
return all(f > 9 and str(f) in strn for f in pfacs) |
|||
found = 0 |
|||
for n in range(1_000_000_000): |
|||
if contains_its_prime_factors_all_over_7(n): |
|||
found += 1 |
|||
print(f'{n: 12,}', end = '\n' if found % 10 == 0 else '') |
|||
if found == 20: |
|||
break |
|||
</lang>{{out}} |
|||
<pre> |
|||
15,317 59,177 83,731 119,911 183,347 192,413 1,819,231 2,111,317 2,237,411 3,129,361 |
|||
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|Raku}}== |
=={{header|Raku}}== |