Lower Bounds for Lucas Chains

DOI10.1137/S0097539700379255MaRDI QIDQ4785626zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Martin Kuetz

Publication date 5 January 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539700379255

zbMATH Keywords

lower boundgolden ratioFibonacci numberaddition chainsmooth numberLucas functionLucas chain

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Calculation of integer sequences (11Y55)

Recommendations

• A generalization of the Lucas addition chains
• Computing Lucas functions using addition chains.
• A method for computing Lucas sequences
• Remarks on number theory III. On addition chains
• Calculating optimal addition chains

Cited in

(2)

• Computing Lucas functions using addition chains.
• Internal structure of addition chains: well-ordering

This page was built for publication: Lower Bounds for Lucas Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785626)