Considered is the set-up of availability of n coins and the possibility of at the most one of these coins being counterfiet in the sense of possessing slightly more or slightly less weight than that of the rest, though all the coins have remarkably identical appearance ! There has been considerable interest in the underlying combinatorial problem of checking the existence of such a coin and ide...

In this paper, given a balance scale and the information that there are exactly two different defective coins present, the authors consider the problem of ascertaining the minimum number of testing which suffice to determine the two different defective coins in a set of k coins in same appearance, and here k P 3. A testing algorithm for all the possible values of k is constructed, and the testi...

God does not play dice. He flips coins instead.” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kita...

We begin by examining balanced vs. unbalanced coins, where the coins stand for statistical assumptions. Assume we have two coins, a balanced coin r with distribution r0 = 1 2 and r1 = 1 2 , and an unbalanced coin p with distribution p1 = 1 2 + and p0 = 1 2 − . This scenario is equivalent to the inspection of a given assumption, trying to figure out whether it is random or better than random. We...

We describe the application of synchrotron X-ray diffraction and neutron micro-tomography to three ancient bronze coins from the Mediterranean coast of Israel. Key questions are whether neutron tomography can contribute to the reading of features on corroded coins by allowing the corrosion crust to be stripped away in cyber-space using surface and volume rendering techniques, and to what extent...

There is a table with four coins in the positions north, east, south and west, and the player’s goal is to get them all in the same orientation, i.e. all heads or all tails. The player never sees the coins but will be informed as soon as he has reached his goal. A move consists of the player mentioning one or more positions in which the coins will then be turned over; the complication is that, ...

We propose a non-divisible electronic cash system that combines the restrictive blind signature technique and a batch signature scheme based upon the binary tree structure. Contemporary electronic cash solutions rely on the divisibility paradigm to achieve significant computational savings, and such techniques are considered to be the most efficient. We demonstrate an alternative approach that ...

An off-line electronic cash scheme is proposed that is suitable for small payments. The approach is innovative, in that each coin may be efficiently verified by the same or different merchants during payment. The scheme relies on a batch signature technique to efficiently sign and verify individually spent coins; coins may also be deposited in batch manner. The scheme outlined differs considera...