Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-24T18:56:40.740Z Has data issue: false hasContentIssue false
  • English
  • Français

101.44 On a trivariate Fibonacci identity

Published online by Cambridge University Press:  16 October 2017

Martin Griffiths
Martin Griffiths*
Affiliation:
Dept. of Mathematical Sciences, University of Essex, Colchester CO4 3SQ
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Information
The Mathematical Gazette , Volume 101 , Issue 552 , November 2017 , pp. 519 - 522
Copyright
Copyright © Mathematical Association 2017 

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. Brown, J. L., Solution to Problem H-4, Fibonacci Quarterly 1(3) (1963) pp. 47–48.Google Scholar
2. Johnson, R. C., Fibonacci numbers and matrices (2009). http://www.maths.dur.ac.uk/~dma0rcj/PED/fib.pdf Google Scholar
3. Knott, R., Fibonacci and golden ratio formulae (2016). http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormulae.html Google Scholar
4. Ruggles, I. D., Problem H-4, Fibonacci Quarterly 1(1) (1963) p. 47.Google Scholar
5. Burton, D., Elementary number theory, McGraw-Hill (1998).Google Scholar
6. Cameron, P. J., Combinatorics: topics, techniques, algorithms, Cambridge University Press (1994).Google Scholar
7. Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers, Oxford University Press (2008).Google Scholar
8. Knuth, D. E., The art of computer programming, Volume 1, Addison-Wesley (1968).Google Scholar
9. Benjamin, A. T. and Quinn, J. J., Proofs that really count: the art of combinatorial proof, The Mathematical Association of America (2003).Google Scholar