ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≠2p\neq 2 be a prime, let m=2pm=2p, and let mlml−1⋯m1m0m_lm_{l-1}\cdots m_1m_0 be the standard base-22 representation of mm. Let n≥1n\geq 1. Write n1n_1 for the leading digit in the base-pp representation of nn, let ∣m∣0|m|_0 denote the number of zeros in the standard binary representation of mm, and let mod⁡(a,b)\operatorname{mod}(a,b) be the unique integer xx with x≡a(modb)x\equiv a\pmod b and 0≤x<b0\leq x<b. Binary-representation conjecture. The quantity

2n(n2p)−(p+1)(n1−1)pδp∣n\frac{2}{n}\binom{n}{2p}-\frac{(p+1)(n_1-1)}{p}\delta_{p\mid n}

is odd if and only if

n≡2p+∑i=0l⌊j2∣mod⁡(2p,2i+1)∣0−δi=1⌋mi2i(mod2⌊log⁡2(2p)⌋+1)n\equiv 2p+\sum_{i=0}^l\left\lfloor\frac{j}{2^{|\operatorname{mod}(2p,2^{i+1})|_0-\delta_{i=1}}}\right\rfloor m_i2^i\pmod{2^{\lfloor\log_2(2p)\rfloor+1}}

for some 0≤j≤2∣2p∣0−10\leq j\leq 2^{|2p|_0}-1. This criterion is intended to determine the fractional part of 1n(n2p)\frac{1}{n}\binom{n}{2p} from the binary representation of pp; its resolution is not given here.

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.