The Powers That Be (Q4132587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3559644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Powers That Be |
scientific article; zbMATH DE number 3559644 |
Statements
The Powers That Be (English)
0 references
1976
0 references
0.7325004935264587
0 references
0.731984555721283
0 references
Given a positive integer \(n\) and an integer \(a > 1\), the unique integer such that \(a_m\leq n< a^{m+1}\) is called the exponent of \(a\) for \(n\). For given \(n\), let \(E_n\) denote the set of (distinct) exponents for \(n\), when we allow \(a\) to assume all integers \(> 1\), and similarly let \(E_p(n)\) denote the set of exponents for \(n\) when we restrict \(a\) to only prime values. If \(m\) is an exponent for \(n\), let \(a_m\) and \(b_m\) denote the smallest and largest integer with \(m\) as exponent. Similarly let \(p_m\) and \(q_m\) denote the smallest and largest prime with exponent \(m\). A number of questions were raised by the authors regarding \(E_n\), \(E_p(n)\), \(a_m\), \(b_m\), \(p_m\), \(q_m\). Answers or partial answers to some of these questions were given.
0 references