You're viewing a comment by david and its responses.

January 15, 2010, 22:12

@Nathan, i was thinking the same thing. I would start with the list of all Fibonacci numbers less than x (your number to convert). say F(n) is the largest of these. Now add smaller numbers to F(n) starting with F(n-1). If your total ever goes above x, then remove the last number you added and decrement n. stop when your sum equals x. The numbers you've added are the factors.

Reply To This Comment

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

Type the word "computer_181": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.