|
|
| [20:05:53] |
kenbolton: |
https://gist.github.com/kenbolton/5710648 |
| [20:06:07] |
jczuy: |
joins |
| [20:16:30] |
kenbolton: |
Show that it is possible to buy exactly 50, 51, 52, 53, 54, and 55 McNuggets, by finding |
| [20:16:30] |
kenbolton: |
solutions to the Diophantine equation. You can solve this in your head, using paper and pencil, |
| [20:16:32] |
kenbolton: |
or writing a program. However you chose to solve this problem, list the combinations of 6, 9 |
| [20:16:33] |
kenbolton: |
and 20 packs of McNuggets you need to buy in order to get each of the exact amounts.Given that it is possible to buy sets of 50, 51, 52, 53, 54 or 55 McNuggets by combinations of 6, |
| [20:16:34] |
kenbolton: |
9 and 20 packs, show that it is possible to buy 56, 57,…, 65 McNuggets. In other words, show |
| [20:16:35] |
kenbolton: |
how, given solutions for 50-55, one can derive solutions for 56-65. |
| [20:17:39] |
kenbolton: |
leaves |
| [20:29:19] |
kenbolton: |
joins |
| [20:30:04] |
kenbolton: |
jczuy: range(50, 56) |
| [21:08:30] |
kenbolton: |
leaves |
| [21:08:52] |
jczuy: |
leaves |
| [21:13:05] |
thisgeek: |
leaves |
| [22:12:31] |
jczuy: |
joins |
| [22:35:15] |
thisgeek: |
joins |
| [23:03:07] |
thisgeek: |
leaves |
| [07:42:36] |
thisgeek: |
joins |
| [07:42:45] |
thisgeek: |
leaves |
| [09:05:19] |
thisgeek: |
joins |
| [09:17:17] |
kenbolton: |
joins |
| [09:17:32] |
kenbolton: |
last night's beahive session: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00-introduction-to-computer-science-and-programming-fall-2008/assignments/pset2.pdf |
| [12:01:44] |
thisgeek: |
leaves |
| [12:17:36] |
thisgeek: |
joins |
| [17:19:49] |
thisgeek: |
leaves |