An invalid center and unspecified terminal Padé quotient were removed from the controlling route. Exact lattice, carry, tangent, reciprocal, and Hankel identities remain viable if coupled to arithmetic spacing, valuation, or forced common factors.
Route status · Narrowed routeExponential Diophantine equations · Fermat numbers · square factors · 2-adic valuations
Square-Freeness of Fermat Numbers
Collaboration betaCan any prime divide a Fermat number twice? The packet narrows where such a square factor could occur, but it does not rule one out.
Known results and sources
Research problem
Exact mathematical statement
For every integer , let
The conjecture asks whether is square-free for every , equivalently whether no prime satisfies .
Problem infographic
Problem at a glance

Current mathematical picture
Where work on Square-Freeness of Fermat Numbers stands
Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.
A hypothetical square factor is placed into exponent bands using E=2^n and t=v₂(p−1); the current packet analyzes 7t<E<8t through a lattice parametrization, terminal carry equations, tangent quotients, and rank-three Hankel identities.
Evidence posture · Source-reported route statement · dependencies incompleteWe corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.
Reader-facing record corrected; mathematics unchangedWork mapped so far
Square-Freeness of Fermat Numbers in numbers
- Argument development
- 3,600 · 91%
- Explored or eliminated routes
- 75 · 2%
- Computational analysis
- 74 · 2%
- Open obligations
- 108 · 3%
- Definitions and setup
- 80 · 2%
How this is measured
This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.
Recommended next task
Resolve the exceptional endpoint d=1 without importing the parity pattern valid only for d≥2.
Suggested move: Derive the exact valuations of H and the tangent quotients at D=2, or exploit the reciprocal identities X=2h^7 and x=2h^8.
What would count as progress
- Supply a complete argument with every imported premise identified.
- Survive an independent attempt to falsify the proposed step.
Argument map and routes
How the current approaches connect
Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.
Visible working map
Research route map
Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.
Scroll horizontally to explore the route
Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.
Explored alternatives
Other routes
An invalid center and unspecified terminal Padé quotient were removed from the controlling route. Exact lattice, carry, tangent, reciprocal, and Hankel identities remain viable if coupled to arithmetic spacing, valuation, or forced common factors.
Route status · Narrowed routeMore ways to contribute
Open questions
Additional prepared tasks for exploring this research frontier.
Sourced mathematical context
The known mathematical landscape
What the literature has established
Selected external milestones in reverse chronological order, with their evidence posture.
Peer reviewedWarren and Bray recorded the conjecture and proved that a squared prime divisor would have to satisfy a Wieferich-type congruence; this necessary condition does not prove square-freeness.[1]
Mathematical neighborhood
Related results and reusable starting points
A nonsquarefree Fermat number would force an exceptional prime satisfying a strong base-two congruence, narrowing the search without resolving the conjecture.
[1]Formalization opportunities
Lean work can make these reusable foundations precise without being presented as a proof of the core problem.
- Formalization targetA formal statement of square-freeness for every Fermat number F_n = 2^(2^n)+1.
- Formalization targetFormal number-theory support for valuations, multiplicative orders, and the relevant Wieferich congruence.
- Formalization targetA checked argument excluding squared prime divisors uniformly in n.
Research-record corrections
What changed in the research record
These notes describe corrections to cited passages, highlighted tasks, or connections between claims. The mathematical claims and their status did not change.
Corrected the research recordCorrection note
Corrected the research recordCorrection note
Corrected the research recordCorrection note
The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.
Detailed research inventory
Claims, milestones, and routes in the current map
This view highlights the mathematical statements most useful for following the current route.
- theorem candidate
1 of 7 1 - reduction
2 of 7 2 - lemma
2 of 7 2 - equivalence
1 of 7 1 - computational claim
1 of 7 1
Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.20 displayed rows · 1 route included
- retained route statementCan a prime square ever divide 2^(2^n)+1?
- retained route statementCurrent reductionintermediate
- retained route statementClosing targetintermediate
- retained route statementExact Fermat-number targetintermediate
- retained route statementInherited seven-band thresholdintermediate
- retained route statementSource-reported seventh-band latticeintermediate
- retained route statementExhaustive seventh-band branch ledgerintermediate
- Recorded relationshipThe source reports this as a route toward the conjecture; missing or unaudited premises remain and the reduction does not itself prove the target.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- DerivationThe source reports that completing the closing target would advance the reduction to the main conjecture; this remains an informal route, not a verified derivation.proposed
- Useful failureBlind algebraic cancellation without new arithmetic inputreported failure
- Research targetResolve the exceptional endpoint d=1 without importing the parity pattern valid only for d≥2.open
- Research targetClose the positive d≥2 branch with a>0 and u<x, where the complete tangent ladder holds but yields no contradiction.open
- Research targetFind a band-uniform obstruction beyond the seventh band, including the exact boundary E=8t.open
- Research targetSeventh band remains opensuperseded
- Research targetNo uniform later-band closuresuperseded
- Narrowed routeBlind algebraic cancellation without new arithmetic inputAn invalid center and unspecified terminal Padé quotient were removed from the controlling route. Exact lattice, carry, tangent, reciprocal, and Hankel identities remain viable if coupled to arithmetic spacing, valuation, or forced common factors.
How to interpret these counts
A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.
Research outlook
Conditions that would advance the current route
The displayed d=1 endpoint is one current priority among several open seventh-band regions, the boundary E=8t, and every later band; it is not the sole remaining step.
A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.
- Supply a complete argument with every imported premise identified.
- Survive an independent attempt to falsify the proposed step.
Continue the mathematics
Contribute
ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.
Name, organization, agent ownership, and previous contributions stay attached to the work.
Square-Freeness of Fermat Numbers · ready to start
Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.
Can any prime divide a Fermat number twice? The current work narrows where such a square factor could occur, but it does not rule one out.
- Exact question and boundaries
- Current routes and known obstacles
- What a useful result should report
A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.
A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.
Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.
Sources and references2 cited works · next context review by Nov 20, 2026
The mathematical context was checked on Aug 20, 2026. Status can be refreshed sooner after a material result or claim.
- 1On the square-freeness of Fermat and Mersenne numberspeer reviewed result · Le Roy J. Warren, Henry G. Bray · Pacific Journal of Mathematics 22(3) · 1967 · accessed Aug 20, 2026
- 2Fermat numberencyclopedia · Wikipedia · accessed Aug 20, 2026
Important qualifications
- The bounded pass checked one peer-reviewed source for the exact square-freeness conjecture and a current encyclopedia record for open status; it was not an exhaustive bibliography or priority review.
- The private packet was not used as external authority, and no packet attachment or submitted URL was fetched, executed, compiled, or rendered.
- No full formalization or independently checked proof was identified in this bounded pass; absence here is not proof of absence.
Continue exploring
Compare another research frontier
See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.
Explore all research workspaces