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
Nº Q6671695 ★★★
Rara · Saberes
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
In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that n {\displaystyle n} runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least 1 / n {\displaystyle 1/n} units away from all others.
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that n {\displaystyle n} runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least 1 / n {\displaystyle 1/n} units away from all others. The conjecture was first posed in 1967 by German mathematician Jörg Wills, in purely number-theoretic terms, and independently as a view-obstruction problem in 1974 by Thomas W. Cusick; its illustrative and now-popular formulation dates to 1998. The conjecture is known to be true for 13 {\displaystyle 13} runners or fewer, but the general case remains unsolved. Implications of the conjecture include solutions to view-obstruction problems and bounds on properties, related to chromatic numbers, of certain graphs.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Rocchini (CC BY 3.0) ·
