Skip to content

Commit d0a6481

Browse files
committed
latex differences
1 parent 490082c commit d0a6481

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

aml_chapter2_exercises.ipynb

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -122,8 +122,8 @@
122122
"<br>\n",
123123
"<br> We show that $\\sum^D_{i=0} {N\\choose i} \\leq N^D +1 \\Leftrightarrow \\sum^D_{i=1} {N\\choose i} \\leq N^D $ by induction.\n",
124124
"<br> It's easy to see that it's true for $D=1$ and $N=1$ etc., so assume it works for $D$. Then we have \n",
125-
"<br> $\\sum^{D+1}_{i=1} {N\\choose i} = \\sum^{D}_{i=1} {N\\choose i} + {N\\choose D+1} \\leq N^D + {N\\choose D+1}$ i.e. we want $N^D + {N\\choose D+1} \\leq N^{D+1} \\Leftrightarrow {N\\choose D+1} \\leq N^{D+1} - N^D$ \n",
126-
"<br> $\\Leftrightarrow {N\\choose D+1} \\leq \\frac{N^{D+1}}{(D+1)!} \\leq N^{D+1}(1-\\frac{1}{N})$ \n",
125+
"<br> $\\sum^{D+1}_{i=1} {N\\choose i} = \\sum^{D}_{i=1} {N\\choose i} + {N\\choose {D+1}} \\leq N^D + {N\\choose {D+1}}$ i.e. we want $N^D + {N\\choose {D+1}} \\leq N^{D+1} \\Leftrightarrow {N\\choose {D+1}} \\leq N^{D+1} - N^D$ \n",
126+
"<br> $\\Leftrightarrow {N\\choose {D+1}} \\leq \\frac{N^{D+1}}{(D+1)!} \\leq N^{D+1}(1-\\frac{1}{N})$ \n",
127127
"<br> Assume that $N\\geq2$ and $D\\geq1$ and then observe that $\\frac{1}{(D+1)!} \\leq \\frac{1}{2} \\leq (1-\\frac{1}{N}) < 1$ thus the inequality holds and the last step of the induction holds.\n"
128128
]
129129
},

0 commit comments

Comments
 (0)