| Hosted by CoCalc | Download
Kernel: Python 3 (system-wide)
def buttons(n): if n<=0: return 0 elif n==7 or n==11: return 1 else: return max(buttons(n-7),buttons(n-11)) for i in range(1,100): print(i,buttons(i)) if buttons(i)==0: x=i print('\n') print("Largest number of buttons that cannot be purchased with packages of 7 and 11: ", x)
1 0 2 0 3 0 4 0 5 0 6 0 7 1 8 0 9 0 10 0 11 1 12 0 13 0 14 1 15 0 16 0 17 0 18 1 19 0 20 0 21 1 22 1 23 0 24 0 25 1 26 0 27 0 28 1 29 1 30 0 31 0 32 1 33 1 34 0 35 1 36 1 37 0 38 0 39 1 40 1 41 0 42 1 43 1 44 1 45 0 46 1 47 1 48 0 49 1 50 1 51 1 52 0 53 1 54 1 55 1 56 1 57 1 58 1 59 0 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 69 1 70 1 71 1 72 1 73 1 74 1 75 1 76 1 77 1 78 1 79 1 80 1 81 1 82 1 83 1 84 1 85 1 86 1 87 1 88 1 89 1 90 1 91 1 92 1 93 1 94 1 95 1 96 1 97 1 98 1 99 1 Largest number of buttons that cannot be purchased with packages of 7 and 11: 59