Tag Archives: Steven Miller

Steven Miller’s Multivariable Calculus Spring 2021

Posted on March 8, 2021 by Sumant Sumant

Lecture 5 He started with an interesting problem of an n by n matrix whose entries were from 1 to and you notice the patter that determinant is always zero as the second row can be expressed as the linear … Continue reading →

Tagged | Leave a comment

The Rickety Bridge Problem by Steven Miller

Posted on September 28, 2020 by Sumant Sumant

Dr. Miller calls it We’ll Cross That Bridge Problem We have a rickety old bridge, it’s nighttime and dark but we have one flashlight, and we are being chased by zombies. They are 17.5 minutes from us. Only two people … Continue reading →

Posted in Algebra, Famous Problem | Tagged , , | Leave a comment

Sum of Squares of Fibonacci Numbers

Posted on August 13, 2020 by Sumant Sumant

This was an interesting way to introduce Fibonacci number by letting students build  rectangles with blocks of squares and in the process discovering that those blocks need to be Fibonacci numbers. What I really liked about this video is the … Continue reading →

Posted in Algebra, Famous Problem, Proof, Series | Tagged , , | Leave a comment

Steven Miller’s AM GM Proof

Posted on December 14, 2019 by Sumant Sumant
Posted in Inequalities, Mathematical Induction, Number Theory, Proof, Real Analysis, Trick | Tagged | Leave a comment

The Cookie Problem

Posted on January 6, 2019 by Sumant Sumant

In how many ways can one divide  cookies among people. Assuming all the cookies are the same and a person can get cookies. Note this problem is same as the problem of finding the solution of

Posted in Combinatorics | Tagged | Leave a comment

Math 331: Lecture 7 Generating Functions

Posted on January 3, 2019 by Sumant Sumant
Posted in Combinatorics, Differential Equations, Number Theory, Proof | Tagged | Leave a comment

Hopping Induction for AM GM

Posted on January 2, 2019 by Sumant Sumant
Posted in Inequalities, Mathematical Induction, Proof | Tagged | Leave a comment

Math 331: Lecture 6 AM GM Example

Posted on January 2, 2019 by Sumant Sumant
Posted in Inequalities | Tagged | Leave a comment

Math 331: Lecture 5 AM GM Games

Posted on January 2, 2019 by Sumant Sumant

Hopping Induction to prove AM-GM Inequality: Card Game: On each card there are 8 countries and if we choose any two cards there is a guaranteed match of exactly 1 country. If there is one country on each card we … Continue reading →

Posted in Algebra, Inequalities, Multivariable Calculus, Proof, Set Theory | Tagged | Leave a comment

Math 331: Lecture 4 Recurrence Relation, AM GM Inequality

Posted on December 25, 2018 by Sumant Sumant

In this lecture Steven talks about

Posted in Algebra, Combinatorics | Tagged , | Leave a comment