相关论文: Some Results on the Counterfeit Coins Problem II

In this paper, we will present some results on the counterfeit coins problem in the case of multi-sets.

This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and…

In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case that the number of false coins is unknown in advance.

In this paper, we will give an improvement on the lower bound for the counterfeit coins problem in the case that the number of false coins is unknown in advance

We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute…

In 2007, a new variety of the well-known problem of identifying a counterfeit coin using a balance scale was introduced in the sixth International Kolmogorov Math Tournament. This paper offers a comprehensive overview of this new problem by…

We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists,…

The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only ``balanced'' or ``tilted'' information and that we know the number k of false…

We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.

We discuss games involving a counterfeit coin. Given one counterfeit coin among a number of otherwise identical coins, two players with full knowledge of the fake coin take turns weighing coins on a two-pan scale, under the condition that…

In this paper, we investigate the monotone property of the continued fractions $G(m,\lambda)$ as a function of $m$ and $\lambda$. In particular, we obtain new inequality for the relative continued fractions.

This paper is a continuation of our recent work in [9].

In this paper we give the first proof that, under reasonable assumptions, a problem related to counterfeiting quantum money from knots [Farhi et al. 2010] is hard. Along the way, we introduce the concept of a component mixer, define three…

I introduce, solve and generalize a new coin puzzle that involves parallel weighings.

Several conjectural continued fractions found with the help of various algorithms are published in this paper.

We present an analysis of Wiesner's quantum money scheme, as well as some natural generalizations of it, based on semidefinite programming. For Wiesner's original scheme, it is determined that the optimal probability for a counterfeiter to…

In this article, I present a theorem determining a criterion for divisibility of two generalized Mersenne numbers, which are repunits of the same length in base-$a^m$ and base-$a^k$. In addition to the general proof, I present an…

We generalize the problem of coin flipping to more than two outcomes and parties. We term this problem dice rolling, and study both its weak and strong variants. We prove by construction that in quantum settings (i) weak N-sided dice…

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

Let $m,r\in\mathbb{Z}$ and $\omega\in\mathbb{R}$ satisfy $0\leqslant r\leqslant m$ and $\omega\geqslant1$. Our main result is a generalized continued fraction for an expression involving the partial binomial sum $s_m(r) =…