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. Postage stamp problem - Wikipedia

    en.wikipedia.org/wiki/Postage_stamp_problem

    The postage stamp problem (also called the Frobenius Coin Problem and the Chicken McNugget Theorem [1]) is a mathematical riddle that asks what is the smallest postage value which cannot be placed on an envelope, if the latter can hold only a limited number of stamps, and these may only have certain specified face values.

  4. Checking whether a coin is fair - Wikipedia

    en.wikipedia.org/wiki/Checking_whether_a_coin_is...

    The practical problem of checking whether a coin is fair might be considered as easily solved by performing a sufficiently large number of trials, but statistics and probability theory can provide guidance on two types of question; specifically those of how many trials to undertake and of the accuracy of an estimate of the probability of ...

  5. Sylvester's theorem - Wikipedia

    en.wikipedia.org/wiki/Sylvester's_theorem

    Sylvester's closed solution for the Frobenius coin problem when there are only two coins. Sylvester's triangle problem, a particular geometric representation of the sum of three vectors of equal length; The Weinstein–Aronszajn identity, stating that det(I + AB) = det(I + BA), for matrices A, B, is sometimes attributed to Sylvester.

  6. Change-making problem - Wikipedia

    en.wikipedia.org/wiki/Change-making_problem

    Coin values can be modeled by a set of n distinct positive integer values (whole numbers), arranged in increasing order as w 1 through w n.The problem is: given an amount W, also a positive integer, to find a set of non-negative (positive or zero) integers {x 1, x 2, ..., x n}, with each x j representing how often the coin with value w j is used, which minimize the total number of coins f(W)

  7. List of things named after Ferdinand Georg Frobenius

    en.wikipedia.org/wiki/List_of_things_named_after...

    Cauchy–Frobenius lemma; Frobenioid; Frobenius algebra; Frobenius category; Frobenius characteristic map; Frobenius coin problem. Frobenius number; Frobenius companion matrix; Frobenius covariant; Frobenius element; Frobenius endomorphism (also known as Frobenius morphism, Frobenius map) Frobenius determinant theorem; Frobenius formula ...

  8. File:Frobenius problem 2p 5p.svg - Wikipedia

    en.wikipedia.org/wiki/File:Frobenius_problem_2p...

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

  9. Talk:Coin problem - Wikipedia

    en.wikipedia.org/wiki/Talk:Coin_problem

    1.2 Postage stamp problem. 2 "McNugget Theorem"? 3 comments. 3 Frobenius numbers for special sets. 2 comments. 4 ...