𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the powers of 3/2 and other rational numbers

✍ Scribed by Artūras Dubickas

Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
144 KB
Volume
281
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let__p__ > q > 1 be two coprime integers. In this paper, we prove several results about subsets of the interval [0, 1) which does or does not contain all the fractional parts {ξ (p /q)^n^ }, n = 0, 1, 2, …, for certain non‐zero real number ξ. We show, for instance, that there are no real ξ for which the union of two intervals [8/39, 18/39] ∪ [21/39, 31/39] contains the set {ξ (3/2)^n^ }, n ∈ N. The most important aspect of this result is that the total length of both intervals 20/39 is greater than 1/2: the same result as above for [0, 1/2) would imply that there are no Mahler's Z ‐numbers which the best known unsolved problem in this area. On the other hand, it is shown that there are infinitely many ξ for which {ξ (3/2)^n^ } ∈ (5/48, 43/48) for each integer n ≥ 0. We also give simpler proofs of few recent results in this area. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

Is Voltammetric Current Proportional to
Is Voltammetric Current Proportional to the Number of Transferred Electrons for Multi-Charged Ions or to 3/2 Power of the Number?
✍ Koichi Aoki 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract Particles with a large number of electrons to transfer, such as nanoparticles and colloidal redox particles, give voltammetrric currents that were demonstrated theoretically to be proportional directly to the number of the electrons, __n__, rather than to __n__^3/2^. The latter quantity

On the greatest number of 2 and 3 colori
On the greatest number of 2 and 3 colorings of a (v, e)-graph
✍ Felix Lazebnik 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 446 KB

Let 9 denote the family of simple undirected graphs on u vertices having e edges ( ( u , el-graphs) and P(A, G ) be the chromatic polynomial of a graph G. For the given integers u, e, A, let f b , e, A) denote the greatest number of proper colorings in A or less colors that a (u, e)-graph G can have

The crossing number of K1,3,n and K2,3,n
The crossing number of K1,3,n and K2,3,n
✍ Kouhei Asano 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

In this article, we will determine the crossing number of the complete tripartite graphs K,.3.n and K2,3.n. Our proof depends on Kleitman's results for the complete bipartite graphs [D. J. Kleitman, The crossing number of K5,n. J. Combhatorial Theory 9 (1970) 375-3231. a graph G is the minimum numbe

Note on the Synthesis of 1, 1-Dichloro-2
Note on the Synthesis of 1, 1-Dichloro-2, 3-divinylcyclopropane and Other Functionalized Dichlorocyclopropanes
✍ Paul Müller; Michel Rey 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 German ⚖ 374 KB

## Abstract The title compound **1** was synthesized __via__ addition of dichlorocarbene to dimethyl __trars__‐3‐hexenedioate (**5**), using __o__‐nitrophenylselenic acid‐elimination to form the double bonds. Reaction of dichlorocyclopropane **8** with ozone on silica gel furnished the monoketone *

Refined Lower Bounds on the 2-Class Numb
Refined Lower Bounds on the 2-Class Number of the Hilbert 2-Class Field of Imaginary Quadratic Number Fields with Elementary 2-Class Group of Rank 3
✍ Elliot Benjamin; Charles J. Parry 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Let k be an imaginary quadratic number field with C k, 2 , the 2-Sylow subgroup of its ideal class group, isomorphic to ZÂ2Z\_ZÂ2Z\_ZÂ2Z. By the use of various versions of the Kuroda class number formula, we improve significantly upon our previous lower bound for |C k 1 , 2 | , the 2-class number of