2000 character limit reached
On a Special Case of Dirichlet's Theorem
Published 27 Sep 2023 in math.GM | (2311.11946v1)
Abstract: Let $p$ be a prime number, and $h$ a positive integer such that $\gcd(p,h)=1$. We prove, without invoking Dirichlet's theorem, that the arithmetic progression $p\left(\mathbf{N}\cup {0}\right)+h$ contains infinitely many prime numbers. This is a special case of Dirichlet's theorem not considered by other authors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.