When.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. 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.

  4. Change-making problem - Wikipedia

    en.wikipedia.org/wiki/Change-making_problem

    The following is a dynamic programming implementation (with Python 3) which uses a matrix to keep track of the optimal solutions to sub-problems, and returns the minimum number of coins, or "Infinity" if there is no way to make change with the coins given. A second matrix may be used to obtain the set of coins for the optimal solution.

  5. 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 ...

  6. Collecting Problems: U.S. Mint Faces a Coin Cost Dilemma

    www.aol.com/news/2010-05-11-collecting-problems...

    For premium support please call: 800-290-4726 more ways to reach us

  7. Pirate game - Wikipedia

    en.wikipedia.org/wiki/Pirate_game

    With this knowledge, A can count on C and E's support for the following allocation, which is the final solution: A: 98 coins; B: 0 coins; C: 1 coin; D: 0 coins; E: 1 coin [2] (Note: A:98, B:0, C:0, D:1, E:1 or other variants are not good enough, as D would rather throw A overboard to get the same amount of gold from B.)

  8. Coins in a fountain - Wikipedia

    en.wikipedia.org/wiki/Coins_in_a_fountain

    Coins in a fountain is a problem in combinatorial mathematics that involves a generating function.In this problem, a fountain is an arrangement of non-overlapping unit circles into horizontal rows in the plane so that consecutive circles in the bottom row are tangent to each other, and such that each circle in a higher row is tangent to two coins from the next row below it.

  9. AOL Mail

    mail.aol.com

    You can find instant answers on our AOL Mail help page. Should you need additional assistance we have experts available around the clock at 800-730-2563. Should you need additional assistance we have experts available around the clock at 800-730-2563.