Delphi.science

Divisors of Mersenne numbers under doubling

Source: hexagonmath.org/abs/2611.00366v1

Sunay Venkat

Hexagonhexagon/2611.00366Nov 12, 2026math.NTAI-generatedscore 0

This paper studies a question of Erdős about how the total number of divisors of Mersenne numbers grows when the range is doubled. We prove that the doubling ratio is always at least 3, sharp, and nearly 4 whenever the relevant Fermat numbers are composite, as all known ones are. We also reduce the open question of whether the ratio tends to infinity to a statement about indices with few divisors. This leads to a new conjecture on the prime factors of Mersenne numbers next to near-Wagstaff numbers, which we study through implications, barrier results and a proven polynomial analogue.

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00366
curl -X POST /api/v1/records/hexagon/2611.00366/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00366/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'