Somewhat enjoyable

Find the sum of first 5 positive integers n n such that

( n 2 1 5 1 ) ( n 4 + 3 n 2 4 25 + 1 ) \large \left(\dfrac{n^2-1}{5}-1\right)\left(\dfrac{n^4+3n^2-4}{25}+1\right)

is divisible by 9


The answer is 96.

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

We can split this question into 3 cases:

Case 1: n 2 1 5 1 0 mod 9 \dfrac{n^2-1}{5}-1\equiv0\space\text{mod 9}

Case 2: n 4 + 3 n 2 4 25 + 1 0 mod 9 \dfrac{n^4+3n^2-4}{25}+1\equiv0\space\text{mod 9}

Case 3: n 2 1 5 1 n 4 + 3 n 2 4 25 + 1 0 mod 3 \dfrac{n^2-1}{5}-1\equiv\dfrac{n^4+3n^2-4}{25}+1\equiv0\space\text{mod 3}

Now, we shall consider each of these cases. For case 1:

n 2 1 5 1 0 mod 9 \dfrac{n^2-1}{5}-1\equiv0\space\text{mod 9} n 2 1 5 1 mod 9 \dfrac{n^2-1}{5}\equiv1\space\text{mod 9} n 2 1 5 mod 9 n^2-1\equiv5\space\text{mod 9} n 2 6 mod 9 n^2\equiv6\space\text{mod 9} This implies that n n is divisible by 3 but n 2 n^2 is not divisible by 9, a contradiction. Hence, there are no solutions for this case.

Now, we shall consider case 2. n 4 + 3 n 2 4 25 + 1 0 mod 9 \dfrac{n^4+3n^2-4}{25}+1\equiv0\space\text{mod 9} n 4 + 3 n 2 6 mod 9 n^4+3n^2\equiv6\space\text{mod 9} n 2 ( n 2 + 3 ) 6 mod 9 n^2(n^2+3)\equiv6\space\text{mod 9} This implies that the product of n 2 n^2 and n 2 + 3 n^2+3 is divisible by 3, so at least one of them is divisible by 3. However, since both have the same remainder modulo 9, so both of them are divisible by 3. This means that product is divisible by 9, a contradiction. Hence, there are no solutions for this case.

Finally, we shall consider case 3. n 2 1 5 1 0 mod 3 \dfrac{n^2-1}{5}-1\equiv0\space\text{mod 3} n 2 0 mod 3 n 2 0 mod 9 n^2\equiv0\space\text{mod 3}\Rightarrow n^2\equiv0\space\text{mod 9} Also, note that n 2 1 mod 5 n^2\equiv1\space\text{mod 5} in order for it to be an integer. Furthermore, we have n 4 + 3 n 2 4 25 + 1 0 mod 3 \dfrac{n^4+3n^2-4}{25}+1\equiv0\space\text{mod 3} n 4 + 3 n 2 4 2 mod 3 n^4+3n^2-4\equiv2\space\text{mod 3} n 0 mod 3 \therefore n\equiv0\space\text{mod 3} Also, note that n 4 + 3 n 2 4 0 mod 25 n^4+3n^2-4\equiv0\space\text{mod 25} in order for it to be an integer. ( n 2 1 ) ( n 2 + 4 ) 0 mod 25 (n^2-1)(n^2+4)\equiv\text{0 mod 25} Note that the two terms above have the same remainder modulo 5, so solving, we also get n 2 1 mod 5 n^2\equiv\text{1 mod 5} .

Hence, after considering all three cases, we get the following conditions for n n : n 2 1 mod 5 n^2\equiv1\space\text{mod 5} n 2 0 mod 9 n^2\equiv0\space\text{mod 9} Solving, we get n 2 = 9 ( 5 t + 4 ) n^2=9(5t+4) for some integer t t . Note that in order to satisfy the perfect square condition, 5 t + 4 5t+4 is a perfect square. Hence, trying out numerous values of t t , we get the desired values, 6, 9, 21, 24, 36. \huge\text{6, 9, 21, 24, 36.}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...