Exponential Diophantine equations · Fermat numbers · square factors · 2-adic valuations

Square-Freeness of Fermat Numbers

Collaboration beta

Can any prime divide a Fermat number twice? The packet narrows where such a square factor could occur, but it does not rule one out.

p2Fn=22n+1for every primepandn0
Known results and sources
A glowing Fermat number stands above a factorization grid where a repeated prime factor remains an open question.
The conjecture asks whether any prime can occur twice in a Fermat number; the source narrows possible square factors but does not exclude them.

Research problem

Exact mathematical statement

For every integer n0n\ge 0, let

Fn=22n+1.F_n=2^{2^n}+1.

The conjecture asks whether FnF_n is square-free for every nn, equivalently whether no prime pp satisfies p2Fnp^2\mid F_n.

Problem infographic

Problem at a glance

A four-panel explainer defines Fermat numbers, shows the hypothetical square factor coordinates, locates the open seventh exponent band, and separates excluded shortcuts from viable arithmetic work.
The source-reported endpoint excludes E≤7t for a hypothetical square factor, but the seventh band and every later band remain open.

Current mathematical picture

Where work on Square-Freeness of Fermat Numbers stands

Open problem

Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.

Useful failureBlind algebraic cancellation without new arithmetic input

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 route
Main reductionCurrent reduction

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 incomplete
Priority open bridgeResolve the exceptional endpoint d=1 without importing the parity pattern valid only for d≥2.Task status · Ready to work on
Research-record correctionResearch-record correction

We 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 unchanged

Work mapped so far

Square-Freeness of Fermat Numbers in numbers

3.9kretained lines of mathematical investigation3,937 in the current working snapshot
Argument development
3,600 · 91%
Explored or eliminated routes
75 · 2%
Computational analysis
74 · 2%
Open obligations
108 · 3%
Definitions and setup
80 · 2%
7selected mapped statements1routes investigated3open questions3contribution-ready tasks
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.

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

11 selected steps

Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.

11 selected steps

Scroll horizontally to explore the route

Working route overview for Square-Freeness of Fermat NumbersA selected map of recorded claims, active routes, useful failures, open questions, and their explicit relationships. Search, filter, zoom, or pan within this page.Can a prime square ever divide 2^(2^n)+1? — Depends on missing premiseCan a prime square everdivide 2^(2^n)+1?Current reduction — Depends on missing premiseCurrent reductionExact Fermat-number target — Depends on missing premiseExact Fermat-number targetExhaustive seventh-band branch ledger — Depends on missing premiseExhaustive seventh-bandbranch ledgerClosing target — Depends on missing premiseClosing targetInherited seven-band threshold — Depends on missing premiseInherited seven-bandthresholdSource-reported seventh-band lattice — Depends on missing premiseSource-reported seventh-bandlatticeBlind algebraic cancellation without new arithmetic input — stoppedBlind algebraic cancellationwithout new arithmetic inputResolve the exceptional endpoint d=1 without importing the parity pattern valid only for d≥2. — OpenResolve the exceptionalendpoint d=1 withoutimporting…Close the positive d≥2 branch with a>0 and u<x, where the complete tangent ladder holds but yields no contradiction. — OpenClose the positive d≥2branch with a>0 and u<x,where…Find a band-uniform obstruction beyond the seventh band, including the exact boundary E=8t. — OpenFind a band-uniformobstruction beyond theseventh…
Working claimActive routeOpen, active, or blocked questionUseful failure

Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.

Explored alternatives

Other routes

1 recorded
Narrowed routeBlind algebraic cancellation without new arithmetic input

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 route

More ways to contribute

Open questions

Additional prepared tasks for exploring this research frontier.

3 featured tasks
01
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.
Ready to work on
02
Close the positive d≥2 branch with a>0 and u<x, where the complete tangent ladder holds but yields no contradiction.Suggested move: Relate the terminal equality L6=(GH)7\mathscr L_6=(GH)^7 to a principal Hankel minor and extract a discrete arithmetic obstruction rather than another free cancellation.
Ready to work on
03
Find a band-uniform obstruction beyond the seventh band, including the exact boundary E=8t.Suggested move: Turn the dual Hankel theorem into determinant spacing, a finite periodic terminal obstruction, or a genuine descent to a smaller audited band.
Ready to work on

Sourced mathematical context

The known mathematical landscape

Context collected Aug 20, 2026
Current statusOpen problem

Whether every Fermat number is square-free remains open. The classical Wieferich-type necessary condition and all packet-local reductions are constraints on a counterexample, not a proof that none exists.

[1][2]
External progress

What the literature has established

Selected external milestones in reverse chronological order, with their evidence posture.

  1. 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]
2 cited sources1 related results or reductionsReferences

Mathematical neighborhood

Related results and reusable starting points

Current focusFermat Numbers Are Square-Free
Dependency or reductionWieferich-type prime-divisor obstruction

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.

Research-record correctionWe corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Cited passages corrected

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.

4 standing statements3 proposed statements3 open questions1 narrowed routes
Statements by mathematical role7 selected mapped statements
  • theorem candidate1 of 71
  • reduction2 of 72
  • lemma2 of 72
  • equivalence1 of 71
  • computational claim1 of 71
Selected mathematical clusters1 mathematical clusters
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

Priority open bridgeResolve the exceptional endpoint d=1 without importing the parity pattern valid only for d≥2.

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.

Evidence needed nextConcrete conditions for progress

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.

Read-only beta · actions unavailable
Prepared starting pointResolve the exceptional endpoint d=1 without importing the parity pattern valid only for d≥2.

Square-Freeness of Fermat Numbers · ready to start

Mathematical updatesFollow this problem

Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.

Research contextPrepared context for any AI agent

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
Return mathematical workReturn what you or your agent found

A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.

Proof attempt or partial resultSupporting notes or data
Hosted agentRun this task with a hosted agent

A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.

Your own AI agentConnect an outside research agent

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.

  1. 1
    On 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
  2. 2
    Fermat 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

Expanded visual

Open original image