Find the number of integer values of x ≤ 1 0 , 0 0 0 such that 4 ∣ 5 x 2 + 4 x + 1 0 .
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.
Yes. Reducing 5 x 2 + 4 x + 1 0 to an equivalent expression is the simplest approach.
We can create cases.
Case 1:
x is an even number. Then we can write x of the form 2 a . Then the polynomial changes to 5 ( 2 a ) 2 + 4 ( 2 a ) + 1 0 = 2 0 a 2 + 8 a + 1 0 .
Now we can see that 2 0 a 2 is divisible by 4 and 8 a is also divisible by 4 , but 1 0 is not divisible by 4 . This means the polynomial is not divisible by 4 for any even number.
Case 2:
x is an odd number. Then we can write x of the form 2 a + 1 . Then the polynomial changes to 5 ( 2 a + 1 ) 2 + 4 ( 2 a + 1 ) + 1 0 = 5 ( 4 a 2 + 4 a + 1 ) + 4 ( 2 a + 1 ) + 1 0 = 2 0 a 2 + 2 0 a + 5 + 8 a + 4 + 1 0 = 2 0 a 2 + 2 8 a + 1 9 .
Here we can see that 2 0 a 2 is divisible by 4 and 2 8 a is also divisible by 4 , but 1 9 is not. Hence, no odd number will satisfy this.
Thus there are no solutions.
Problem Loading...
Note Loading...
Set Loading...
We are finding the number of values of x such that 5 x 2 + 4 x + 1 0 ≡ 0 mod 4 . 5 x 2 + 4 x + 1 0 x 2 + 2 x 2 x 2 ≡ 0 mod 4 ≡ 0 mod 4 ≡ − 2 mod 4 ≡ 2 mod 4 However, this leads to a contradiction because the quadratic residues mod 4 are 0 and 1 . Thus, there are no integers such that 5 x 2 + 4 x + 1 0 ≡ 0 mod 4 .