Almost prime: Difference between revisions
Content added Content deleted
(New draft task and Python solution.) |
(→{{header|Python}}: Import message.) |
||
Line 7: | Line 7: | ||
=={{header|Python}}== |
=={{header|Python}}== |
||
This imports [[Prime decomposition#Python]] |
|||
<lang python>from prime_decomposition import decompose |
<lang python>from prime_decomposition import decompose |
||
from itertools import islice, count |
from itertools import islice, count |
Revision as of 20:49, 21 February 2014
Almost prime is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
A k-Almost-prime number is a natural number , that is the exact multiple of primes.
So, for example if k is 1, then this is the series of prime numbers themselves. If k is 2 then this is the series of semiprimes.
The task is to write a function/method/subroutine/... that generates k-almost primes and use it to create a table of the first ten members of k-Almost primes for .
Python
This imports Prime decomposition#Python
<lang python>from prime_decomposition import decompose from itertools import islice, count try:
from functools import reduce
except:
pass
def almostprime(n, k=2):
d = decompose(n) try: terms = [d.next() for i in range(k)] return reduce(int.__mul__, terms, 1) == n except: return False
if __name__ == '__main__':
for k in range(1,6): print('%i: %r' % (k, list(islice((n for n in count() if almostprime(n, k)), 10))))</lang>
- Output:
1: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] 2: [4, 6, 9, 10, 14, 15, 21, 22, 25, 26] 3: [8, 12, 18, 20, 27, 28, 30, 42, 44, 45] 4: [16, 24, 36, 40, 54, 56, 60, 81, 84, 88] 5: [32, 48, 72, 80, 108, 112, 120, 162, 168, 176]