enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Coin problem - Wikipedia

    en.wikipedia.org/wiki/Coin_problem

    Frobenius coin problem with 2-pence and 5-pence coins visualised as graphs: Sloping lines denote graphs of 2x+5y=n where n is the total in pence, and x and y are the non-negative number of 2p and 5p coins, respectively. A point on a line gives a combination of 2p and 5p for its given total (green).

  3. Change-making problem - Wikipedia

    en.wikipedia.org/wiki/Change-making_problem

    The "optimal denomination problem" [6] is a problem for people who design entirely new currencies. It asks what denominations should be chosen for the coins in order to minimize the average cost of making change, that is, the average number of coins needed to make change.

  4. Coin rotation paradox - Wikipedia

    en.wikipedia.org/wiki/Coin_rotation_paradox

    The outer coin makes two rotations rolling once around the inner coin. The path of a single point on the edge of the moving coin is a cardioid.. The coin rotation paradox is the counter-intuitive math problem that, when one coin is rolled around the rim of another coin of equal size, the moving coin completes not one but two full rotations after going all the way around the stationary coin ...

  5. Balance puzzle - Wikipedia

    en.wikipedia.org/wiki/Balance_puzzle

    If coins 0 and 13 are deleted from these weighings they give one generic solution to the 12-coin problem. If two coins are counterfeit, this procedure, in general, does not pick either of these, but rather some authentic coin. For instance, if both coins 1 and 2 are counterfeit, either coin 4 or 5 is wrongly picked.

  6. Talk:Coin problem - Wikipedia

    en.wikipedia.org/wiki/Talk:Coin_problem

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us

  7. Coin flipping - Wikipedia

    en.wikipedia.org/wiki/Coin_flipping

    Tossing a coin. Coin flipping, coin tossing, or heads or tails is the practice of throwing a coin in the air and checking which side is showing when it lands, in order to randomly choose between two alternatives. It is a form of sortition which inherently has two possible outcomes. The party who calls the side that is facing up when the coin ...

  8. Sleeping Beauty problem - Wikipedia

    en.wikipedia.org/wiki/Sleeping_Beauty_problem

    The Sleeping Beauty problem, also known as the Sleeping Beauty paradox, [1] is a puzzle in decision theory in which an ideally rational epistemic agent is told she will be awoken from sleep either once or twice according to the toss of a coin.

  9. Coin-tossing problem - Wikipedia

    en.wikipedia.org/?title=Coin-tossing_problem&...

    Language links are at the top of the page across from the title.