Revision as of 13:10, 4 October 2018 (view source) Thundergnat (talk \| contribs) m (reword) ← Older edit		Revision as of 15:28, 4 October 2018 (view source) Thundergnat (talk \| contribs) m (further clarification) Newer edit →
Line 44: ::Do you mean not needing, otherwise I can make no sense of the above, either way perhaps you could clarify what you'd like to change. In the Python program you define primeset. You then write 'for p in primes' which recalculates the primes, why don't you instead say for p in primeset? You define 'primearray = [n in primeset for n in range(LIMIT)]' where is primearray actually used?--[[User:Nigel Galloway\|Nigel Galloway]] ([[User talk:Nigel Galloway\|talk]]) 12:20, 4 October 2018 (UTC) :: (in reply to Paddy3118) Let me explain my reasoning with an analogous (though slightly bogus) example: Suppose we had some hypothetical task: "'''List the ~~numbers~~positive integers less than 50 whose square contains a digit '1''''". Would you argue that only 1 and 4 should be listed? After all, the limit is 50, and 9, ~~has~~10, ~~(and~~11, etc. have (all numbers larger than 7 have) a square greater than the limit. The task is asking for numbers within a limit that have a certain property. The fact that having that property ~~depends~~may depend on numbers outside of that limit doesn't change that it has that property. --[[User:Thundergnat\|Thundergnat]] ([[User talk:Thundergnat\|talk]]) 12:54, 4 October 2018 (UTC)

Talk:Sexy primes: Difference between revisions

Talk:Sexy primes (view source)