Topsy-turvy

Algebra Level 4

Let's begin with an equation: x + y = n x+y=n ( n n is a positive integer)

That's too boring, so let's add some numbers, let's make 5, 4, 4 and 2 as the main protagonist: 5 x + 4 y = n 4 2 ( 1 ) 5x+4y=n^{4-2}\qquad(1) Unfortunately, someone came and messed up the numbers, making a new equation: x 4 + 5 y = n 4 2 ( 2 ) x^4+5y=n^4-2\qquad(2) If there are p p ordered pairs of non-negative integer solutions ( x , y ) (x,y) that satisfy ( 1 ) (1) , and there are q q ordered pairs of non-negative integer solutions ( x , y ) (x,y) that satisfy ( 2 ) (2) , where p q = 9 \vert p-q\vert=9 , what is the value of n n ?


This is one part of 1+1 is not = to 3 .


The answer is 13.

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.

1 solution

Kenneth Tan
Oct 3, 2014

Let's first look at ( 2 ) (2) , there is no such non-negative integer solutions ( x , y ) (x, y) that satisfy ( 2 ) (2) .

Let me tell you why...

Assume they do exist, then if we divide both sides by an integer, the remainder on both sides must be the same.

Now let's try dividing both sides by 5, the remainder of an integer when divided by 5 can only be 0 0 , 1 1 , 2 2 , 3 3 or 4 4 . j 0 , 1 , 2 , 3 , 4 ( m o d 5 ) j\equiv 0,\,1,\,2,\,3,\,4 \pmod5 j 2 0 , 1 , 4 , 9 , 16 0 , 1 , 4 ( m o d 5 ) \begin{aligned} \therefore j^2&\equiv 0,\,1,\,4,\,9,\,16 \\ &\equiv 0,\,1,\,4\pmod 5\end{aligned} j 4 0 , 1 , 16 0 , 1 ( m o d 5 ) \begin{aligned} \therefore j^4&\equiv 0,\,1,\,16 \\ &\equiv 0,\,1\pmod5 \end{aligned} Thus, L.H.S. = x 4 + 5 y 0 , 1 ( m o d 5 ) \begin{aligned} \text {L.H.S.}&=x^4+5y\\&\equiv 0,\,1 \pmod 5\end{aligned} R.H.S = n 4 2 2 , 1 3 , 4 ( m o d 5 ) \begin{aligned} \text {R.H.S}&=n^4-2\\&\equiv -2,\,-1\\&\equiv3,\,4 \pmod 5\end{aligned} We see that the remainder of the L.H.S. and R.H.S will never be the same, which is a contradiction. So, there are no non-negative integer solutions that satisfy ( 2 ) (2) .

Therefore q = 0 q=0 , p = 9 p=9 .

Now let's observe ( 1 ) (1) , simplify it to become 5 x + 4 y = n 2 ( 3 ) 5x+4y=n^2\qquad(3) We see that this is a linear Diophantine equation with 2 variables. Divide both sides by the smallest coefficient in L.H.S. which is 4. Then move all fractions to the right and all integers to the left, we get x + y = n 2 x 4 x+y=\frac{n^2-x}{4} Since x + y x+y is an integer, n 2 x 4 \frac{n^2-x}{4} must also be an integer. Let n 2 x 4 = k \frac {n^2-x}{4}=k , then, x = n 2 4 k x=n^2-4k Substitute x = n 2 4 k x=n^2-4k into ( 3 ) (3) , then we would get y = 5 k n 2 y=5k-n^2 Since x x and y y are non-negative, x 0 x\geqslant0 , y 0 y\geqslant 0 , we have 4 k n 2 5 k 4k\leqslant n^2\leqslant 5k n 2 5 k n 2 4 ( 4 ) \therefore\frac {n^2}{5}\leqslant k \leqslant \frac {n^2}{4}\qquad(4)

The number of integer solutions k k that satisfy ( 4 ) (4) is n 2 4 n 2 5 + 1 \left\lfloor\frac{n^2}{4}\right\rfloor-\left\lceil\frac {n^2}{5}\right \rceil+1 . Since the number of non-negative integer solutions that satisfy ( 3 ) (3) is equal to the number of integer solutions k k that satisfy ( 4 ) (4) , p = n 2 4 n 2 5 + 1 = 9 p=\left\lfloor\frac{n^2}{4}\right\rfloor-\left\lceil\frac {n^2}{5}\right \rceil+1=9 n 2 4 n 2 5 = 8 \therefore\left \lfloor \frac {n^2}{4} \right \rfloor-\left \lceil \frac {n^2}{5}\right \rceil=8 Because n n is a positive integer, we can solve this via trial and error by plugging in various values of n n , and it is not hard to show that n = 13 n=13 is the only solution.

Thus, the value of n n is 13 13 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...