20170505, 18:55  #1 
"Matthew Anderson"
Dec 2010
Oregon, USA
600_{10} Posts 
Arithmetic progressions for n
HI Mersenneforum,
Some are familiar with the technique of arithmetic progression. We are familiar with the sum of an arithmetic progression For example  1+2+3+ +n ~ n*(n+1)/2 similarly 4+5+ +n ~ (n+4)*(n+5)/2. Now I am relatively certain that the line above is true. Okay I did not tap the equals sign. The technique of arithmetic progression goes like this. Assume the Base case is true. Write it for n is 0. Then write that the n'th case implies the (n+1)'st case. End lecture. For what it's worth. Regards, Matt 
20170505, 19:17  #2  
"Forget I exist"
Jul 2009
Dumbassville
8369_{10} Posts 
Quote:
4+5+ +n is 6 less than 1+2+3+ +n ~ n*(n+1)/2 so the logic could go 4+5+ +n ~(n*(n+1)12)/2) = (n^2+n12) /2 = (used PARI/GP) ((n+4)*(n3))/2 edit: if you want to talk in general you can do y+(y+1)+...+n by realizing it's ((y1)*y)/2 less than the value you want to put that over two you multiply it by 2 ( so it's net value doesn't change you get (y1)*y subtract that from (n*(n+1)) and get (n*(n+1)(y1)*y)/2 then factor the numerator (n^2+n(y1)*y) into (n+y)*(n(y1)) = n^2+(y*n(y1)*n)(y1)*y undistribute the n in the parentheses and get n^2+n(y1)*y just like we thought so it's (n+y)*(n*(y1))/2 where y is the number you start with consecutively. edit: this falls under univariate linear equations on khan academy and though 1+2+3+4+... ( equally spaced) is a sum of an arithmetic progression so is 1+7+13+19+.... ( as before equally spaced) it just so happens the sum of an arithmetic progression is the sum of the first and last number times the number of pairs ( aka the number of terms being summed divided by 2) so the formula works as (n+1)*n/2 because 1 is the first term and there's n terms so there are n/2 pairings. so again for your 4 example you get start number =4; sum of first and last = n+4; number of terms =n3; so you get (n+4)*(n3)/2 Last fiddled with by science_man_88 on 20170505 at 20:07 

20170506, 08:54  #3 
Romulan Interpreter
Jun 2011
Thailand
2×3×1,471 Posts 

20170506, 12:22  #4 
"Forget I exist"
Jul 2009
Dumbassville
8,369 Posts 
oh and for further clarification on the name they are called arithmetic series.

20170506, 14:10  #5 
Feb 2017
Nowhere
3·7·13^{2} Posts 
Here is a curiosity about APs of consecutive integers.
EXERCISE: Prove that an integer greater than 1 is the sum of two or more consecutive positive integers, if and only if it is not a power of 2. Last fiddled with by Dr Sardonicus on 20170506 at 14:11 
20170506, 14:34  #6  
"Forget I exist"
Jul 2009
Dumbassville
8,369 Posts 
Quote:
let a=2*b be a natural number then any two numbers that add to a must be equidistant from b but for two consecutive natural numbers to be equidistant from a value of b it must a half integer aka a mixed number that ends with 1/2 which only happens if a is odd or one of its divisors is ( aka not a pure even integer aka not a power of two) in the case of three numbers adding to a number they can add to three times the middle number but that 3 defeats the ability to be a pure even number similar arguments can disprove an odd number of summands. and any number divisible by an odd number can be split in such a manner the only numbers that don't divide by an odd number greater than 1 are the powers of two so they are the only numbers not to be a sum of consecutive numbers. am I even close. edit:doh much simpler: (n+1)*n/2 only one of n+1 or n is even so there will still be an odd factor. meaning it can't sum to a pure even number sorry head is wacko again I guess. Last fiddled with by science_man_88 on 20170506 at 14:54 

20170506, 19:08  #7 
"Forget I exist"
Jul 2009
Dumbassville
8,369 Posts 
yes I know I still fumbled the proof a bit for the general case. Arithmetic progressions can be combined with geometric progressions to form arithmeticogeometric sequences etc.
Last fiddled with by science_man_88 on 20170506 at 19:34 
20170506, 21:57  #8 
"Rashid Naimi"
Oct 2015
Remote to Here/There
17×113 Posts 
It's a good thing.
Any odd number o' (including 1): o' = o'\2+(o'\2+1)  Any even number e, not a power of 2 will be divisible by an odd number o. Then e= (e/oo\2)+...+e/o+(e/o+1)+...+(e/o+o\2)  For t=2^x if there exists a sequence of consecutive integers n to m inclusive that sum up to t, then t = (n+m)(mn+1)/2 if (n+m) is odd then (mn+1) is even if (n+m) is even then (mn+1) is odd That means that t is either the product of an even and an odd integer or, t is the product of an odd and an odd integer Since no power of 2 can be the product of an odd integer, then there can be no summation of consecutive integers that equals any powers of 2. Last fiddled with by a1call on 20170506 at 22:37 
20170507, 00:06  #9  
"Rashid Naimi"
Oct 2015
Remote to Here/There
3601_{8} Posts 
Missing:
For integer x > 0 Corrected version: Quote:
Last fiddled with by a1call on 20170507 at 00:51 

20170507, 01:17  #10 
"Forget I exist"
Jul 2009
Dumbassville
8,369 Posts 

20170507, 01:58  #11 
"Rashid Naimi"
Oct 2015
Remote to Here/There
17×113 Posts 
It's missing the historical section and I can't find it anywhere.
I recall a tale told by one of my math teachers as to how a mathematician as a young pupil summed up numbers from 1 to 100 very quickly. A task which took his classmates much much longer. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Compositions of arithmetic progressions  jasonp  Factoring  8  20110820 13:42 
sieving primes in arithmetic progressions  maxal  Software  18  20101004 17:11 
Detecting arithmetic progressions  grandpascorpion  Math  18  20070328 15:08 
Prime progressions...  Xyzzy  Math  11  20041217 17:00 
Problem with determining squareroots in the progressions..  Annunaki  Math  37  20030726 15:19 