s ( n ) = 6 n 3 − 2 n 2 + 3 n
For s ( n ) as defined above, how many positive integers n less than 2 0 0 9 are there such that s ( n ) is divisible by 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.
In short, n ( n − 1 ) ( n − 2 ) ≡ 0 ( m o d 8 ) ⟹ n ≡ 0 , 1 , 2 , 4 , 6 ( m o d 8 ) are all solutions. Each case has 2 5 1 solutions, so there 5 ⋅ 2 5 1 = 1 2 5 5 solutions.
Problem Loading...
Note Loading...
Set Loading...
s ( n ) = 6 1 n 3 − 2 1 n 2 + 3 1 n = 6 1 ( n − 2 ) ( n − 1 ) n = 6 1 t ( n )
s ( n ) is divisible by 4 if and only if t ( n ) is divisible by 8. This is the case for all even numbers n , because then one of the numbers n − 2 and n is divisible by 4. (Every other number even number is divisible by 4, and the other divisible by 2). There exists 1004 even numbers in the relevant area. If n is an odd number, n − 1 must be divisible by 8. This is the case for 8 2 0 0 8 = 2 5 1 of the odd numbers in the relevant area. Thus, in total there exists 1 0 0 4 + 2 5 1 = 1 2 5 5 numbers n such that 0 < n ≤ 2 0 0 8 and s ( n ) is divisible by 4.