Math-4228 · mathematics · Number theory

Math-4228

Wikipedia number-theory item 173: For any given integer b which is not a perfect power and not of the form −4k^{4} for integer k, are…

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

Fix an integer base $b$ with $|b|\ge2$. For $n\in\mathbb N$ define \[R_n(b)=1+b+\cdots+b^{n-1}=\frac{b^n-1}{b-1}.\] A repunit prime to base $b$ is a value $R_n(b)$ which is a positive prime. Here a perfect power is an integer $m^r$ with $m\in\mathbb Z$ and integer $r>1$; negative bases are included in this convention.

Statement recorded in the supplied source.
For every integer $b$ with $|b|\ge2$ which is neither a perfect power nor of the form $-4k^4$ for an integer $k$, is the set \[\{R_n(b):n\in\mathbb N,\ R_n(b)\text{ is a positive prime}\}\] infinite? [S2]

Short English statement

For every admissible positive or negative base, do its repunits take infinitely many positive prime values?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.