Volume 8 |
Number 1 |
February 1970 |
Sidney Kravitz
The Lucas-Lehmer Test for Mersenne Numbers
| 1 |
    
Full text
Joseph Arkin and Richard Pollack
Recurrence Formulas
| 4 |
    
Full text
W. C. Lynch
The t-Fibonacci Numbers and Polyphase Sorting
| 6 |
    
Full text
D. E. Daykin and L. A. G. Dresel
Factorization of Fibonacci Numbers
| 23 |
    
Full text [Part 1]
[Part 2]
Hyman Gabai
Generalized Fibonacci k-Sequences
| 31 |
    
Full text
R. J. Weinshenk and V. E. Hoggatt, Jr.
On Solving Cn+2 = Cn+1 + Cn + nm by Expansions and Operators
| 39 |
    
Full text [Part 1]
[Part 2]
Edward A. Parberry
On Primes and Pseudo-Primes Related to the Fibonacci Sequence
| 49 |
    
Full text
L. Carlitz and H. H. Ferns
Some Fibonacci and Lucas Identities
| 61 |
    
Full text
Edited by Raymond E. Whitney
Advanced Problems and Solutions
| 74 |
    
Full text
Rodney T. Hansen
Arithmetic of Pentagonal Numbers
| 83 |
    
Full text
    
Full text [Part 1]
[Part 2]
    
Full text
Jean H. Anderson
Spirals, Checkerboards, Polyominoes, and the Fibonacci Sequence
| 90 |
    
Full text
Brother Alfred Brousseau
Linear Recursion Relations -- Lesson Seven Analyzing Linear Recursion Relations
| 96 |
    
Full text [Part 1]
[Part 2]
V. C. Harris
An Algorithm for Finding the Greatest Common Divisor
| 102 |
    
Full text
V. C. Harris
Note on the Number of Divisions Required in Finding the Greatest Common Divisor
| 104 |
    
Full text
Edited by A. P. Hillman
Elementary Problems and Solutions
| 105 |
    
Full text
|