MHB Is There a Larger Interval Where \(k^2 + k + n\) Generates Only Primes?

  • Thread starter Thread starter mathbalarka
  • Start date Start date
  • Tags Tags
    Polynomials
AI Thread Summary
The discussion centers on the expression \(k^2 + k + n\) and its ability to generate prime numbers for positive integers \(k\) within the interval \((0, (n/3)^{1/2})\). Participants explore the possibility of identifying a larger interval where this expression consistently yields primes. The Heegner-Stark theorem is mentioned as a basis for understanding this phenomenon, but there is a challenge to demonstrate the result without relying on this theorem or the concept of class-1 numbers. A solution to the problem is provided by one participant, prompting further exploration of the topic. The conversation highlights the mathematical intricacies involved in prime generation through polynomial expressions.
mathbalarka
Messages
452
Reaction score
0
Given that $k^2 + k + n$ is always prime for all positive integer $k$ in the interval $\left (0, (n/3)^{1/2} \right )$. Find the largest interval for which the same can be stated.

This easily follows from Heegner-Stark theorem, but can you show the same bypassing it, without going through the finititude of class-1 numbers?
 
Mathematics news on Phys.org
One can find my solution below :

Let $m$ be the least integer for which $f(m)$ is composite, where $f(x) = x^2 + x + n$.

As the hypothesis go, $m > \sqrt{n/3}$, hence $n < 3m^2$.

Let $p$ be the smallest prime dividing $f(m)$. We get then that $p \leq \sqrt{f(m)}$.

$$p^2 \leq f(m) < m^2 + m + 3m^2 < (2m + 1)^2$$

Hence, $p \leq 2m$.

Now, consider the product $\prod_{k = 0}^{m-1} \left [ f(m) - f(k) \right ]$. If we factor out $f(m) - f(k)$ as $(m - k)(m + k + 1)$, this gives :

$$\prod_{k = 0}^{m-1} \left [ f(m) - f(k) \right ] = \prod_{k = 0}^{m-1} \left [ (m - k)(m + k + 1) \right ] = (2m)!$$

As $p \leq 2m$, $p$ divides $(2m)!$, hence $p$ divides in turn on of the factors $(m - \mathcal{l})(m + \mathcal{l} + 1)$, implying $p \leq m + \mathcal{l} + 1$ for some $\mathcal{l} \leq m - 1$.

Also, as a consequence, $p$ divides $f(m) - f(\mathcal{l})$, and since $p$ also divides $f(m)$, p must divide $f(\mathcal{l})$. By the definition of $m$, $f(\mathcal{l})$ is prime, hence $ p = f(\mathcal{l}) $. This can equivalently be stated as $p - \mathcal{l} = \mathcal{l}^2 + n$.

Combined together with the inequality before, we have :

$$m + 1 \geq p - \mathcal{l} = \mathcal{l}^2 + n \geq n$$

Hence, the largest possible interval for which $f(x)$ is prime in general, is $ ( 0, n - 1) $. $\blacksquare$
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top