Tee, Garry J.2009-08-282009-08-282002-03Department of Mathematics - Research Reports-481 (2002)1173-0889https://hdl.handle.net/2292/5147Edouard Zeckendorf shewed that every positive integer can be represented uniquely as a sum of distinct non-consecutive Fibonacci numbers, with $ F_2 $ (but not $ F_1 $) being used for 1. Arithmetic on integers represented in Zeckendorf form is more complicated than for integers represented in binary form. But, integer multiplication can readily be performed by adapting the Russian Peasant method, and integer division can readily be performed by adapting an Ancient Egyptian method.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmRussian Peasant Multiplication and Egyptian Division in Zeckendorf ArithmeticTechnical ReportFields of Research::230000 Mathematical Sciences::230100 MathematicsThe author(s)