Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T10:35:57.858Z Has data issue: false hasContentIssue false

A Lower Bound for the Scholz-Brauer Problem

Published online by Cambridge University Press:  20 November 2018

Kenneth B. Stolarsky*
Affiliation:
The Institute for Advanced Study, Princeton, New Jersey
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In (6)Scholz asked if the inequality

1.1

held for all positive integers q, where l(n)is the number of multiplications required to raise xto the nth power (a precise definition of l(n)in terms of addition chains is given in § 2). Soon afterwards, Brauer (2) showed, among other things, that l(n) ∼(log n)/(log2). This suggests the problem of Calculating

1.2

It can be deduced from (2) that θ≦ 1. If θ <1, (1.1) follows immediately for infinitely many q.My main result,Theorem 5 of § 4, merely shows that θ is slightly larger than ⅓.Actually, I know of no case where (1.1) is not in fact an equality; a tedious calculation verifies this for 1 ≦ q≦ 8.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1969