What is the largest positive integer that must be a divisor of the sum of an arithmetic sequence with 90 integer terms?
Try Part II
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.
Nice problem! Do you think clarifying that the first and last term must be an integer is necessary?
Log in to reply
Hmmmm...I guess you're right
Thanks, I have changed the problem accordingly.
Can not understand why mentioning the first and last term to be integers would be necessary.
45 will still be "the largest positive integer that MUST BE a divisor" of the sum. Hope, you may feel like correcting me if i am wrong..
Log in to reply
The concept of divisors is only applicable to integers: both the divisor and the number that is divided must be an integer. To know more, read the link
Log in to reply
@Hung Woei Neoh – Yes, I know. But I was trying to know why we can not have divisor of fractions. We do divide fractions with integers.. and further fractions.. no? If we do.. what do we call them? Will read the link. Thanks.
why on earth (a1 + a90 ) can not be greater than 45??? !!
Log in to reply
.......do you understand what the question is looking for?
Log in to reply
What is the largest positive integer => (any integer.. >0) that must be a divisor (any integer that divides the unknown sum) of the sum of an arithmetic sequence (any sequence with any 1st term, and any common difference=> any last term => any combo of (a1+a90)=> Still unknown Number=> can actually be infinitely large =>thus can have infinitely large divisor, that can be a positive integer. ) with 90 integer terms ( of course the number of terms has to be integer.. can u find a 2.11th term in a sequence?? the term sequence refers to specific points on the number line.. not specific ranges... )?
=> please correct me where i am wrong in my understanding as stated within the parentheses...
thanks.
Log in to reply
@Ananya Aaniya – Well then, since you already understand the question, we are looking for the largest positive integer that must be a divisor of
a 1 + a 2 + a 3 + … + a 9 0
We know that the sum above equals to 4 5 ( a 1 + a 9 0 ) . Now, what must be the largest positive divisor of this? 4 5
Yes, there can be larger positive integer divisors for this, but which positive divisor can divide any and all such APs? Definitely 4 5 .
Log in to reply
@Hung Woei Neoh – You have identified it where it irritated me. The question was not supposed to be about "Largest Positive Integer".
The Question was SUPPOSED TO BE about "The Largest Positive Integer In General".
It is not about the "The Largest" . Generality should have asked about for this answer to be correct.
So, This particular question.. HAS NO RIGHT ANSWER at all.
A wrong and Flawed question.... In case u understand the mammoth difference between the presence and absence of the term "any and all" in the question.
In Math.. U are NOT SUPPOSED to take anything for granted... when a specific thing is asked.. the question must be specific aswell. .. Especially at Level 3. (which is showing as the hughest level for this topic.)
Log in to reply
@Ananya Aaniya – Yes, in math you are not supposed to take anything for granted. Take note of the word "must". Like I said, there are larger positive integers which CAN be a divisor of the sum. But it doesn't mean that it MUST be a divisor. What we're looking for is a number that MUST be a divisor of such a sum, regardless of how the progression is like. This is another way of saying "what is the largest positive integer that can divide any sum of an AP of 90 terms"
The sum of a 90 term arithmetic sequence will be equal to 90 a1 + 4005 d, where d is the common difference. The GCF of 90 and 4005 is 45, so you have 45 (2 a1 + 89d). Since this is as far as this can be factored, 45 is the highest divisor of the sum of any 90 term arithmetic series.
You have to be careful, just because "that is the extent to which it can be factored", doesn't mean that there might not be additional common factors (over all possible values of a 1 and d .
For example, in the sequence generated by n ( n + 1 ) ( n + 2 ) , the GCD of the terms is 6, even though there is no constants that are immediately factorable.
Get Sum of arithmetic integer 90 : A n = a n + ( n − 1 ) r A 9 0 = a + 8 9 r S 9 0 = 9 0 a + ( 1 + 2 + 3 + . . . + 8 8 + 8 9 ) r S 9 0 = 9 0 a + ( 2 1 × 8 9 ( 1 + 8 9 ) ) S 9 0 = 9 0 a + 4 0 0 5 r
and then for biggest divisor
4 5 9 0 a + 4 0 0 5 r = 2 a + 8 9
and because that the answer is 4 5
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Arithmetic Progressions
Let a 1 be the first term of the sequence and a 9 0 be the last term of the arithmetic sequence. Then the sum of the sequence is
2 9 0 ( a 1 + a 9 0 ) = 4 5 ( a 1 + a 9 0 )
Therefore, the largest natural number that must be a divisor of the sequence is 4 5 .