Question: Dirichlet's Theorem on arithmetic progressions is often stated as something like: If (a,m)=1 then there are infinite primes p such that pa(modm) but how to

Dirichlet's Theorem on arithmetic progressions is often stated as something like:

If (a,m)=1 then there are infinite primes p such that pa(modm)

but how to come up an proof of its weak version, If (a,m)=1(a,m)=1 then there is at least one prime pp such that pa(modm)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!