Democratic Underground Latest Greatest Lobby Journals Search Options Help Login
Google

I am only 9 posts from 5589, a number that when split into 2 digit numbers

Printer-friendly format Printer-friendly format
Printer-friendly format Email this thread to a friend
Printer-friendly format Bookmark this thread		 This topic is archived.
Home » Discuss » The DU Lounge Donate to DU
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:09 PM
Original message
I am only 9 posts from 5589, a number that when split into 2 digit numbers
gives two sequential fibonacci numbers, 55 and 89.

Ask me anything, but please nothing too hard.
Printer Friendly | Permalink |  | Top
Gormy Cuss Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:11 PM
Response to Original message
1. Best copycat in a very long Fibonacci series. n/t.
Printer Friendly | Permalink |  | Top
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:13 PM
Response to Reply #1
3. You're supposed to ask me something. Nothing too hard though.
Printer Friendly | Permalink |  | Top
 
Gormy Cuss Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:14 PM
Response to Reply #3
4. OK.
Answer ERR's question.
;-)
Printer Friendly | Permalink |  | Top
 
Err Donating Member (887 posts) Send PM | Profile | Ignore Wed Nov-30-05 09:12 PM
Response to Original message
2. What the hell are fibonacci numbers?
:shrug:
Printer Friendly | Permalink |  | Top
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:17 PM
Response to Reply #2
6. The are a sequence of numbers in which the ratio of (n+1)/n converges
to the golden ratio as n approaches infinity.
Printer Friendly | Permalink |  | Top
 
Err Donating Member (887 posts) Send PM | Profile | Ignore Wed Nov-30-05 09:17 PM
Response to Reply #6
7. Sorry I asked.
:)

:wtf:
Printer Friendly | Permalink |  | Top
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:24 PM
Response to Reply #7
10. Don't worry, I stated it badly.
I should have said that the ratio of the (n+1)th to the nth number in the series converges to the golden ratio.

I can understand your confusion.

The golden ratio is said to have bearing the structure of the woman gratuitiously posted in post #9 by a gratuitous poster here at DU:

http://www.democraticunderground.com/discuss/duboard.php?az=view_all&address=105x4371261
Printer Friendly | Permalink |  | Top
 
Err Donating Member (887 posts) Send PM | Profile | Ignore Wed Nov-30-05 09:26 PM
Response to Reply #10
12. LOL
My confusion lies within all of mathematics, not on your explanation of fibonacci numbers.
Printer Friendly | Permalink |  | Top
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:36 PM
Response to Reply #12
13. That's sad. I'll bet you have a fibonacci/golden ratio face too.
http://goldennumber.net/face.htm

You should not give up on math, especially if you want to know why you are so good looking.
Printer Friendly | Permalink |  | Top
 
Err Donating Member (887 posts) Send PM | Profile | Ignore Wed Nov-30-05 09:40 PM
Response to Reply #13
14. I think I'll stay away from math.
I already know why I'm so pretty anyways. :)
Printer Friendly | Permalink |  | Top
 
SofaKingLiberal Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:16 PM
Response to Original message
5. Why?
Printer Friendly | Permalink |  | Top
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:18 PM
Response to Reply #5
8. Because I'm anxious to have a number of posts that can be decomposed
into two sequential fibbonacci numbers.
Printer Friendly | Permalink |  | Top
 
SofaKingLiberal Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:18 PM
Response to Reply #8
9. Why?
Printer Friendly | Permalink |  | Top
 
NNadir Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:25 PM
Response to Reply #9
11. Because it is higher than the number of posts I have now.
Printer Friendly | Permalink |  | Top
 
KitchenWitch Donating Member (1000+ posts) Send PM | Profile | Ignore Wed Nov-30-05 09:44 PM
Response to Original message
15. If you are talking about fibonacci numbers, there are few questions
that are too hard!

:hi:
Printer Friendly | Permalink |  | Top
 
aePrime Donating Member (676 posts) Send PM | Profile | Ignore Wed Nov-30-05 11:04 PM
Response to Original message
16. I taught recursion today
and gave my students recursive C++ code to generate the nth Fibonacci number.

Can you write a recursive function to generate the nth Fibonacci number?

(The easy way to write it is very inefficient, but it's what I gave to my students anyway, because it's a good introduction to recursion).
Printer Friendly | Permalink |  | Top
 
DU AdBot (1000+ posts) Click to send private message to this author Click to view this author's profile Click to add this author to your buddy list Click to add this author to your Ignore list Tue May 07th 2024, 11:57 AM
Response to Original message
Advertisements [?]
 Top

Home » Discuss » The DU Lounge Donate to DU

Powered by DCForum+ Version 1.1 Copyright 1997-2002 DCScripts.com
Software has been extensively modified by the DU administrators

Important Notices: By participating on this discussion board, visitors agree to abide by the rules outlined on our Rules page. Messages posted on the Democratic Underground Discussion Forums are the opinions of the individuals who post them, and do not necessarily represent the opinions of Democratic Underground, LLC.

Home  |  Discussion Forums  |  Journals |  Store  |  Donate

About DU  |  Contact Us  |  Privacy Policy

Got a message for Democratic Underground? Click here to send us a message.

© 2001 - 2011 Democratic Underground, LLC