1
is an
odd
number.
1
+
2
is an
odd
number.
1
+
2
+
3
is an
even
number.
1
+
2
+
3
+
4
is an
even
number.
1
+
2
+
3
+
4
+
5
is an
odd
number.
⋯
⋯
True or False?
1 + 2 + 3 + ⋯ + 9 9 9 is an odd number.
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.
1 to 999....499 numbers are even 500 are odd ...Sum of even 499 no always even ...And sum of 500 odd number is always even ... And then add even sum and odd sum and even +even =even
Beautifully succinct. Thanks Munem!
Didn't see a solution using modulo calculations, so here we go: i f n ≡ 1 , 2 m o d 4 t h e n t h e s u m i s o d d . i f n ≡ 3 , 4 m o d 4 t h e n t h e s u m i s e v e n .
Since 9 9 9 ≡ 3 m o d 4 , the sum is even.
Just to be clear where the pattern comes from:
1: The pattern begins with an odd number.
2: An odd number + an even number is odd, so the number stays odd.
3: An odd number + an odd number is even, so the number switches to even.
4: An even number + an even number is even, so the number stays even.
5: An even number + an odd number is odd, so the number switches to odd. The pattern is back to the start.
This can be drawn as a diagram showing every combination of adding even and odd numbers:
A related (but not identical) kind of parity involving rotating through a 2 by 2 grid of choices shows up in this logic puzzle from earlier this year .
In general, if you can show a problem uses a repeated pattern that covers all squares on an n by n grid before returning to the start, modulo n 2 ought to be useful in a solution.
Woah that's a lot more concise than I put it, nice. Also now I know how to actually write modulo instead of just using what computers use (%), so thanks a lot.
I started with odd numbers and took the n+1. I suppose that's n+1 % 2 = 0 to find odd numbers. but my thought was the following even number % 2 had to be even. That comes out to (n/2 % 2) = 0. Somewhere that must be proven to be equal to n%4 =0.
It doesn't advance to given answer but might help others find their way to it from the path I took.
Dummy here. I worked out the pattern and worked back from 999 to have 996 starting the odd, even, even, odd pattern so thought 999 would be odd. What am I missing?
using the formula, 2 n ( n + 1 ) for that ,
2 9 9 9 ( 9 9 9 + 1 ) = 2 9 9 9 0 0 0 .............[clearly seen that it is divisible by 2,so it is an even number]
note:Any integer that can be divided exactly by 2 is an even number.and if the last digit of any integer is 0 , 2 , 4 , 6 , 8 ,it s divisible by 2.
you just found the sum. You have to prove that the sum is divisible by 2. Therefore, you have to show that n(n+1) is divisible by 4 which in this case it is.
Log in to reply
is that okay,bro?
Log in to reply
Thats not what i meant. n(n+1)/2 represents the sum of the integers so you need to divide by 2 AGAIN to prove that it is an even number. For example, the example they gave above for an odd sum was 1+2+3+4+5 so therefore by your logic since n(n+1)/2=5(6)/2=42/2 then it is an even number as the numerator is divisible by 2 which is obviously not true. You just showed that n(n+1) is divisible by 2 which is true for any integer n. n(n+1) does not represent the sum, n(n+1)/2 does so you need to divide the sum by 2 and not just the numerator of the sum.
Log in to reply
@Aviel Avshalumov – at first--this is the basic technique to identify even or odd numbers which i wrote.[obviously true for this types of cases.]
secondly--i could have got the value by doing the full calculation.but i showed how it is done so cheaply without getting the total sum.
Log in to reply
@Mohammad Khaza – maybe im just interpreting your solution incorrectly because from what im reading it appears you are trying to say that 999000 is divisible by 2 therefore the sum is even.
Log in to reply
@Aviel Avshalumov – He might be saying 999000/2 is divisible by 2. Which is clearly true, given all the zeros at the end of the numerator. But if that's the argument, it's not made clearly.
@Mohammad Khaza – Let S be the value of sum of consecutive integers. S can be even or odd.
So you need to show that S / 2 is integer to show that the sum is even.
We also know that S = n(n+1) / 2
So what Aviel Avshalumov is saying is that you need to show that n(n+1)/4 is integer to claim that the sum is even.
If we subtract '1' from every odd number of: 1 + 2 + 3 + ... + 999 we get: 0 + 2 + 2 + 4 + 4 + ... + 998 + 998. Now ask yourself, is that new sum odd or even? It is clearly even because every term we have now is even. The question remains, how many odd numbers were in the original sum? In other words, what number did we subtract from the original sum, to get the new one? The answer is 500. Because 999 + 1 divided by two is 500. Note that 500 is even. We know that the sum of even numbers is always even. And the new sum is also even. So the new sum (even) + 500 (even) = original sum which is an even number. Thus, 1 + 2 + ... + 999 is even.
Extend the sum from 1 to 1000. Then there will be five hundred even numbers and five hundred odd numbers in the sum.
Just a little thought shows that since there are an EVEN number of ODD numbers in this sum the total will be EVEN. (Because the odd numbers can be summed two at a time to give even numbers. Adding these with the even numbers in the sum produces an even number).
Taking away 1000 (an even number) from the extended sum does not change the parity, and so
1+2+3+.........999 is EVEN.
Such a nice explanation
That’s a good explanation, thanks.
Nice. That's the reasoning I took.
1 + 999 even, 2 + 998 even, 3 + 997 even, ... It cancels out and becomes even. Therefore false
I took a similar approach. There are 499 pairs that add to 1000 (1+999, 2+998,...) with only the number 500 (which is even) left over. Therefore the sum is even.
E xcellent solution - brief as it should be for a problem this easy (I already knew the 1,000th triangle number, and of course it required no measurable thought process to realise that deducting 1,000 to get the 999th triangle number keeps it even).
we know that from 1 to 1000 there are 500 odd, 500 even.
The sum of k odd numbers is even iff k is even.
so 1 + 2 + 3 + ⋯ + 1 0 0 0 − 1 0 0 0 is even
Every group of four goes odd,odd,even,even. 4 9 9 9 is 249 with a remainder of three so those three will be odd,odd,even. The last one is even.
Find the sum to 999 and then check it:
2 n ( n + 1 ) ⟹ 2 ( 9 9 9 ) ( 1 0 0 0 ) → 2 9 9 9 0 0 0 = 4 9 9 5 0 0 ⟹ which is Even
2 ( 9 9 9 ) ( 1 0 0 0 ) = 4 9 9 5 0 0 not 49950.
o d d + o d d = e v e n
o d d + e v e n = o d d
e v e n + e v e n = e v e n
In other words the addition of an odd number to the sequence will flip the result, and the addition of an even number will leave it untouched. We start with an odd number, and the sequence of additions will always be:
o d d + e v e n + o d d + e v e n . . . .
We can confirm then, that the sequence of the sums will start as odd, then it will stay like that, then it will switch to even and stay once more before repeating, or in other words, it will always be
o d d , o d d , e v e n , e v e n
Since the pattern repeats and has a length of 4, we know adding up to a multiple of four, and one less than, will always result in even sums, and adding up to anything else will always result in odd sums, so all we need is the modulo 4 (remainder when divided by 4) of the last number we're adding.
9 9 9 ≡ 3 ( m o d 4 )
Or in other words, 999 is one less than a multiple of 4, so the sum of all integers up to 999 must be even.
There is a pretty clear pattern here. Each time a new odd number in the sequence is added, the sum changes between odd and even, so we can work out whether the sum will be odd or even without computing the sum.
1 is odd, 1+2+3 is even and 1+...+5 will be odd. This pattern will repeat all through the sum.
To determine if i = 1 ∑ x x is odd or even, where x is odd and x > 1 , simply find 4 x − 1 .
If n is any integer and 4 x − 1 = { n n + 0 . 5 the sum is odd the sum is even
In this case, 4 x − 1 = 4 9 9 8 = 2 4 9 . 5 = 2 4 9 + 0 . 5 . Therefore, i = 1 ∑ x 9 9 9 is even.
What is the reason for dividing x-1 by 4 only? Can you elaborate? Can we divide x-1 by 8 ??
Log in to reply
Sorry, I didn't explain that in my answer.
We start with an odd sum (1). 1+2 is odd (3) and 1+2+3 is even (6), 1+2+3+4 is even (10) and 1+2+3+4+5 is odd (15). This pattern repeats through the whole sum. This demonstrates the change between even and odd sums that I stated would happen every time the sequence adds a new odd number. However, we can extrapolate that further: every second odd number must make the same change (i.e. odd to even or even to odd). The difference between two odd numbers that make the same change is 4. Yes, a difference of 8 between the odd numbers will also cause the same phenomenon, however, if you divide by 8, you will miss the in-between changes divisible by 4 but not 8. You could still work it out with more cases for your result, but 4 is much simpler.
We can show the result works throughout the sum as follows:
Say y =(m+1) and z = (m+3) where m is an even constant. y and z are therefore consecutive odd numbers.
(y-1)/4 = (m+1-1)/4 = m/4 and (z-1)/4=(m+3-1)/4 =(m+2)/4. Now m and m+2 are consecutive even numbers. Therefore, either m or m+2 is divisible by four and the other will leave a remainder of 0.5. We know that the first sum (1) is odd, therefore summing to 3 is even (6). (3-1)/4=0.5, therefore, the odd numbers that create an even sum will leave a 0.5 term and those which leave an odd sum will not (since the pattern persists through the sum).
1+999=1000 (even) + 2+998=1000 (even) + 3+997=1000 (even)...+ 499+501=1000 (even), + 500 (also even) = even Steven.
To solve it quickly try to make the question more simpler
When you need to do it quick follow this method
Prerequisite information ;-
The logic uses 2 notions:-
• EVEN NUMBERS :-
✓ Sum of even numbers is always even
• ODD NUMBERS :-
✓ sum of odd number(s) of odd number(s) is always odd
Example:- 1+3+5=9
1+3+5+7+9=25
✓sum of even number(s) of odd number(s) is always even
Example :-. 1+3=4
1+3+5+7= 16
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, Proof.
Sum of first n odd numbers results in n^2. Or in words n squared. Or n*n So we can conclude
[square of even number is always even and is also divisible by 4 ]
-if n is odd the sum is odd
[ Square of odd number is always odd. , It is divisible by neither 2 nor 4 ]
For more eloboration comment on your doubts.
.........
Alternative
.........
Let a b c be 3 odd numbers. And the be equal to (z+1) (y+1) (x+1). respectively
So , z,x ,y are even as a number before a odd number is even
For odd number of terms
z+1+y+x+1+1 =. Even number +3= odd number
For even number of terms
z+y+1+1= even number+ 2 = even number
This can be followed for any number of terms
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
Now
1+2+3+4+5+6+7+8+9.................................+997+998+999
=(1+3+5+7.......................................997+999)+(2+4+6+8+10..................+998)
=( 1+3+5+7...............+999)+ a even number
Here there are 500 odd numbers So, its clear that their sum would be even
= even number +even number =even number
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
Most of you may comment its to lengthy
But I just solved it in 5 seconds after reading the question (approximated)
I only calculated the whole in mind only. I am honest, but i could have solved it even quickly. I was not focused and lacked proper conditions for it.
Its just a matter of pre requisites that has taken all this space
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
( Or)
You can use one of the formulae taught to you in middle school (mostly)
∆ Sum of cosecutive numbers = ( n/2)*(first term +last term)
where n is the total number of terms to be added
Here,
(999/2) (1+999) = 1000 (999/2) =999000/2. = 499500
............................................................
Most of you may comment its to lengthy
But I just solved it in 5 seconds after reading the question (approximated)
I only calculated the whole in mind only. I am honest, but i could have solved it even quickly. I was not focused and lacked proper conditions for it.
Its just a matter of pre requisites that has taken all this space
My theories had to be more clearly conveyed so I had to eloborate it so all readers can understand it and get benifited
............................................................
My aim was to help others not only to solve but also to think differently and quickly. That would improve thinking by one's self rather than following all ideas of others
Please value my work and time for your benifit UPVOTE THIS SOLUTION and FOLLOW ME if you're interested to do so
The whole and sole purpose of this was to help others
The odd/even solution is cyclic in groups of 4, odd, odd, even, even, therefore we can divide by 4 and consider only the remainder (mod 4). 996 is the highest multiple of 4 that is lower than 999, therefore 999 is the 3rd number in the next odd, odd, even, even sequence. 997 odd, 998 odd, 999 even , 1000 even. So the correct answer is false.
I know the formula that Munem Sahariar posted below and that is a great approach to the problem, but I wanted to see if I could do it a different way. I realized that there are 1000 numbers from 1 to 999. I matched 1 with 999, 2 with 998 and so on, knowing I would get 500 pairs and each pair added up to an even number. Not elegant but pretty simple.
Call S n as the sum of n natural numbers. Then, S n = 1 + 2 + 3 + ⋯ + n S n = n = 1 ∑ n = 2 n ( n + 1 ) let's make some observations to determine the obtained number from sum is either odd or even
Case 1 : If 2 n = p ∈ Z + and p is an odd integer, then there exist 2 p − 1 even terms/ 2 p − 1 odd paired terms and one remaining odd number which implies that obtained integer will be odd .
For example:
S 6 = 1 + 2 + 3 + 4 + 5 + 6 = o d d + o d d + o d d = e v e n + o d d = o d d
Case 2 : If 2 n = q ∈ Z + and q is even integer, then there exists always 2 q even terms which shows that number obtained will be always even .
For example :
S 4 = 1 + 2 + 3 + 4 = o d d + o d d = e v e n .
Case 3: If 2 n ∈ Q + or is rational number, then 2 n + 1 should be noted to determine whether the number is odd or even.
If 2 n + 1 is odd, then the number will be odd .
If 2 n + 1 is even, then the number will be even .
S 9 9 9 is the third case in which 2 n is rational number and when noting 2 n + 1 = 2 1 0 0 0 = 5 0 0 is even number, Therefore the answer is even .
i = 1 ∑ 9 9 9 i = 4 9 9 , 5 0 0 ⟶ Even
There are 500 odd numbers and 499 even numbers where total numbers are 999.
even + even = even (always).so the summation of 499 even numbers makes a 'even number'.
Again, odd + odd+..(even times)=even odd+odd+odd+..(odd times)=odd so,the summation of 500 odd numbers makes a 'even number'.
And the last two even numbers make a even number.
Ans:False
I searched a rule (formula) for the general problem: when
1 + 2 + … + n
is even or odd ?
I found that, if
S n : = i = 1 ∑ n i
is the sum, then, setting
k : = ( n + 1 ) ∖ 2
(where " ∖ " stays for the quotient operator), we have that
S n ≡ k ( m o d 2 )
Proof. Given k as defined, it can be easily found that:
n = { 2 k − 1 , 2 k , k = 1 , 2 , … k = 1 , 2 , …
alternatively for odd and even n .
We know that:
S n = 2 n ( n + 1 )
so we can write (note: " % " stands for the remainder operator):
S n % 2 = ( 2 n 2 + n ) % 2 = { ( 2 4 k 2 − 4 k + 1 + 2 k − 1 ) % 2 , ( 2 4 k 2 − 2 k ) % 2 , n odd , n even . = { ( 2 k 2 − k ) % 2 , ( 2 k 2 − k ) % 2 , n odd , n even .
Thus always:
S n % 2 = ( 2 k 2 − k ) % 2 = − k % 2 = k % 2
as the thesis.
In this way, for n = 9 9 9 , k = 5 0 0 , hence S 9 9 9 is even.
Is 1 + 2 + 3 + ... + 998 + 999 an odd number ? No. Here is why :
By definition, with n, m, k integers in the following :
Let's prove that p(k + 2n) = p(k), or said simply, you don't change parity of any number by adding an even number to it. let's consider the cases where k is odd then even : if k is odd then k = 2m+1 with m an integer. 2m+1 + 2n = 2(n+m) + 1 and 2(n+m) + 1 is therefore also odd because (n+m) is an integer. if k is even, k = 2m and 2m + 2n = 2(n+m) and (2(n+m) is also even. The parity does not change in either case.
Similarly, let's prove the parity of the sum of two odd numbers to be even : (2n + 1) + (2m + 1) = 2(m+n+1)
4 consecutive integers following any k are k+1, k+2, k+3, k+4. The sum of these is 4k + (1 + 2 + 3 + 4) = 4k + 10 = 2 (2k+5) and 2n+5 is an integer, so :
From and (3) and (5) it results that subtracting any 4 consecutive integers from a sum does not change it's parity.
The sum p ( i = 1 ∑ 9 9 9 i can be written as a certain number of these packets of four, plus the remaining terms completing the list up to 999. Let n be the number of packets as defined above that we can subtract from the sum without changing its parity.
n = 1 ∑ k ( 4 n + 1 + 4 n + 2 + 4 n + 3 + 4 n + 4 ) will always have an even parity.
4 k + 4 ≤ 9 9 9 4 ( k + 1 ) ≤ 9 9 9 k + 1 ≤ 4 9 9 9 k ≤ 4 9 9 9 − 1 k ≤ 2 4 8 maximum k is 248 4k+4 = 996
Therefore the parity of the whole sum is the same as : p ( i = 1 ∑ 9 9 9 i = p ( 9 9 7 + 9 9 8 + 9 9 9 ) = p ( 9 9 8 ) b y ( 4 )
and so the sum 1 + 2 + 3 + ... + 999 is even and not odd, the result is false.
1+2+3+.......+998+999
+
999+998+997.....+2+1 =1000+1000+........+1000+1000
There are 999 thousands. So, [999×1000]÷2 gives the sum of the given series which is even. So the statement is false.
The sum of 1 + .... + n = n(n+1)/2. The numerator factors are always one odd and one even number. For the sum to be even it is necessary for the even factor to also be divisible by 4 in order for the sum to be even after dividing by the denominator 2.
The sum is even if and only if either n or n + 1 is divisible by 4.
In this case n = 999, n + 1 = 1000 = 4 x 250, therefore the sum is even, and the statement is false.
Every 3rd and 4th number added will have an even sum. 1000 is divisible by four and 999 is the number before it so they must have an even sum.
That’s quite an interesting pattern! Analyzing this sequence of triangular numbers (Just 1, 1+2=3, 1+2+3=6, ...), we get an infinite cycle of O, O, E, E, O, O, E, E, ... (O=Odd and E=Even)! This cycle loops every 4 integers, and the largest multiple of 4 less than 999 is 996. 999-996=3, meaning the third member of this infinite loop, an even number! Thus 1+2+3+...999 is even, not odd!
Since 1+2+3+4+5...+999 has a total number of terms of 999, we can split the terms into halves, even if they won't be equal, and have every opposing sides of the equation added as a pairs (1+999= 1000, 2+998= 1000, 3+997=1000, ...). Based on this number theory, if 499 of the terms each equals to 1000, that last unpaired term should be half of the the two pairs equal to 1000 we've listed off so far, so that would be (499*1000)+ 2 1 0 0 0 = 499500, which is an even number. Therefore, the answer for this question would be false.
Simplistic view with no written calc. It goes 1 Odd, 2 odd, 3 even, 4 even then repeats. 1000 is divisible by 4, so is even. 999 is 1 back in the pattern so is even.
if the the sum of the first and the last number of the progression divided by 2 is even the sum is even. In this case (1+999)/2 = 500 is even. (The result is odd only when the the first and the last number of the progression divided by 2 is odd AND the number of progression members is ODD)
n = odd
1 + n = odd
1 + 2 + n = even
1 + 2 + 3 + n = even
1 + 2 + 3 + ... + n = odd ?
n mod 4 = b
if b = 1 or 2 then n = odd
if b = 3 or 0 then n = even
999 mod 4 = 3
then 999 is even , so the answer is false .
The pattern follows as two odd then two even. Every second number is even, duh, but every second number is also the last of the even or odd kind. e.g. 1+2, 2 is even and 1+2 is odd. If 2 is divided by 2 we get an odd number (1). If 4 is dived by 2 we get an even number. The pattern follows. So when we get to 999 we now that this must be the first number that is in either the even or odd series so we add 1 to get the second number which we divided by 2 to find if it is even or not and we end up with 500, which even; thus 1+2+3+...+999 is NOT an odd number, making the answer false. Or you could use the smart formula of 2 n ( n + 1 )
The Sum of an arithmetic series is written by the formula Sn = n/2{2a+(n-1)xd} In this case, a=1, n=999 and d=1 therefore 999/2[2(1)+(999-1)x1] = 999/2(1000) = 499500 Therefore as this is an even number the answer is false
Parity switches on the odds; f (1) is odd, f(2) is odd, f(3) is even, f(4) is even, f(5) is odd , f(6) is odd, f(7) is even. It'll just cycle like that. So numbers of the form 4n+1 and 4n+2 result in odds and the rest result in evens.
1 + 2 + 3 + 4 + . . . . . 9 9 9 = 2 9 9 9 ( 1 0 0 0 ) ⇒ 2 9 9 9 ( 1 0 0 0 ) = 4 9 9 5 0 0 ⟶ Even Hence the answer is False
odd + even = odd
odd + odd = even
even + even = even
Therefore:
1, 1+2=3, 3+3=6, 6+4=10, 10+5=15, 15+6=21, 21+7=28, 28+8=36, 36+9=45, 45+10=55, 55+11=66, 66+12=78
odd, odd, even, even, odd, odd, even, even, odd, odd, even, even
999/4 = 249 + 3/4 (odd,odd,even,even)+...+(odd,odd,even,)
1+2+3+...+999 Is Even
1 + 2 + 3 + . . . + 9 9 7 + 9 9 8 + 9 9 9 = a Notice that: 1 + 9 9 9 = 1 0 0 0 and 2 + 9 9 8 = 1 0 0 0 and 3 + 9 9 7 = 1 0 0 0 so ( 1 + 9 9 9 ) + ( 2 + 9 9 8 ) + . . . = a which is the same as saying 1 0 0 0 + 1 0 0 0 + . . . = a At first we were adding 999 terms one by one, and now we're adding the terms two at a time, which means wee are now adding half of the original number of terms so we can write that as 2 9 9 9 ∗ 1 0 0 0 = 9 9 9 ∗ 5 0 0 = a which is even. If you liked this answer thank the young Johann Friedrich Carl Gauss for this method.
Here is a pattern:
It does not matter how many even numbers there are, because the sum of n even numbers is always even.
But it does matter how many odd numbers are, because the sum of n odd numbers is:
a) Odd, if n is an odd number
b) Even, if n is an even number
Assuming that between 1 and 999 there are 500 odd numbers, and 500 is an even number, the statement is false.
it is a reapeating sequence of five. The first odd number of the the sequence is 1,5,10,15,... then 1000 will be the first odd number of a sequence , then 999 ( the previous number) is even
Let S(n) equal the sum from 1 through n. Extend the sums until you see the pattern emerge: S(1)- Odd; S(2)- Odd; S(3)- Even; S(4)- Even; S(5)- Odd; S(6)- Odd; S(7)- Even; S(8)- Even; S(9)- Odd.
This should be enough to see that the pattern repeats in groups of 4: Odd, Odd, Even, Even. Every number that is divisible by 4 ends the group, and the sum to that point is always Even. Every number just before the multiple of 4 is also Even. 1000 is divisible by 4, so S(1000) is Even. 999 is the one just before it, so S(999) is also Even.
We notice from the first few levels a pattern of periodicity 4. 1 level plus 250 periods puts us at an end term of 1001, with the same pattern placement (odd, next being odd). Taking two steps back to an end term of 999 puts us at a pattern placement of even
Sum of first n integers = n(n+1)/2
Hence, the sum =999×1000/2
=999×250×2
a multiple of 2
The series has an even number of odd integers (500), so it must be even.
Since the sequence is defined by the sum of the previous result with the current sequence term, it satisfies the following statement:
a = r + n
Where:
a = t o t a l
r = r e s u l t
n = t e r m
In which it can be also written as:
So the answer would be:
Therefore 1 + 2 + 3 … + 9 9 9 is not an odd number
Ans.: FALSE
1 is an odd number.
1 + 2 is an odd number.
1 + 2 + 3 is an even number.
1 + 2 + 3 + 4 is an even number.
… … …
1 + 2 + 3 + 4 + 5 is an odd number.
1 + 2 + 3 + 4 + 5 + 6 is an odd number.
1 + 2 + 3 + 4 + 5 + 6 + 7 is an even number.
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 is an even number.
… … …
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 is an odd number.
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 is an odd number.
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 + 1 1 is an even number.
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 + 1 1 + 1 2 is an even number.
… … …
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 + 1 1 + 1 2 + 1 3 is an odd number.
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 + 1 1 + 1 2 + 1 3 + 1 4 is an odd number.
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 + 1 1 + 1 2 + 1 3 + 1 4 + 1 5 is an even number.
… … …
therefore, for line ending 999 ( m o d 4 ) = 3
therefore, from third line above is even therefore false
1+2+3+4+5+6+7 is an even number not odd number. There are more mistakes.
We know that S n = 1 + 2 + 3 + ⋯ + n = 2 n ( n + 1 ) and that either n or n + 1 is even and the other odd. For S n to be even the even n or n + 1 must be a multiple of 4. Since 1 0 0 0 is a multiple of 4, S n is even Therefore, the answer is false .
Generalization: For S n to be even, either n or n + 1 must be a multiple of 4. Otherwise it is odd.
999 is odd and (999+1)=1000 is even, further 1000/2=500 is even. Therefore, 1+2+3+....+999 is an Even number
In general, in the sum of first n natural number:
Either one of the value n or (n+1) is even, further divided the even number by 2 and if the result is even the sum of the series is even otherwise sum of series is odd.
Problem Loading...
Note Loading...
Set Loading...
2 n ( n + 1 )
⇒ 2 9 9 9 ( 1 0 0 0 ) = 4 9 9 5 0 0 ⟶ Even
Hence the answer is false