| Volume 39 |
Number 3 |
June-July 2001 |
Jack Y. Lee
Some Basic Line-Sequential Properties of Polynomials Line-Sequences
| 194 |
Full text
Wayne L. McDaniel
On the Factorization of Lucas Numbers
| 206 |
Full text
Dragan Stevanović
In the Number of Maximal Independent Set of Vertices in Star-Like Ladders
| 211 |
Full text
Hong Hu, Zhi-Wei Sun, and Jian-Xin Liu
Reciprocal Sums of Second-Order Recurrent Sequences
| 214 |
Full text
Jukka Pihko
Remarks on the "Greedy Odd" Egyptian Fraction Algorithm
| 221 |
Full text
Zhenxiang Zhang
Using Lucas Sequences to Factor Large Integers Near Group Orders
| 228 |
Full text
Judit Nagy
Rational Points in Cantor Sets
| 238 |
Full text
M. N. Deshpande and Ezra Brown
Diophantine Triplets and the Pell Sequence
| 242 |
Full text
David A. Englund
An Algorithm for Determining R(N) from the Subscripts of the Zeckendorf Representation of N
| 250 |
Full text
H. G. Grundman
An Analysis of n-Riven Numbers
| 253 |
Full text
M. A. Nyblom
On the Representation of the Integers as a Difference of Nonconsecutive Triangular Numbers
| 256 |
Full text
R. S. Melham
Summation of Reciprocals Which Involve Products of Terms from Generalized Fibonacci Sequences--Part II
| 264 |
Full text
Thomas M. Richardson
The Filbert Matrix
| 268 |
Full text
John A. Ewell
Algorithmic Determination of the Enumerator for Sums of Three Triangular Numbers
| 276 |
Full text
Guodong Liu
Identities and Congruences Involving Higher-Order Euler-Bernoulli Numbers and Polynomials
| 279 |
Full text
Harunobu Momiyama
A New Recurrence Formula for Bernoulli Numbers
| 285 |
Full text
|
