Log In

Coin Problem

Posted on: February 8th, 2014 by
1

Suppose you have an infinite stock of $a bills and $b bills such that g.c.d(a,b)=1. Find the largest amount of money (integer) that cannot be represented using $a and $b denominations.

- via Wolfram Mathematica


One Response to Coin Problem

  1. Sid Hollander had this to say about that:

    ab - (a+b)

Add Your Comment, Feedback or Opinion Here

Your email is safe here. It will not be published or shared. Required fields are marked *

You may use these HTML tags and attributes:

<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

*


{"result":"error", "message":"You can't access this resource as it requires an 'view' access for the website id = 1."}