๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On the two conjectures of Graffiti
โœ Xiao-Dong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 201 KB
Two conjectures on the arithmetic in โ„ a
โœ Apoloniusz Tyszka ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 163 KB

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| โ‰ค

On the Sendov Conjecture for Polynomials
โœ Iulius Borcea ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

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