Search found 2 matches
- Sun Mar 13, 2016 9:05 am
- Forum: Volume 102 (10200-10299)
- Topic: 10236 - The Fibonacci Primes
- Replies: 28
- Views: 16240
Re: 10236 - The Fibonacci Primes
prove : <<the art of computer programming>> by Donald E.Knuth chapter 1.2.8 Theorem A
- Sun Mar 08, 2015 11:00 am
- Forum: Volume 5 (500-599)
- Topic: 519 - Puzzle (II)
- Replies: 2
- Views: 3086
Re: 519 - Puzzle (II)
The problem says "She has started with a small one containing 15 pieces", so threre are two cases: 1:n==3 m == 5; 2:n == 5, m== 3; but it is not.Am I wrong?