On the {0,1} Case of Guy's Problem F24: Reduction to a Pell‑Type Obstruction with Leading‑Digit Constraints

We study positive integers n such that the decimal expansion of n²,without leading zeros,uses only the digits 0 and 1.The known examples are the powers of 10.We prove a structural reduction to a Pell‑type family and a leading‑digit restriction to {1,3}.First,via a p‑adic valuation analysis,any counterexample must belong to one of the two Pell‑type families 5^{t+2}w−2^{t}u=±1, uw∈{0,1}.All other families are excluded by elementary decimal‑digit arguments.Second,using a simple leading‑digit analysis,we prove that if n² ∈ {0,1} and n is not a power of 10,then the leading digit of n is either 1 or 3.Combining these two reductions,the remaining obstruction is that the Pell‑generated integer n=50·10^{t}k+B, B²−4(25·10^{t})A=1,cannot have leading digit 1 or 3 and satisfy n² ∈ {0,1}*.We state this remaining problem as an open proposition.The conjecture remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-14
DOI
https://doi.org/10.5281/zenodo.21718595
Primary Topic
History and Theory of Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

On the {0,1} Case of Guy's Problem F24: Reduction to a Pell‑Type Obstruction with Leading‑Digit Constraints

Changming Qiu
Zenodo (CERN European Organization for Nuclear Research)
History and Theory of Mathematics
preprint

On the {0,1} Case of Guy's Problem F24: Reduction to a Pell‑Type Obstruction with Leading‑Digit Constraints

Changming Qiu
preprint en

Abstract

We study positive integers n such that the decimal expansion of n²,without leading zeros,uses only the digits 0 and 1.The known examples are the powers of 10.We prove a structural reduction to a Pell‑type family and a leading‑digit restriction to {1,3}.First,via a p‑adic valuation analysis,any counterexample must belong to one of the two Pell‑type families 5^{t+2}w−2^{t}u=±1, uw∈{0,1}.All other families are excluded by elementary decimal‑digit arguments.Second,using a simple leading‑digit analysis,we prove that if n² ∈ {0,1} and n is not a power of 10,then the leading digit of n is either 1 or 3.Combining these two reductions,the remaining obstruction is that the Pell‑generated integer n=50·10^{t}k+B, B²−4(25·10^{t})A=1,cannot have leading digit 1 or 3 and satisfy n² ∈ {0,1}*.We state this remaining problem as an open proposition.The conjecture remains open.

Zenodo (CERN European Organization for Nuclear Research)
History and Theory of Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.