For any given integers k\geq 1, b\geq 2, c\neq 0, with 1=gcd(k, c) = 1 and 1=gcd(b, c) = 1, are there infinitely many primes of the form…

For any given integers k\geq 1, b\geq 2, c\neq 0, with 1=gcd(k, c) = 1 and 1=gcd(b, c) = 1, are there infinitely many primes of the form (k\times b^n+c)/\gcd(k+c,b-1) with integer n ≥ 1?

Open the “Prime numbers” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)