How many ordered pairs of positive integers ( x , y ) satisfy the equation x 2 − y ! = 2 0 1 9
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If x 2 + y ! = 2 0 1 9 , then 2 0 1 9 + y ! = x 2
You have a typo in your first line.I believe you mean x 2 − y ! = 2 0 1 9 and not x 2 + y ! = 2 0 1 9
Problem Loading...
Note Loading...
Set Loading...
Claim: Only one pair of positive integers ( x , y ) satisfy the given equation, i.e ( x , y ) = ( 4 5 , 3 )
Proof: Note that 4 divides y ! for all y ≥ 4 . So for all y ≥ 4 , x 2 − y ! ≡ x 2 ≡ 2 0 1 9 ≡ 3 ( m o d 4 ) But 3 is not a quadratic residue modulo 4 . (Squares leave the remainder 0 or 1 when divided by 4 .) Hence the only cases left to check are y = 1 , 2 , 3 .
The only case that gives a solution is y = 3 ⟹ x = 4 5 .
Relevant wiki: Modular Arithmetic and Quadratic Residues