On the conjecture at two counterfeit coins
โ Scribed by Anping Li
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 284 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
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| โค
In this paper we prove that Sendov's conjecture is true for polynomials of degree ลฝ . n s 6 we even determine the so-called extremal polynomials in this case , as well as for polynomials with at most six different zeros. We then generalize this last ลฝ . ลฝ . result to polynomials of degree n with at