Gregory P. Dresden | Searcharxiv

arXiv2011

A simplified Binet formula for k-generalized Fibonacci numbers

We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula to generate the desired sequence. These results were also found (independently) at about the same time by Zhaohui Du of Singapore, China. We are working on a joint paper.

math.NT↗

arXiv2009

A New Approach to Rational Values of Trigonometric Functions

It is well known that sin(aπ/b), cos(aπ/b), etc., are only rational numbers for a few select integers a and b. We show that this is equivalent to the fact that only for d = 1,2,3,4, and 6 is the primitive dth root of unity of degree 2 over Q.

math.HO↗