Find the number of integers a such that a 2 − 3 a − 1 9 is divisible by 2 8 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.
How do you explain that if 17|n^2 then 17^2|n^2 ? By the way ,neat and awesome solution . Mindblowing !
Log in to reply
Thanks for the compliment! As for your question, since 1 7 is prime and divides n 2 we must have that 1 7 ∣ n . So in the prime factorization of n 2 the factor of 1 7 must appear (at least) twice, i.e., 1 7 2 ∣ n 2 .
Log in to reply
Got that. Sir, you may not remember a little time ago I asked your advice about where to study NT from.I wanted to thank you because now I am beginning to get an edge over it.After geometry it has become my favourite topic.One more thing .Today ,I published a note named "The most beautiful solution ever".If users like you would contribute to it then it might prove useful to the fellow Brilliantians.
Log in to reply
@Raven Herd – Glad to hear that you are enjoying Number Theory. :) As for your new note, I'll have to give some thought as to which solutions I've seen on Brilliant that I would consider "beautiful". I've seen many elegant solutions, but I haven't kept a list of them so they may be difficult to track down before deciding whether they qualify as beautiful.
Hi Brian. There's an error in your discriminant value: it should be 85 + 1,156k (289 * 4 = 1,156). I still end up with the same result of the discriminant being a non-perfect square since:
85 + 1156k = 17(5 + 68k)
which requires 5 + 68k = 17^(2n-1). But we now obtain: 5 = 17^(2n-1) - 68k = 17[17^(2n-2) - 4k] => 5/17 = 17^(2n-2) - 4k => NOT POSSIBLE for positive integers n and k. Hence, there are no integers a such that 289 | a^2 - 3a - 19.
Log in to reply
Yup, you're right. Thanks for catching that. :)
No prob....sorry it took 4 years to catch it!
Hack: If there is any satisfying a , then a + 2 8 9 also satisfies the condition. Thus there can be no such a , otherwise there would be infinitely many such a , which doesn't fit to Brilliant's answer format.
This method was superrrb!!!
Let's take a 2 − 3 a − 1 9 = ( a − 1 0 ) ( a + 7 ) + 5 1 .
Suppose 2 8 9 divides a 2 − 3 a − 1 9 , 1 7 must divide ( a − 1 0 ) or ( a + 7 ) .
If 1 7 divides a − 1 0 , a ≡ 1 0 ( m o d 1 7 ) . Hence, a + 7 ≡ 1 0 + 7 ≡ 1 7 ≡ 0 ( m o d 1 7 ) .
If 1 7 divides a + 7 , a ≡ − 7 ≡ 1 0 ( m o d 1 7 ) . Hence, a − 1 0 ≡ 1 0 − 1 0 ≡ 0 ( m o d 1 7 ) .
Hence whenever 1 7 divides one of a − 1 0 and a + 7 , it must divide the other also.
Thus, 1 7 2 = 2 8 9 divides ( a − 1 0 ) ( a + 7 ) .
Since 2 8 9 divides ( a − 1 0 ) ( a + 7 ) , 2 8 9 must divide 5 1 which is impossible.
Hence, there is no integer a such that 2 8 9 divides a 2 − 3 a − 1 9 .
Problem Loading...
Note Loading...
Set Loading...
We require that a 2 − 3 a − 1 9 = 2 8 9 k ⟹ a 2 − 3 a − ( 1 9 + 2 8 9 k ) = 0 for some integer k .
By the quadratic formula we then have that
a = 2 3 ± 9 + 4 ∗ ( 1 9 + 2 8 9 k ) = 2 3 ± 8 5 + 1 1 5 6 k .
As we are looking for integer values for a , we will require that
8 5 + 1 1 5 6 k = 1 7 ( 5 + 6 8 k ) = n 2
for some integer n . With 1 7 being prime, since 1 7 ∣ n 2 we know that 1 7 2 ∣ n 2 , and so 5 + 6 8 k would have to be divisible by 1 7 . But as 5 + 6 8 k ≡ 5 ( m o d 1 7 ) this is not the case, and so 8 5 + 1 1 5 6 k cannot be a perfect square. Thus, there are 0 integer solutions for a .