The answer is actually much more complex than one would think! The correct answer though is ...
((2^n)(n-.5)!)/(2(.5!))
That looks kind of messy, so in English that is "2 to the n times n minus 1 half factorial over 2 times 1 half factorial."
Plugging in 1,3,5,7 for n on a graphing calculator, we get 1,3,15,105, which are the correct first four terms in the sequence.
2006-11-17 10:00:20
·
answer #1
·
answered by Texas Cowgirl 3
·
0⤊
1⤋
n + 2
2006-11-17 16:24:46
·
answer #2
·
answered by David N 1
·
0⤊
0⤋
General suggestion for finding a pattern. Make a table:
term, value,
k, value(k)
1, 1
2, 3
3, 5
4, 7
now add another column with your idea of what might be happening. in this case, the difference is always 2 so, every time you increment k you add 2.
k, value(k) = 1+2(k-1) = 2k-1, this is exactly the formula for the odd numbers!
2006-11-17 16:25:37
·
answer #3
·
answered by modulo_function 7
·
0⤊
0⤋
quite simple:
all of the numbers are Odd,which means all of them can be written in the form 2n-1,so :
1 * 3 * 5 *.... * (2n-1)
and yes,we write it like:
â
Î (2n-1) = 1*3*5*7*.....(2n-1) =
n=1
(2n)!
---------
2^n * n!
actually i dont know how "fool" have got this formula (and he/she is the on who deserves the points! ),and im trying to find a way to prove it,but,wow...it just simply works!
2006-11-17 16:29:59
·
answer #4
·
answered by farbod f 2
·
0⤊
0⤋
2n-1
2 * 1 -1 = 1
2 * 2 -1 = 3
2 * 3 - 1 = 5
etc.
2006-11-17 16:39:48
·
answer #5
·
answered by drizzttownz 2
·
0⤊
0⤋
2n-1
So the first term = 2*1-1 = 1
2nd term = 2*2-1 = 3
and so on.
2006-11-17 16:13:33
·
answer #6
·
answered by ? 7
·
2⤊
0⤋
â
Î 2n-1 = 1*3*5*7*.....
n=1
2006-11-17 16:25:14
·
answer #7
·
answered by M. Abuhelwa 5
·
0⤊
0⤋
the answer is 2n!/(2^n*n!)
2006-11-17 16:46:09
·
answer #8
·
answered by fool 1
·
1⤊
0⤋