Geometry Help - BasilMarket Forum

Geometry Help

basilmarket.com forums : Chat | 15 posts archived

thread starter LetsRiot Aug 19 2009 + PM | QUOTE | PERMALINK | REPORT

So my teacher just sat at her desk and handed this out and I don't get a couple of these problems. Seven people meet and shake hands with one another. Using inductive reasoning, write a formula for the number of handshakes if the number of people is n. The fibonacci sequence consists of the pattern 1,1,2,3,5,8,13.... What is the ninth term in the pattern? Also, look at the successive ratios of one term to the next, make a conjecture. Well thats all the problems I need help with. I tried asking her but she said figure it out for yourself. Thanks~

OxStarxO 08/19/09 + PM | QUOTE | PERMALINK | REPORT

Wat...this hurts my head.

MinuteMade 08/19/09 + PM | QUOTE | PERMALINK | REPORT

ohboy, i cant wait for geometry this year!

WetFish 08/19/09 + PM | QUOTE | PERMALINK | REPORT

This isnt geometry. This is pre-calculus. The first one deals with limits/derivitives, the second one deals with limits. Tell your teacher to go away.

conradskill 08/19/09 + PM | QUOTE | PERMALINK | REPORT

1) get back to you 2)fibinachi sequence works like this 0+1=1. 1+1=2 1+2=3 2+3=5 etc....work it out 3)get back to you

wonkaisgood 08/19/09 + PM | QUOTE | PERMALINK | REPORT

the answer is 34

LetsRiot Aug 19 2009 + PM | QUOTE | PERMALINK | REPORT

conradskill : 1) get back to you 2)fibinachi sequence works like this 0+1=1. 1+1=2 1+2=3 2+3=5 etc....work it out 3)get back to you Yeah I got the second one, thanks. Also can anyone explain, "List the first eight terms of the sequence formed by finding the differences of successive terms in the fibonacci sequence."

sleepyxdude 08/19/09 + PM | QUOTE | PERMALINK | REPORT

fibonacci sequence equation: f(0) = 0 f(1) = 1 f(n) = f(n-1) + f(n-2) n being the nth term in the sequence

hermitskillz 08/19/09 + PM | QUOTE | PERMALINK | REPORT

21 for the sequence

buccs408 08/19/09 + PM | QUOTE | PERMALINK | REPORT

Uhh for the pattern it's just adding the previous two terms.

Cheezzydude 08/19/09 + PM | QUOTE | PERMALINK | REPORT

3) 1:1, 1:2, 2:3, 3:5, 5:8, 8:13 Hmm, I don't see any conjecture here o.o And btw, #2 is 34 You just have to add together one term and the term after it, to get the term after that. 1+1=2, 1+2=3, 2+3=5, 3+5=8...

conradskill 08/19/09 + PM | QUOTE | PERMALINK | REPORT

LetsRiot : Yeah I got the second one, thanks. Also can anyone explain, "List the first eight terms of the sequence formed by finding the differences of successive terms in the fibonacci sequence." thats easy too 1 1 2 3 5 8 13 21 0, 1, 1, 2, 3, 5, 8 etc ;)

FlamingPage 08/19/09 + PM | QUOTE | PERMALINK | REPORT

I had up to 20k in the Fibonacci sequence on the front of one of my notebooks O.o, and it is not geometry. And for the first one, draw a tree diagram(woit drawing) to figure out how many handshakes there are and notice any patterns, then make an equation out of that. Im here to help not give answers >.>

WetFish Aug 19 2009 + PM | QUOTE | PERMALINK | REPORT

The hand shake problem is a problem with limits, since new handshakes are only possible up until a certain point. If I do it right, on a series of 7, the total number of hand shakes being fourteen. Limit of N -> 0, divided by 2. Given you add all the top values together.

Legiter 08/19/09 + PM | QUOTE | PERMALINK | REPORT

Fibonacci answer is 34. I know this off the top of my head. The number of the sequence is the sum of the previous two terms. The first two terms will always be 0 and 1.