Lucas chain

A Lucas chain $a$ is an addition chain with the additional requirement that not only each term be the sum of two previous (not necessarily distinct) terms, but also that the difference of those two terms also be a term in the sequence. That is, each $a_{i}=a_{m}+a_{n}$ and also $|a_{n}-a_{m}|=a_{j}$ , with $j$ being some nonnegative integer.

For example, the Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, etc.) is a Lucas chain because not only is each term the sum of the previous two terms, each term is the difference of the next two terms. On the other hand, 1, 2, 4, 8, 9, 13, 21, 30, etc., is an addition chain but not a Lucas chain, since 8 + 13 = 21, but $13-8=5$ , which is not a member of the chain.

单词	LucasChain
释义	Lucas chain A Lucas chain $a$ is an addition chain with the additional requirement that not only each term be the sum of two previous (not necessarily distinct) terms, but also that the difference of those two terms also be a term in the sequence. That is, each $a_{i}=a_{m}+a_{n}$ and also $\|a_{n}-a_{m}\|=a_{j}$ , with $j$ being some nonnegative integer. For example, the Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, etc.) is a Lucas chain because not only is each term the sum of the previous two terms, each term is the difference of the next two terms. On the other hand, 1, 2, 4, 8, 9, 13, 21, 30, etc., is an addition chain but not a Lucas chain, since 8 + 13 = 21, but $13-8=5$ , which is not a member of the chain.
随便看	transpose TransposeOperator transpose operator Transposition transposition Transversality transversality TransversalsLiftsSifts transversals / lifts / sifts Trapezoid trapezoid TrapezoidalRule trapezoidal rule TravelingHumpSequence traveling hump sequence Tree tree TreesetTheoretic tree (set theoretic) TreeTraversals tree traversals Triacontahedron triacontahedron TriadicRelation triadic relation