Talk:Sailors, coconuts and a monkey problem: Difference between revisions
Talk:Sailors, coconuts and a monkey problem (view source)
Revision as of 14:53, 13 May 2015
, 9 years ago→Analysis
m (→Analysis) |
m (→Analysis) |
||
Line 117:
60 12
</pre>
::It is impossible to have 4 dishonest sailors unless at least 3 sailors are dishonest. So I suggest the case for 4 dishonest sailors is a proper subset of the set of solutions for 3 dishonest sailors which I shall represent as 60+g*320. I try each of these values against my verification procedure which returns false until g=
<pre>
2496 499
| |||