Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-04T19:06:48.206Z Has data issue: false hasContentIssue false

Why avoid induction?

Published online by Cambridge University Press:  10 July 2015

John Baylis*
Affiliation:
Yr Ystablau, Wiston, Haverfordwest SA62 4PN

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Matters for Debate
Copyright
Copyright © Mathematical Association 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Koshy, T., Graph-theoretic models for the Fibonacci family, Math. Gaz. 98 (July 2014) pp. 256265.Google Scholar
2.Cushman, David A., Drone parent numbers (2004), available at www.dave-cushman.net/bee/fibonacci.htmlGoogle Scholar
3.Narasimhamurthy, A. M., The steps problem and the Fibonacci sequence, Applied Probability Trust (2000), available at ms.appliedprobability.mg/data/files/Articles%2033/33–1-5.pdfGoogle Scholar
4.Rajagopal, Surajit and Griffiths, Martin, On Fibonacci numbers that are factorials, Math. Gaz. 98 (March 2014) pp 104107.Google Scholar
5.Andrews, George E., Combinatorics: ancient and modern (Wilson, Robin and Watkins, John J., eds) Oxford University Press (2013) p. 223.Google Scholar
6.Griffiths, Martin, Further thoughts on ordered partitions, Math. Gaz. 96 (March 2012) pp. 152153.Google Scholar
7.Griffiths, Martin, Yet another coin-tossing scenario, Math. Gaz. 96 (November 2012) pp. 543546.Google Scholar
8.Rajesh, V. and Leversha, Gerry, Some properties of the odd terms of the Fibonacci sequence, Math. Gaz. 88 (March 2004) pp. 8586.Google Scholar