xyp 发表于 2013-1-29 06:54:17

The highest prize and any rule?

<br /="/"/><div><p style="TEXT-INDENT: -0.25in; MARGIN: 0in 0in 10pt 0.5in; mso-list: l0 level1 lfo1"><font size="3"><font face="Calibri">Suppose a country only issued two types of coins to be used as currency: one 7 unit coin and one 11 unit coin. This would cause a dilemma since certain prices could</font></font></p><p style="TEXT-INDENT: -0.25in; MARGIN: 0in 0in 10pt 0.5in; mso-list: l0 level1 lfo1"><font size="3"><font face="Calibri">not be paid exactly, such as 13 units. What would be the highest price that could not be paid with any combination of the two coins? Could you find any rule to follow?<sup> *</sup></font></font></p></div><span style="display:none;">www.ddhw.com</span><br /="/"/><br /="/"/> <div style="MARGIN-TOP:20px;MARGIN-LEFT:0;MARGIN-BOTTOM:0;float:left"></div>

findfun 发表于 2013-1-29 08:45:11

回复:The highest prize and any rule?

<table cellpadding="8" height="100%" width="100%"><tr><td valign="top"><br /="/"/>since 2*11-3*7=1, so if both sides have enough of each coins, you can pay any amount...<br /="/"/><div></div><br /="/"/><br /="/"/> <div style="MARGIN-TOP:20px;MARGIN-LEFT:0;MARGIN-BOTTOM:0;float:left"></div></td></tr></table>

fov22 发表于 2013-2-4 09:52:41

回复:The highest prize and any rule?

<table cellpadding="8" height="100%" width="100%"><tr><td valign="top"><br /="/"/><div>59</div><span style="display:none;">www.ddhw.com</span><br /="/"/><br /="/"/> <div style="MARGIN-TOP:20px;MARGIN-LEFT:0;MARGIN-BOTTOM:0;float:left"></div></td></tr></table>

xyp 发表于 2013-2-5 21:09:22

[>:D<]

<table cellpadding="8" height="100%" width="100%"><tr><td valign="top"><br /="/"/><img /="/" src="/img/17.gif"></img><div>怎么算出来的?有什么规律可循吗?</div><span style="display:none;">www.ddhw.com</span><br /="/"/><br /="/"/> <div style="MARGIN-TOP:20px;MARGIN-LEFT:0;MARGIN-BOTTOM:0;float:left"></div></td></tr></table>

冷眼看戏的Lili 发表于 2013-2-15 22:52:18

回复:The highest prize and any rule?

<table cellpadding="8" height="100%" width="100%"><tr><td valign="top"><br /="/"/><div>Let<em> a</em> and <em>b</em> be integers satisfying <em>a</em>>1 and <em>b</em>>1. Such a "highest prize" exists if and only if <em>a</em> and <em>b</em> are relatively prime. In this case, it is <em>ab-a-b</em>. For example, when <em>a</em>=11 and <em>b</em>=7, we get <em>ab-a-b=</em>59; when <em>a</em>=5 and <em>b</em>=9, we get <em>ab-a-b</em>=31.</div><br /="/"/><br /="/"/> <span style="display:none;">www.ddhw.com</span><br /="/"/><br /="/"/> <p><div align="right"><font color="#ff0000" style="BACKGROUND-COLOR: #c4dfff">  本贴由[<b>冷眼看戏的Lili</b>]最后编辑于:2013-2-15 22:28:57  </font></div><div style="MARGIN-TOP:20px;MARGIN-LEFT:0;MARGIN-BOTTOM:0;float:left"></div></p></td></tr></table>
页: [1]
查看完整版本: The highest prize and any rule?