|
2022-11-29, 20:39
|
#12 |
"NT"
May 2022
U.S.
2×3×5 Posts |
You're not sorting the numbers, just adding them to the end of the sequence one by one. So first you have 1,2; 1,2,3; 1,2,3,5; etc. so at each point it has to work. Lexicographically earliest infinite sequence of distinct terms means in dictionary order (so 1,2 is earlier than 1,3) and it has to be a sequence that can go on forever. Plus no terms are repeated.
With the unidirectional version, clockwise, it should start something like 1,2,4,7,3,9... Counterclockwise, I've only worked out 1,2,5,3... so far |
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Function graph | Beebah | Homework Help | 1 | 2019-10-30 21:33 |
| The Euclid-Mullin graph | sean | Factoring | 59 | 2016-05-29 08:26 |
| Problem E7 of Richard Guy's "Unsolved problems in number theory" | Batalov | Computer Science & Computational Number Theory | 40 | 2013-03-16 09:19 |
| Graph of server assignments | tha | PrimeNet | 1 | 2006-12-14 00:24 |
| A problem of number theory | hyh1048576 | Puzzles | 0 | 2003-09-28 15:35 |
