ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rr be a positive integer, let S1⊂Z2\mathcal{S}^1 \subset \mathbb{Z}^2 be the circular path of radius rr constructed recursively by the stated algorithm, and let (xn,yn)(x_n,y_n) denote its points for 0≤n≤2r−10\leq n\leq 2r-1. Define an=∣xn∣+∣yn∣a_n=|x_n|+|y_n| and C=8r\mathcal{C}=8r. Set

πn(r)=C2an(r)=4ran(r)\pi_n(r)=\frac{\mathcal{C}}{2a_n(r)}=\frac{4r}{a_n(r)}

and define their arithmetic mean by

A(πn)=12r∑n=02r−1C2an(r)=2∑n=02r−11an(r).A(\pi_n)=\frac{1}{2r}\sum_{n=0}^{2r-1}\frac{\mathcal{C}}{2a_n(r)}=2\sum_{n=0}^{2r-1}\frac{1}{a_n(r)}.

Manhattan-circle mean conjecture. The arithmetic mean converges to π\pi in the asymptotic limit:

lim⁡r→∞A(πn)=π.\lim_{r\to\infty}A(\pi_n)=\pi.

The claim formalizes the observed numerical emergence of π\pi from averaging the values associated with points on discrete circles in the ℓ1\ell^1 metric. The supplied text gives numerical evidence for convergence but no proof or resolution, so the conjecture remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.