Find the sum of all possible n given that
n ∣ m 2 + 4
and
m ∣ n 2 + 4
where n and m are primes less than 2 0 1 4 .
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.
This is a completely uneducated guess.
Primes ≥ 5 are of the form 6 x ± 1 . Thus, for smaller primes, the difference between two is either 2 or 4 .
Now, if difference is 2 , then n ∣ n 2 + 4 n + 8 ⇒ n ∣ 8 . The only prime which satisfies this is 2 . The corresponding m when n = 2 , is when m ∣ 8 ⇒ m = 2 .
Now, if the difference is 4 , then n ∣ n 2 + 8 n + 2 0 ⇒ n ∣ 2 0 . Since n can be 2 , n can also be 5 . The corresponding m , when n = 5 , is when m ∣ 2 9 ⇒ m = 2 9 .
Thus, the possible values of n = 2 , 5 , 2 9 , whose sum is 3 6 .
Could someone else post a real solution, and explain to me how I got the answer by fluke?
Well... You got the right values, but your solution is a little guess-y check-y. Look at what this problem has been tagged with and that will help you.
Log in to reply
Which tag? This new system in Brilliant is a bit confusing.
Log in to reply
https://brilliant.org/discussions/thread/vieta-root-jumping-2/ I hope this helps
Problem Loading...
Note Loading...
Set Loading...
WLOG let m be greater than or equal to n . When m ≤ 5 we can check the solutions to be ( 2 , 2 ) , ( 5 , 2 9 ) .
Suppose m = n > 5 . Then we have m divides 4, contradiction.
Hence we can assume m > n > 5 . Let ( m , n ) be the solution such that m + n is minimised (we suppose for sake of contradiction that such a solution exists). Then consider the solution ( n , m n 2 + 4 ) . Note that m n 2 + 4 is an integer and divides n 2 + 4 . Also, ( m n 2 + 4 ) 2 + 4 = m 2 ( n 2 + 4 ) 2 + 4 m 2 . Since m and n are distinct primes, to show that this is a valid solution we just need to show that n divides ( n 2 + 4 ) 2 + 4 m 2 = n 4 + 8 n 2 + 4 ( m 2 + 4 ) . But this is clearly true by the fact that n ∣ m 2 + 4 . Hence the solution ( n , m n 2 + 4 ) is valid.
Also,, n 2 + 4 < n 2 + n = n ( n + 1 ) which does not exceed m n which implies that m n 2 + 4 < n < m . If m n 2 + 4 was greater than 5, then the minimality condition has been contradicted. Otherwise, it is equal to 2 or 5. (Refer to the two solutions above). If it was 2, then n is even, contradiction. If it was 5, then n ∣ 5 m − 4 , m 2 + 4 hence n ∣ 5 m 2 + 2 0 , 5 m 2 − 4 m . This implies that n ∣ m + 5 , n ∣ m 2 + 1 0 m + 2 5 . Together with the fact that n ∣ m 2 + 4 , n ∣ 1 0 m + 2 1 . With the fact that n ∣ m + 5 we have n ∣ 1 0 m + 5 0 , n ∣ 2 9 . This gives the solution (5, 29).
We have just shown that n cannot be greater than 5. Hence, from the two solutions above, we obtain the answer as 2 + 5 + 2 9 = 3 6 .