A lower bound for length of addition chains

In this paper we show that the shortest length (n) of addition chains producing numbers of the form 2n−1 satisfies the lower boundι(2n−1)≥n+blog(n−1)log 2cwhereb·cdenotes the floor function

Content

Author and article information

Journal

Title: AfricArXiv Preprints

Publisher: ScienceOpen

Publication date (Electronic preprint): 3 August 2022

Affiliations

[1 ] African Institute for Mathematical sciences

Author notes

[* ]Email: theophilus@ 123456aims.edu.gh .

Author information

Theophilus Agama https://orcid.org/0000-0001-7790-9368

Article

DOI: 10.14293/111.000/000042.v1

SO-VID: 8a244a60-39d8-4ae7-8146-e1c50d5ece3c

License:

This work has been published open access under Creative Commons Attribution License CC BY 4.0 , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Conditions, terms of use and publishing policy can be found at www.scienceopen.com .

History

Date received : 3 August 2022

Data availability: Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

ScienceOpen disciplines: Mathematics

Keywords: degree