<?xml version="1.0" encoding="UTF-8"?><oembed><type>video</type><version>1.0</version><html>&lt;iframe src=&quot;https://www.loom.com/embed/d24eda16e7694ad08f4a14e2d991b866&quot; frameborder=&quot;0&quot; width=&quot;1838&quot; height=&quot;1378&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>1378</height><width>1838</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>1378</thumbnail_height><thumbnail_width>1838</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/d24eda16e7694ad08f4a14e2d991b866-0e0c77ab68d2edba.gif</thumbnail_url><duration>4485.123</duration><title>9FM0 CP2 - Set 2 - Proof by Induction V2</title><description>I walk through several induction style proofs, starting with matrix powers using a base case, an assumption up to n equals k, then the induction step to k plus 1, ending with the full conclusion. I then use the determinant of M to the n to find n equals 5 and solve for a equals 1.5. Next I find for which a the matrix has an inverse by setting det not equal to 0, then compute the inverse. I finish with two divisibility inductions, including showing difference terms are multiples of 5, 17, and 15, and I give a series induction example.</description></oembed>