Skip to content
Surf Wiki
Save to docs
general/integer-sequences

From Surf Wiki (app.surf) — the open knowledge base

Lucas chain

Restricted type of addition chain


Restricted type of addition chain

In mathematics, a Lucas chain is a restricted type of addition chain, named for the French mathematician Édouard Lucas. It is a sequence :a_0, a_1, a_2, a_3, \ldots that satisfies , and, for each k 0, : a_k = a_i + a_j, and either : a_i = a_j \text{ or } \vert a_i - a_j \vert = a_m for some {{math|1=i, j, m

The sequence of powers of 2 (1, 2, 4, 8, 16, ...) and the Fibonacci sequence (with a slight adjustment of the starting point 1, 2, 3, 5, 8, ...) are simple examples of Lucas chains.

Lucas chains were introduced by Peter Montgomery in 1983. If is the length of the shortest Lucas chain for n, then Kutz has shown that most n do not have , where φ is the Golden ratio.

References

References

  1. Guy (2004) p.169
  2. Weisstein, Eric W.. "Lucas Chain".
  3. Kutz (2002)
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Lucas chain — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report