Whilst getting out of bed, I was thinking of this:
(px)2+(px+n)2=(py)2 - where all variables are prime - (py) is another prime.
The equation cannot be simplified algebraically.
We'll have to prove this numerically (i.e. manually).
Let's do the primes ≤20:
22+32=13
22+52=29
32+52=34
22+72=53
32+72=56
52+72=74
22+92=85
32+92=90
52+92=106
72+92=130
22+112=125
32+112=130
52+112=146
72+112=170
22+132=173
32+132=178
52+132=194
72+132=218
112+132=290
22+172=293
32+172=298
52+172=314
72+172=338
112+172=410
132+172=458
22+192=365
32+192=370
52+192=386
72+192=410
112+192=482
132+192=530
172+192=650
Now looking at the square numbers (up to limit of what we've done):
1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,484,529,576,625
Now reducing it to prime square numbers (i.e. when primes are squared, it produces a square number):
4,9,25,49,81,121,169,289,361,529
The closest squarime is 132+192=530 which is 1 away from the nearest square number, that is 529.
I don't know if there is any squarimes defined like this.
I'd request anybody to find a general function that proves whether there is or not any squarimes according to my definitions and restrictions.
#NumberTheory
Easy Math Editor
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:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
@Zakir Husain, @Alak Bhattacharya, @Mahdi Raza, @Adhiraj Dutta, @Gandoff Tan
@Yajat Shamji- There never exists a2+b2=c2 such that all of them are odd. ∵ any set of integers satisfying the equation (a2+b2=c2) can be represented in the form a=2mn;b=m2−n2;c=m2+n2;m∈Z;n∈Z as you can see a is even ∴ all of them can't be prime.
Also if you see if a,b are odd then c must be even ∴ all of them can never be prime
Log in to reply
Thank you so much! @Zakir Husain
What @Zakir Husain said can be backed by brute force as well
Log in to reply
Thank you so much! @Mahdi Raza
@Yajat Shamji- See a more elaborated proof here
Log in to reply
Thank you so much! @Zakir Husain
dead end