ago
0 like 0 dislike
0 like 0 dislike
it states that an+d is prime infinitely often for n, given gcd(a,b)=1. So is kp+1 prime infinitely often, given p is a prime and k a fixed integer?

certainly, k cannot be odd as for odd primes, kp+1 is div by 2. so do all even k work? tia
ago
0 like 0 dislike
0 like 0 dislike
If you fix k and let p run through the primes, Dirichlet's theorem says nothing about your situation, since you don't have an arithmetic progression.
ago
by

No related questions found

33.4k questions

135k answers

0 comments

33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!