mersenneforum.org A graph theory (I think) problem
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2022-11-29, 20:39 #12 oreotheory     "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 Beebah Homework Help 1 2019-10-30 21:33 sean Factoring 59 2016-05-29 08:26 Batalov Computer Science & Computational Number Theory 40 2013-03-16 09:19 tha PrimeNet 1 2006-12-14 00:24 hyh1048576 Puzzles 0 2003-09-28 15:35

All times are UTC. The time now is 18:54.

Wed Feb 1 18:54:16 UTC 2023 up 167 days, 16:22, 0 users, load averages: 1.34, 1.10, 1.11

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔