ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa be a positive integer that is not a perfect power, meaning a≠cka\ne c^k for every positive integer cc and every k>1k>1. Let mm be the smallest positive integer such that (a+1)/m(a+1)/m is a sum of two squares. Conjecture on odd exponents.

  • If m=1m=1, then there are infinitely many odd positive integers nn such that an+1a^n+1 is a sum of two squares.
  • If a≡3(mod4)a\equiv 3\pmod{4}, am+1a^m+1 is a sum of two squares, and mm is prime, then there are infinitely many odd positive integers nn such that an+1a^n+1 is a sum of two squares. In fact, there should be infinitely many primes p≡1(mod4)p\equiv 1\pmod{4} such that amp+1a^{mp}+1 is a sum of two squares.
  • If a≡3(mod4)a\equiv 3\pmod{4} and mm is composite, then there are only finitely many odd positive integers nn such that an+1a^n+1 is a sum of two squares.

The conjecture describes the expected split between infinite and finite families of odd exponents according to the arithmetic of mm; the paper provides supporting results in special cases, while the general assertions remain open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.