2000 character limit reached
Efficient Algorithms for Zeckendorf Arithmetic
Published 18 Jul 2012 in cs.DS and math.CO | (1207.4497v1)
Abstract: We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size and logarithmic depth. The implications of these results for multiplication, division and square-root extraction are also discussed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
