For any given integers k ≥ 1 , b ≥ 2 , c ≠ 0 {\displaystyle k\geq 1,b\geq 2,c\neq 0} {\displaystyle k\geq 1,b\geq 2,c\neq 0}, with
Source placement record
For any given integers k ≥ 1 , b ≥ 2 , c ≠ 0 {\displaystyle k\geq 1,b\geq 2,c\neq 0} {\displaystyle k\geq 1,b\geq 2,c\neq 0}, with gcd(k, c) = 1 and gcd(b, c) = 1, are there infinitely many primes of the form ( k × b n + c ) / gcd ( k + c , b − 1 ) {\displaystyle (k\times b^{n}+c)/\gcd(k+c,b-1)} {\displaystyle (k\times b^{n}+c)/\gcd(k+c,b-1)} with integer n ≥ 1?
Review boundary: This page preserves a row from the revision-pinned source index. It is not a reviewed canonical dossier and does not independently verify or strengthen the cited claim.
Source status
Open
Field
Number theory · Prime numbers
Record type
Revision-pinned source placement
Verification
Source-index reviewed
Source grade
secondary
Reviewed
2026-07-27T18:04:33.834Z
Context and review boundary
The source list does not provide a uniform standalone exposition for every row. Use the exact subsection and linked topic article as the starting point for a reviewed reading trail.
Formal boundary
No independent formal statement has been added to this source-index record. This prevents the catalog from inventing notation or silently strengthening the cited claim.
Known approaches and partial results
Pending review. No structured approach or partial-result note has been added to this source placement.
Source trail
Wikipedia list subsection — Exact Number theory › Prime numbers subsection in the revision-pinned source.