![]() |
![]() |
#100 |
veganjoy
"Joey"
Nov 2015
Middle of Nowhere,AR
3×5×29 Posts |
![]()
It's 2019!
![]() Went out to practice driving for the first time today (with my mom in the car). First thoughts:
![]() |
![]() |
![]() |
![]() |
#101 |
veganjoy
"Joey"
Nov 2015
Middle of Nowhere,AR
1101100112 Posts |
![]()
I was going to post these in the cell phone astrophotography thread, but the cell phone ones were very bad. These were taken with a more legitimate camera:
|
![]() |
![]() |
![]() |
#102 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
920510 Posts |
![]()
Very nice.
|
![]() |
![]() |
![]() |
#103 | ||
Aug 2006
3×1,987 Posts |
![]() Quote:
![]() Quote:
|
||
![]() |
![]() |
![]() |
#104 |
veganjoy
"Joey"
Nov 2015
Middle of Nowhere,AR
3·5·29 Posts |
![]()
My dad wanted me to post about my math observation; a long time ago I noticed that each successive square number is a successive odd number less than the next. So starting from 0, the first odd number is 1, which is the first square. Adding the next odd number, 3, to 1 gives 4, the second square. Add 5, get 9, add 7, get 16, etc. I’m not sure what kind of equation would describe this; it’d be trivial to code and easy to make a series describing it though. Is this a coincidental correlation or does it have some meaning?
|
![]() |
![]() |
![]() |
#105 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
5·7·263 Posts |
![]()
How long does this trend last?
Have you looked fro this in oeis? |
![]() |
![]() |
![]() |
#106 | |
Sep 2002
Database er0rr
3,533 Posts |
![]() Quote:
Last fiddled with by paulunderwood on 2019-04-05 at 01:18 |
|
![]() |
![]() |
![]() |
#107 |
"William"
May 2003
New Haven
23×5×59 Posts |
![]()
Have you learned Sigma notation yet? If so, you should be able to use it to write an expression for the sum of the first n odd numbers.
Have you learned inductive proofs yet? If so, you should be able to prove the relationship holds. |
![]() |
![]() |
![]() |
#108 |
Dec 2012
The Netherlands
22×5×79 Posts |
![]()
Good observation!
Here's a picture to see what's going on: If we add this to the observation you made earlier we have 2 sequences: \[ \begin{eqnarray*} 1+2+3+\ldots +n & = & \frac{1}{2}n(n+1) \\ \underbrace{1+3+5+\ldots +(2n-1)}_n & = & n^2 \end{eqnarray*} \] In both sequences, the difference between terms next to each other remains constant (the numbers go up by 1 each time in the first sequence and by 2 each time in the second one). Sequences with this property are known as arithmetic progressions. There is a formula for the sum of all the terms in any arithmetic progession, which is useful to know: add the first and last terms together, multiply by the number of terms and divide by 2 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
My daily (srly?) work blog | MisterBitcoin | MisterBitcoin | 10 | 2018-03-30 19:35 |
The Update Blog | ltd | Prime Sierpinski Project | 48 | 2010-12-28 13:24 |
Puzzle Blog | grandpascorpion | Puzzles | 0 | 2008-07-07 22:53 |
Project Tools & Blog | Xyzzy | Lounge | 6 | 2007-09-05 16:27 |