# Squares and primes

A few questions I've been wondering about regarding primes and squares that I thought the Brilliant community might have some insight on ...

(i) Are there an infinite number of perfect squares that are the averages of consecutive primes?

As examples, $4$ is the average of consecutive primes $3$ and $5$, and $9$ is the average of consecutive primes $7$ and $11$. $25$ is not such a perfect square as its "neighboring" primes are $23$ and $29$, which average to $26$.

The list of such perfect squares begins as

$4, 9, 16, 64, 81, 144, 225, 324, 441, 625, 1089, 1681, 2601, ...$.

It becomes less and less likely as the squares get larger that they will be the average of successive primes, but the notion that there is a largest such square seems unlikely. So the problem is to either prove that there is no such largest square, or prove that there must be one and in fact identify it.

(ii) Can every perfect square $n^{2} \gt 1$ be expressed as the average of two (not necessarily consecutive) primes?

While $25$ is not the average of two consecutive primes, it is the average of primes $19$ and $31$. $121$ is not the average of consecutive primes, but it is the average of primes $103$ and $139$.

(iii) How many perfect squares are the averages of two or more distinct pairs of primes?

$9$ is the average of both prime pairs $(7,11)$ and $(5,13)$. $64$ is the average of prime pairs $(61,67), (31,97)$ and $(19,109)$. So if we define $P(n)$ as the number of distinct prime pairs $(p,q)$ for which $n^{2} = \dfrac{1}{2}(p + q)$ then, for example, $P(3) = 2$ and $P(8) = 3$. With this definition, question (ii) becomes a matter of whether or not $P(n) \ge 1$ for all $n \gt 1$, and question (iii) becomes a matter of how many integers $n \gt 1$ there are such that $P(n) \ge 2$. Also, is there a maximum value for $P(n)$ over all integers $n$?

I'm not sure if these are open questions or have in fact been solved centuries ago, so I thought I might learn a few things by sharing them with the community. Enjoy! Note by Brian Charlesworth
4 years, 8 months ago

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

• Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
• Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
• Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$ ... $$ or $ ... $ to ensure proper formatting.
2 \times 3 $2 \times 3$
2^{34} $2^{34}$
a_{i-1} $a_{i-1}$
\frac{2}{3} $\frac{2}{3}$
\sqrt{2} $\sqrt{2}$
\sum_{i=1}^3 $\sum_{i=1}^3$
\sin \theta $\sin \theta$
\boxed{123} $\boxed{123}$

Sort by:

Identifying the largest square seems impossible , but I think we can prove that there are infinite squares ...

- 4 years, 8 months ago

Very interesting. In the second problem, can we extend the problem to whether every(or an infinite sequence of numbers and if there is not an infinite sequence, then how many numbers can be expressed in that form) number can be expressed as an average of two primes?

- 4 years, 8 months ago

Yes, that extension is in essence the Goldbach conjecture, which is still an open question. As stated in the link, the conjecture is that every even integer $2n, n \ge 2,$ can be expressed as the sum of two primes $p,q$, i.e. that $2n = p + q \Longrightarrow n = \dfrac{p + q}{2}$. This last equation mirrors your extension, i.e., that every integer $n \ge 2$ can be expressed as the average of two (not necessarily distinct) primes. I believe that we can drop the "not necessarily distinct" qualifier if we restrict ourselves to $n \ge 4$. My function $P(n)$ is a measure of the number of Goldbach partitions. (Before I posted this note I had never paid any attention to the Goldbach conjecture, but now that I've made the connection I'm becoming aware of just how much research has been done on this problem and its many variations.)

Goldbach's weak conjecture has a still-to-be-verified proof via Harald Helfgott, (2013). So I guess we could could refer to my questions as a set of "Goldbach's perfect square conjectures". These are weaker than the original conjecture but stronger, (I think?), than the weak conjecture.

- 4 years, 8 months ago