Difference between revisions of "2007 JBMO Problems/Problem 4"
(→Problem 4) |
(→Problem 4) |
||
| Line 1: | Line 1: | ||
==Problem 4== | ==Problem 4== | ||
Prove that if <math>p</math> is a prime number, then <math>7p+3^{p}-4</math> is not a perfect square. | Prove that if <math>p</math> is a prime number, then <math>7p+3^{p}-4</math> is not a perfect square. | ||
| − | <math>\int</math> | + | <math>\int e^sin(x) \, dx</math> |
==Solution== | ==Solution== | ||
Revision as of 14:32, 16 April 2024
Problem 4
Prove that if 
is a prime number, then 
is not a perfect square.
Solution
By Fermat's Little Theorem, 
. By quadratic residues, this is true if and only if 
, except for 
(which doesn't work). Then, 
, but this implies 
is odd, so cannot be a perfect square.
See also
| 2007 JBMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Last Problem | |
| 1 • 2 • 3 • 4 | ||
| All JBMO Problems and Solutions | ||
