Number Theory

    

A Heuristics on Primes in an Addition Chain

Authors: Theophilus Agama

Let E(n): 1 = s_0 smaller than s_1 = 2 smaller than u2026 smaller than s_h = n, with h on the order of n to the power 1 minus epsilon (for some small positive epsilon), be an addition chain leading to n. We develop a heuristic for the least number of primes in an addition chain for all sufficiently large targets n.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2025-09-30 23:19:34

Unique-IP document downloads: 170 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus