ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϵ>0\epsilon>0 be arbitrarily small, and let m∈Nm\in\mathbb{N} be sufficiently large. For each positive integer kk, consider a prime pp, an integer β\beta, and an integer nn satisfying

110≤pn2m≤10.\frac{1}{10}\leq\frac{p^n}{2^m}\leq 10.

Krantz's conjecture. Does there exist such a prime pp, integer β\beta, and integer nn such that

∣k2m−βpn∣<ϵ2m?\left|\frac{k}{2^m}-\frac{\beta}{p^n}\right|<\frac{\epsilon}{2^m}?

This conjecture concerns the approximation of dyadic rationals by rationals whose denominators are powers of a prime of comparable size. The paper invokes it as a question attributed to Krantz; no resolution is supplied 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.