Two conjectures on the arithmetic in ℝ and ℂ
✍ Scribed by Apoloniusz Tyszka
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 163 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
We discuss two conjectures. (1) If a system S ⊆ En is consistent over R (C), then S has a real (complex) solution which consists of numbers whose absolute values belong to [0, 2 2 n-2
].
(2) If a system S ⊆ Wn is consistent over G, then S has a solution (x1, . . . , xn) ∈ (G ∩ Q) n in which |xj| ≤ 2 n-1 for each j.
📜 SIMILAR VOLUMES
Suppose among the given n coins there are two counterfeit coins, which are heavier (or lighter) than the normals. Denote by g,(n) the minimum number of weighings that suffice to search the two false coins by a balance. It is guessed that g&)=rlog,(;)l . This paper affirms the conjecture.
We present previously unpublished elementary proofs by Dekker and Ottens (1991) and Boyce (private communication) of a special case of the Dinitz conjecture. We prove a special case of a related basis conjecture by Rota, and give a reformulation of Rota's conjecture using the Nullstellensatz. Finall