Geekzone: technology news, blogs, forums
Guest
Welcome Guest.
You haven't logged in yet. If you don't have an account you can register now.


btone

13 posts

Geek
Inactive user


#94728 17-Dec-2011 13:22
Send private message

Have been (mildly) pondering this, and I have to say I find it quite interesting and puzzling!
Here it is:
If you add odd numbers in chronological sequence you get a list of square numbers 
So if you go --> 1 + 3 (= 4) + 5 (= 9) + 7 (= 16) + 9 (= 25)..

 

Create new topic
John2010
532 posts

Ultimate Geek
+1 received by user: 28


  #558974 17-Dec-2011 13:58
Send private message

To add to your pondering you will also find that not only do you get squares as you show but that each of those squares is the sum of all the preceding odd numbers.



Jarno
270 posts

Ultimate Geek
+1 received by user: 50


  #558975 17-Dec-2011 13:59
Send private message

Where is the puzzling bit?

sum{i = 1..n} (2*i - 1) = (2 * sum i) - (sum 1) = (2 * (n * (n+1) / 2)) - (n) = (n^2 + n) - (n) = n^2

Please excuse my liberalism with notation here.

---JvdL---

John2010
532 posts

Ultimate Geek
+1 received by user: 28


  #558979 17-Dec-2011 14:08
Send private message

Fermat's last theorum is next for you Jarno. Wink



btone

13 posts

Geek
Inactive user


  #558988 17-Dec-2011 14:39
Send private message

@john, haha yes, well that's how it's supposed to work, as you add consecutive numbers together, to get the square in the first place.
@jorno is this for real?? far over my head 

Create new topic








Geekzone Live »

Try automatic live updates from Geekzone directly in your browser, without refreshing the page, with Geekzone Live now.



Are you subscribed to our RSS feed? You can download the latest headlines and summaries from our stories directly to your computer or smartphone by using a feed reader.