Primes of the Form Mod(p,q) = Mod(x,q)

a1call · 2018-12-10, 06:27

Hi all,
Is there a proof that primes p such that
Mod (p,q) = Mod (x,q)
For any given prime q and integer x such that
0 < x < q
Are Infinity many?
For example for q = 5 and x = 3
Is it provable that the set of primes p:
13, 23, 43, ...
Is infinity large.
Thank you for any reference you may provide.

Nick · 2018-12-10, 09:19

This may help:
https://primes.utm.edu/notes/Dirichlet.html

I think it is also worth experimenting with specific numbers to get a feel for this type of problem (and not just with q prime).
For example:

Prove that there are infinitely many prime numbers.
Prove that there are infinitely many primes which are 3 mod 4.
Prove that there are infinitely many primes that are 1 mod 4.

a1call · 2018-12-10, 12:51

Much obliged Nick,

For the record the Wikipedia entry:
https://en.m.wikipedia.org/wiki/Diri...c_progressions

Batalov · 2018-12-10, 15:37

https://primes.utm.edu/top20/page.php?id=14 , too

science_man_88 · 2018-12-11, 02:31

http://mathworld.wolfram.com/Modular...gFunction.html is indirectly related.

LaurV · 2018-12-11, 02:51

Quote:

Originally Posted by Nick

3. Prove that there are infinitely many primes that are 1 mod 4.

4. Prove that there are infinitely many primes that are 6 mod 7.

Oh... wait... that was the other guy...

a1call · 2018-12-11, 03:34

To much meat on those links.
Thank you Gents both.
Currently I am exhausted from my day job. Digestion will have to wait for another day if at all possible. The straight forward proof seems way too advanced. But Google seems to indicate there has been searches for an "elementary" proof. Will see if that's easier on the mind.

Thank you for all the replies.

2018-12-10, 06:27	#1
a1call "Rashid Naimi" Oct 2015 Remote to Here/There 41·59 Posts	Primes of the Form Mod(p,q) = Mod(x,q) Hi all, Is there a proof that primes p such that Mod (p,q) = Mod (x,q) For any given prime q and integer x such that 0 < x < q Are Infinity many? For example for q = 5 and x = 3 Is it provable that the set of primes p: 13, 23, 43, ... Is infinity large. Thank you for any reference you may provide.

2018-12-10, 09:19	#2
Nick Dec 2012 The Netherlands 2·3·307 Posts	This may help: https://primes.utm.edu/notes/Dirichlet.html I think it is also worth experimenting with specific numbers to get a feel for this type of problem (and not just with q prime). For example: Prove that there are infinitely many prime numbers. Prove that there are infinitely many primes which are 3 mod 4. Prove that there are infinitely many primes that are 1 mod 4.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Primes of the form (b±1)*b^n±1 and b^n±(b±1)	sweety439	sweety439	179	2023-08-08 19:54
A question about primes of a particular form	enzocreti	enzocreti	55	2019-04-27 11:10
Primes of the form n+-phi(n)	carpetpool	carpetpool	3	2017-01-26 01:29
Primes of the form a^(2^n)+b^(2^n)	YuL	Math	21	2012-10-23 11:06
Primes of the form 2.3^n+1	Dougy	Math	8	2009-09-03 02:44

2018-12-10, 12:51	#3
a1call "Rashid Naimi" Oct 2015 Remote to Here/There 973₁₆ Posts	Much obliged Nick, For the record the Wikipedia entry: https://en.m.wikipedia.org/wiki/Diri...c_progressions

2018-12-10, 15:37	#4
Batalov "Serge" Mar 2008 San Diego, Calif. 2×3×1,733 Posts	https://primes.utm.edu/top20/page.php?id=14 , too

2018-12-11, 02:31	#5
science_man_88 "Forget I exist" Jul 2009 Dartmouth NS 5×13×131 Posts	http://mathworld.wolfram.com/Modular...gFunction.html is indirectly related.

2018-12-11, 03:34	#7
a1call "Rashid Naimi" Oct 2015 Remote to Here/There 973₁₆ Posts	To much meat on those links. Thank you Gents both. Currently I am exhausted from my day job. Digestion will have to wait for another day if at all possible. The straight forward proof seems way too advanced. But Google seems to indicate there has been searches for an "elementary" proof. Will see if that's easier on the mind. Thank you for all the replies.