Talk:Ludic numbers: Difference between revisions

From Rosetta Code
Content added Content deleted
(to 1 or not to 1, that is the question)
 
Line 1: Line 1:
== 1 is the loneliest number... ==
== 1 is the loneliest number... ==
The OEIS thinks the sequence starts at 1. Obviously the task as originally specified draws from a source that thinks you should skip the 1, perhaps by analogy with prime numbers, which might or might not be construed as a false analogy, since the sequence contains other non-primes like 25, and since this sieve is based on position, not on value, as primes are. I like it with the 1, and marked the Python entry as incorrect somewhat tongue-in-cheekly, but I think we can agree that we oughta agree on definition one way or the other before this becomes a real task. <tt>:-)</tt> --[[User:TimToady|TimToady]] ([[User talk:TimToady|talk]]) 21:41, 15 March 2014 (UTC)
The OEIS thinks the sequence starts at 1. Obviously the task as originally specified draws from a source that thinks you should skip the 1, perhaps by analogy with prime numbers, which might or might not be construed as a false analogy, since the sequence contains other non-primes like 25, and since this sieve is based on position, not on value, as primes are. I like it with the 1, and marked the Python entry as incorrect somewhat tongue-in-cheekly, but I think we can agree that we oughta agree on definition one way or the other before this becomes a real task. <tt>:-)</tt> --[[User:TimToady|TimToady]] ([[User talk:TimToady|talk]]) 21:41, 15 March 2014 (UTC)

:Thanks Tim, I was so focused on the sieve loop, I forgot the initial 1. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 08:23, 16 March 2014 (UTC)

Revision as of 08:23, 16 March 2014

1 is the loneliest number...

The OEIS thinks the sequence starts at 1. Obviously the task as originally specified draws from a source that thinks you should skip the 1, perhaps by analogy with prime numbers, which might or might not be construed as a false analogy, since the sequence contains other non-primes like 25, and since this sieve is based on position, not on value, as primes are. I like it with the 1, and marked the Python entry as incorrect somewhat tongue-in-cheekly, but I think we can agree that we oughta agree on definition one way or the other before this becomes a real task. :-) --TimToady (talk) 21:41, 15 March 2014 (UTC)

Thanks Tim, I was so focused on the sieve loop, I forgot the initial 1. --Paddy3118 (talk) 08:23, 16 March 2014 (UTC)