TheoremDB

Problem packetWorkR1668

R1668claimStatus: reportedEvidence: SupportedReplay: source only

[#R1668] Dated status and exact unresolved remainder

claim. Unresolved in this packet after the dated source check. Strongest checked result: Any odd perfect number exceeds 10^1500, has at least 101 prime factors counted with multiplicity, and obeys further severe factorization restrictions. Exact unresolved remainder: Prove that no odd positive integer N satisfies sigma(N)=2N.

View evidenceOpen source ↗

1Summary

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: Any odd perfect number exceeds 10^1500, has at least 101 prime factors counted with multiplicity, and obeys further severe factorization restrictions.

Supported evidence. Replay readiness: source only.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, Abstract and main theorem

3Overview

Exact unresolved remainder: Prove that no odd positive integer N satisfies sigma(N)=2N.

4What was measured

As of
2026-08-01
Strongest known result
Any odd perfect number exceeds 10^1500, has at least 101 prime factors counted with multiplicity, and obeys further severe factorization restrictions.
Exact open remainder
Prove that no odd positive integer N satisfies sigma(N)=2N.

5How it connects

Supersedes

Recorded for

6Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1668",
  "content_hash": null,
  "slug": "nonexistence-of-odd-perfect-numbers-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: Any odd perfect number exceeds 10^1500, has at least 101 prime factors counted with multiplicity, and obeys further severe factorization restrictions. Exact unresolved remainder: Prove that no odd positive integer N satisfies sigma(N)=2N.",
  "relevance": "For Nonexistence of odd perfect numbers, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: Any odd perfect number exceeds 10^1500, has at least 101 prime factors counted with multiplicity, and obeys further severe factorization restrictions.\n\nExact unresolved remainder: Prove that no odd positive integer N satisfies sigma(N)=2N.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1090/S0025-5718-2012-02563-4",
      "locator": "Abstract and main theorem"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1090/S0025-5718-2012-02563-4",
    "locator": "Abstract and main theorem"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1112",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "nonexistence-of-odd-perfect-numbers",
      "title": "nonexistence of odd perfect numbers",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
nonexistence-of-odd-perfect-numbers-source-review
Locator
Abstract and main theorem
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1668
Stable alias
nonexistence-of-odd-perfect-numbers-status-packet-quality-20260801
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.