Talk:Factors of an integer: Difference between revisions
Content added Content deleted
(→task description: added a better wording, added note about semi-primes.) |
|||
Line 14: | Line 14: | ||
The first sentence should be "Find the factors of a positive integer.", as the second sentence goes on to define what the factors are of a positive integer, not a number. -- [[User:Gerard Schildberger|Gerard Schildberger]] 04:57, 30 April 2012 (UTC) |
The first sentence should be "Find the factors of a positive integer.", as the second sentence goes on to define what the factors are of a positive integer, not a number. -- [[User:Gerard Schildberger|Gerard Schildberger]] 04:57, 30 April 2012 (UTC) |
||
The last preamble sentence in the Rosetta Code task: |
|||
::* ''Note that even prime numbers will have will have at least two factors; ‘1’ and themselves.'' |
|||
would read better as: |
|||
::* ''Note that'' all ''prime numbers will have'' exactly two ''factors: unity and the prime number itself''. |
|||
<br>When I first read the above (original) sentence, I thought: "why single out the even prime (as there is only one of those, namely <big>2</big>), ··· and exclude the odd primes? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:23, 14 June 2015 (UTC) |
|||
<br><br>Also, worthy of note is: All '''semiprimes''' (also known as '''biprimes''' or '''2-almost primes''') have exactly three factors: unity and two (not necessarily distinct) primes. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:23, 14 June 2015 (UTC) |
|||
==Python relative performance== |
==Python relative performance== |