lonely runner conjecture (Q6671695)

From Wikidata
Jump to navigation Jump to search
number-theoretic conjecture that states that 𝑘 people running around a circular track with distinct speeds will each be, at some point, separated by ¹⁄ₖ from every other runner
edit
Language Label Description Also known as
English
lonely runner conjecture
number-theoretic conjecture that states that 𝑘 people running around a circular track with distinct speeds will each be, at some point, separated by ¹⁄ₖ from every other runner

    Statements

    0 references
    Lonely runner.gif
    256 × 256; 1.15 MB
    example of a case of the conjecture with 6 runners: black runners have not yet been lonely; white arcs, of length ²⁄₆, indicate that a runner is currently lonely; yellow runners have experienced loneliness (English)
    0 references
    0 references
    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit