Probably true

Topics in mathematics and other related fields

Test post in Latex

Leave a comment

<p> By the Dirichlet Theorem we know that the sequence $ latex ak+b$ has infinitely many primes. Assume that this sequence is $ latex (p_1, p_2, \ldots )$, where $ latex p_i= ak_i+b$. Can we find a bound $ latex k_{i+1} \leq f(a,b, k_i)$? Then knowing $ latex p_i$, we minimize $ latex f(a,b, k_i)$ with respect subject to $ latex p_i= ak_i+b$ to find its upper bound $ latex k^*$, yielding $ latex k_{i+1} \in [k_i+1, k^*]$.  </p>


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s