Let a be a positive integer divisible by 4 but not divisible by 8 . What is the largest positive integer n such that 2 n divides
a 1 0 0 + a 1 0 1 + a 1 0 2 + a 1 0 3 + ⋯ + a 1 0 0 0 ?
This problem is posed by Kiriti M.
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.
rewrite a=2^2×(an odd number), a^100+a^101+a^102+.........+a^1000=a^100×(1+a+a^2+a^3+........a^10), (a+a^2+a^3......a^10) is even, and (1+a+a^2+a^3+........a^10) is odd a^100×(1+a+a^2+a^3+........a^10) =a^100×(an odd number) =[2^2×(an odd number)]^100×(an odd number) =2^200×(an odd number) ∴n=200.
When writing up a solution, you should ensure that your statements are clearly explained. You should imagine that your audience is someone who has worked on the problem, but is unable to solve it.
Even if you have the answer to life the universe and everything, it will not be helpful if you cannot explain it clearly to others.
Could anyone please explain the question in more detail, I usually can solve those problems but the question should be explained better. To start, I do not see how a and n relate in the question. I understand that a should be 4 or a multiple of 8 added for it to be divisible by 4 but not by 8. I even think that any number (5 or 6) is divisible by 8 but the answer just isn't an integer, but why would that be a problem if the question doesn't state that the answer should be an integer?
But then the jump to n and that it divides. Divides by what? How does n relate to a?
Explain more
I can't understand it.
maybe
great answer
Is this step true?
a^100+a^101+a^102+.........+a^1000=a^100×(1+a+a^2+a^3+........a^10)
Shouldn't it equal:
a^100(1+a+a^2+a^3........a^900)
i thought divisible by 4 but not divisible by 4? can't get this question :3
let x=4k where k is an odd integer as it is not divisible by 8.Then a^100+a^101+a^102+....+a^1000=(4k)^100+(4k)^101+.....+(4k)^1000=(4k)^100(1+(4k)+(4k)^2+.....+(4k)^900)=4^100*k^100(1+2K) where 2K=(4k)+(4k)^2+.....+(4k)^900....k being odd the highest power of 2 dividing a^100+a^101+a^102+....+a^1000 is 4^100=2^200....thus n=200.
Only the odd multiples of 4 divide 4 but not 8. So, 4, 12, 20.... and so on. As such,
4
should work as
a
. First determine the highest
n
such that
2
n
divides
a
1
+
a
2
+
a
3
.
.
.
.
.
.
a
1
0
. Using
4
as
a
, this comes out to
1
,
3
9
8
,
1
0
0
, which is only divisible when
n
is equal to
2
. Becuase your test exponents were
1
0
0
1
of the questions, multiply your value of
n
by
1
0
0
, and this is the answer.
(
1
0
0
∗
2
=
2
0
0
)
i seriously can't understand. isn't their any simpler way to find it?
Log in to reply
Understand this solution? I thought it was rather simple, especially compared to the rest here
I can't understand
since a is divisible by 4 but not by 8, it can be said that a = (2^2)k, where k is an integer. a^100+a^101+a^102+a^103+⋯+a^1000 is a geometric series that can be rewritten as a^100((1-a^901)/(1-a)). the problem then can be restated as [a^100((1-a^901)/(1-a))] / 2^n. we only need to look for n that will make a^100 divisible by 2^n.
using a = (2^2)k, we can rewrite a^100 as (2^200)k^100. to make 2^n be a divisor of (2^200)k^100, n has to be at most equal to 200. so n = 200.
While essentially correct, this solution could be improved in several ways:
It skips several steps, which makes it hard to follow. For example, he uses the fact that 1 − a 1 − a 9 0 1 is an odd number, but does not state it nor explain why. This is true because the numerator is odd.
Be careful with trying to use "equivalent" statements. For example, even though " a = 2^2k \( where \(k is an integer" is a true statement, it is not sufficiently strong enough to work through the rest of the problem. In the steps that were skipped, the fact that k is an odd integer is extremely important.
plese explain more
it is difficult to understand
thanks
Problem Loading...
Note Loading...
Set Loading...
Based from the given. We consider a=4k where k is also a variable positive number. So, we substitute
( 4 k ) 1 0 0 + ( 4 k ) 1 0 1 + ( 4 k ) 1 0 2 + ( 4 k ) 1 0 3 +⋯+ ( 4 k ) 1 0 0 0
thus, that the largest factor of ( 4 k ) 1 0 0 + ( 4 k ) 1 0 1 + ( 4 k ) 1 0 2 + ( 4 k ) 1 0 3 +⋯+ ( 4 k ) 1 0 0 0 is 4 1 0 0 which is equal to 2 2 0 0
therefore,
2 2 0 0 = 2 n , n=200