Abstract

In 1996, Neville Robbins proved the amazing fact that the coefficient of XnX^n in the Fibonacci infinite product ∏n≥2(1−XFn)=(1−X)(1−X2)(1−X3)(1−X5)(1−X8)⋯=1−X−X2+X4+⋯ \prod_{n \geq 2} (1-X^{F_n}) = (1-X)(1-X^2)(1-X^3)(1-X^5)(1-X^8) \cdots = 1-X-X^2+X^4 + \cdots is always either −1-1, 00, or 11. The same result was proved later by Federico Ardila using a different method. Meanwhile, in 2001, Jean Berstel gave a simple 4-state transducer that converts an "illegal" Fibonacci representation into a "legal" one. We show how to obtain the Robbins-Ardila result from Berstel's with almost no work at all, using purely computational techniques that can be performed by existing software.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.