Coin problem
id:
coin-problem-162-11037134
title:
Coin problem
text:
In mathematics, the coin problem is a mathematical problem that asks for the largest monetary amount that cannot be obtained using only coins of specified denominations. For example, the largest amount that cannot be obtained using only coins of 3 and 5 units is 7 units. The solution to this problem for a given set of coin denominations is called the Frobenius number of the set. The Frobenius number exists as long as the set of coin denominations is setwise coprime. There is an explicit formula
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical problem
original url:
https://en.wikipedia.org/wiki/Coin_problem
date created:
2005-07-25T01:19:19Z
date modified:
2024-08-28T03:11:01Z
main entity:
{"identifier":"Q2295746","url":"https://www.wikidata.org/entity/Q2295746"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/3c/Two_Pence_01.jpg","width":636,"height":636}
fields total:
13
integrity:
16