![]() |
|
|
#12 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
100110001110102 Posts |
OK, post, spoilerised, you suggested key to the pattern.
|
|
|
|
|
|
#13 |
|
Jun 2004
Chicago
1C16 Posts |
f(n)=f(n-1)*f(n-3) - f(n-2); for f(1)=3, f(2)=4, f(3)=5
|
|
|
|
|
|
#14 |
|
Jun 2003
22·3·421 Posts |
f(n)=f(n-1)*f(n-2) - f(n-1) - f(n-2) |
|
|
|
|
|
#15 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
978610 Posts |
Ok, here is the way that I derived the sequence. axn1 has the correct sequence, but my formula is simpler.
n[sub]1[/sub]=3, n[sub]2[/sub]=4 n[sub]x[/sub] = (n[sub]x-1[/sub]*n[sub]x-2[/sub]) - (n[sub]x-1[/sub]+n[sub]x-2[/sub]) |
|
|
|
|
|
#16 | |
|
"William"
May 2003
New Haven
2×7×132 Posts |
Quote:
The only difference is that your expression adds two pairs of parentheses. I don't see how that counts as simpler. |
|
|
|
|
|
|
#17 |
|
Aug 2003
Upstate NY, USA
32610 Posts |
something else about this sequence:
Each term is the largest number that cannot be composed by a linear combination of a non-negative number of each of the previous two terms (holds at least until 11 39 379) I figured this part out back in middle school after a question at the MathCounts countdown was what is the largest number that cannot be created by adding 3s and 4s. also, could an admin please erase my post above this as the spoiler seems to have made my message on one line only Last fiddled with by tom11784 on 2004-08-13 at 16:39 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| "Compressor Head" - a nice educational series | Batalov | Lounge | 1 | 2015-11-08 16:18 |
| Head versus tail | R.D. Silverman | Lounge | 9 | 2008-12-16 14:28 |
| Hitting 100M digits on the head | davieddy | Lounge | 1 | 2008-10-18 10:40 |
| Bunny with pancake on his head t-shirts? | jasong | jasong | 4 | 2007-04-16 13:05 |
| Head, meet wall | fivemack | Factoring | 13 | 2007-04-13 23:26 |