ESP Biography



LANE GUNDERMAN, MIT sophomore with variety of academic interests.




Major: Physics/Chemistry/Math

College/Employer: MIT

Year of Graduation: 2017

Picture of Lane Gunderman

Brief Biographical Sketch:

I'm from Chicago, and the third of four children in my family. I am left-handed. Hope these random facts were interesting!



Past Classes

  (Clicking a class title will bring you to the course's section of the corresponding course catalog)

M11368: The Euclidean Algorithm in Spark 2017 (Mar. 11 - 12, 2017)
Have you ever wanted to find the greatest common divisor between two numbers? How about finding it quickly? How about really, really quickly? In this class, we aim to prove the Euclidean Algorithm for finding the greatest common divisor of two numbers!


Z11369: Introduction to Game Theory in Spark 2017 (Mar. 11 - 12, 2017)
Whenever you play a game you try to predict what the other players will do. In this class we will examine some very simple games and talk about the optimal strategy when playing with certain kind of players. The course will begin with playing a game, then talking about what expectations we have, then taking a more abstract approach to the question. We will finish by attempting to explain why people play in certain ways for games they know they'll play with that player again.


M11370: In(tro)duction to Induction in Spark 2017 (Mar. 11 - 12, 2017)
How can we ever be sure that something in math is true? We prove it! Mathematical induction is a powerful tool for PROVING hypothesized formulas for patterns. This class will convey the rudiments of inductive thinking, and give multiple examples of inductive methods of solving problems.


S11188: Introduction to Statistical Mechanics in Splash 2016 (Nov. 19 - 20, 2016)
Like statistics? Love mechanics? Well, this class isn't about either of those really, but its good if you like those things. This class will justify many of the more common chemistry formulas using very basic principles. It will not require too much science knowledge, but will require much math skills. This will be fun and a new way to look at simple science principles.


M11189: The Euclidean Algorithm in Splash 2016 (Nov. 19 - 20, 2016)
Have you ever wanted to find the greatest common divisor between two numbers? How about finding it quickly? How about really, really quickly? In this class, we aim to prove the Euclidean Algorithm for finding the greatest common divisor of two numbers!


S11190: Let's Do Some Modeling in Splash 2016 (Nov. 19 - 20, 2016)
When something is too complicated to be understood, a very effective tool for creating approximate answers is modeling. In this course we will introduce the idea of statistical modeling as well as how to model chemicals using computer programs. We will speak about the applications of modeling and motivation for creating effective models.


S11191: Introduction to Lagrangian Mechanics in Splash 2016 (Nov. 19 - 20, 2016)
All right, so you know how mechanical physics works. You can do all the problems: springs, gravitational fields, conservation of momentum, <fill in other things>. Now here's the challenge, what equations govern all these motions? F=ma. Sure. But why is F=ma? In this class we'll progress from the simple assumption that particles traverse action extremal paths in order derive some simple equations to describe general particle motion, then use these equations to derive at least one famous result.


Z10391: Introduction to Game Theory in Spark 2016 (Mar. 12 - 13, 2016)
Whenever you play a game you try to predict what the other players will do. In this class we will examine some very simple games and talk about the optimal strategy when playing with certain kind of players. The course will begin with playing a game, then talking about what expectations we have, then taking a more abstract approach to the question. We will finish by attempting to explain why people play in certain ways for games they know they'll play with that player again.


X10393: Avant Garde in Spark 2016 (Mar. 12 - 13, 2016)
“Art is what you can get away with.” --Andy Warhol This is not a class. This is an anti-class. In this not class, we'll discuss, observe, and perhaps even practice aspects of the avant garde art movement. Be prepared for the Aardvark Gourd.


S10171: Ising on the Cake in Splash 2015 (Nov. 21 - 22, 2015)
Like cake? How about two level quantum system theory? This class will discuss and play with the two level lattice quantum system model known as the Ising model. Perhaps you've heard of the Ising model as a description for magnetic systems, however, this is (as is provable) equivalent to a two level quantum system. In this class we'll talk about the 1 dimensional model, mean field approximation, and (time allowing) simulations of nonsquare, tessellated coordinate systems. There may be cake. Or perhaps the cake will be a lie.


S10172: Introduction to Lagrangian Mechanics in Splash 2015 (Nov. 21 - 22, 2015)
All right, so you know how mechanical physics works. You can do all the problems: springs, gravitational fields, conservation of momentum, <fill in other things>. Now here's the challenge, what equations govern all these motions? F=ma. Sure. But why is F=ma? In this class we'll progress from the simple assumption that particles traverse action extremal paths in order derive some simple equations to describe general particle motion, then use these equations to derive at least one famous result.


X10173: Teach you! in Splash 2015 (Nov. 21 - 22, 2015)
Ever have a teacher that was really awful? How about one that made you feel awe-full? What did they do differently? I've always been critical of my teachers, so let's get together and be critical together. Come to this class to discuss (and. in a meta fashion. practice) pedagogy!


M10174: In(tro)duction to Induction in Splash 2015 (Nov. 21 - 22, 2015)
How can we ever be sure that something in math is true? We prove it! Mathematical induction is a powerful tool for PROVING hypothesized formulas for patterns. This class will convey the rudiments of inductive thinking, and give multiple examples of inductive methods of solving problems.


S10175: Introduction to Statistical Mechanics in Splash 2015 (Nov. 21 - 22, 2015)
Like statistics? Love mechanics? Well, this class isn't about either of those really, but its good if you like those things. This class will justify many of the more common chemistry formulas using very basic principles. It will not require too much science knowledge, but will require much math skills. This will be fun and a new way to look at simple science principles.


M10176: The Euclidean Algorithm in Splash 2015 (Nov. 21 - 22, 2015)
Have you ever wanted to find the greatest common divisor between two numbers? How about finding it quickly? How about really, really quickly? In this class, we aim to prove the Euclidean Algorithm for finding the greatest common divisor of two numbers!


Z10177: Introduction to Game Theory in Splash 2015 (Nov. 21 - 22, 2015)
Whenever you play a game you try to predict what the other players will do. In this class we will examine some very simple games and talk about the optimal strategy when playing with certain kind of players. The course will begin with playing a game, then talking about what expectations we have, then taking a more abstract approach to the question. We will finish by attempting to explain why people play in certain ways for games they know they'll play with that player again.


Z9271: Introduction to Game Theory in Spark 2015 (Mar. 14 - 15, 2015)
Whenever you play a game you try to predict what the other players will do. In this class we will examine some very simple games and talk about the optimal strategy when playing with certain kind of players. The course will begin with playing a game, then talking about what expectations we have, then taking a more abstract approach to the question. We will finish by attempting to explain why people play in certain ways for games they know they'll play with that player again.


M9272: In(tro)duction to Induction in Spark 2015 (Mar. 14 - 15, 2015)
How can we ever be sure that something in math is true? We prove it! Mathematical induction is a powerful tool for PROVING hypothesized formulas for patterns. This class will convey the rudiments of inductive thinking, and give multiple examples of inductive methods of solving problems.


P9444: Planetary Orbits in Spark 2015 (Mar. 14 - 15, 2015)
In this class we will discuss some basics of orbits such as how to determine if something will orbit, fly away from a central body, or crash into the body. In addition, we'll show off the Kerbal Space Program game and attempt to use it to demonstrate our results.


M9446: The Euclidean Algorithm in Spark 2015 (Mar. 14 - 15, 2015)
Have you ever wanted to find the greatest common divisor between two numbers? How about finding it quickly? How about really, really quickly? In this class, we aim to prove the Euclidean Algorithm for finding the greatest common divisor of two numbers!


M8782: The Euclidean Algorithm in Splash 2014 (Nov. 22 - 23, 2014)
Have you ever wanted to find the greatest common divisor between two numbers? How about finding it quickly? How about really, really quickly? In this class, we aim to prove the Euclidean Algorithm for finding the greatest common divisor of two numbers!


S8975: Absolute Zero in Splash 2014 (Nov. 22 - 23, 2014)
Temperature can increase without bound (so far as people know), but 'strangely' there is a lower bound for temperature. How can we make sense of this? Well come find out!!! In this course, we will observe through reasonable analysis of ideal theoretical micro systems: Boyle's law, Charles' law, and Avogadro's law. These laws will then be pieced together into the beautiful ideal gas law equation. From this we will find Absolute Zero, and convince ourselves that there can be nothing with a lower temperature.


M8976: In(tro)duction to Induction in Splash 2014 (Nov. 22 - 23, 2014)
How can we ever be sure that something in math is true? We prove it! Mathematical induction is a powerful tool for PROVING hypothesized formulas for patterns. This class will convey the rudiments of inductive thinking, and give multiple examples of inductive methods of solving problems.


S8979: Introduction to Statistical Mechanics in Splash 2014 (Nov. 22 - 23, 2014)
Like statistics? Love mechanics? Well, this class isn't about either of those really, but its good if you like those things. This class will justify many of the more common chemistry formulas using very basic principles. It will not require too much science knowledge, but will require much math skills. This will be fun and a new way to look at simple science principles.


M9052: The Ways of Bayes: Applying Probability Theory in Everyday Life in Splash 2014 (Nov. 22 - 23, 2014)
Having a worse quality of living. Suffering financial harm. Being manipulated and robbed of personal autonomy. Having your society collapse. Ending up falsely accused or imprisoned. Ending up dead. What do all of these things have in common? They are the potential costs, according to one source, of a poor comprehension of Bayes' Theorem. In this class, we'll teach an intuitive understanding of Bayes' Theorem and rational decision-making through real-world examples, and show how applying Bayes' Theorem in social situations can allay awkwardness, generate key inferences, and disrupt social hierarchies, allowing, in many cases, the question-asker to be empowered as the effective decision-maker.


M8464: Introduction to Modular Arithmetic and Applications in HSSP Summer 2014 (Jul. 06, 2014)
Math is beautiful, and it's even occasionally useful. In this class, we'll explore a different way of doing arithmetic on the integers and see how it helps us solve real-world problems. For example, the rules of arithmetic on a clock (eg. 14 hours past 11:00, the clock will read 1:00) turn out to be at the foundation for one popular method of encrypting data.


S8176: Absolute Zero in Spark 2014 (Mar. 15 - 16, 2014)
Temperature can increase without bound (so far as people know), but 'strangely' there is a lower bound for temperature. How can we make sense of this? Well come find out!!! In this course, we will observe through reasonable analysis of ideal theoretical micro systems: Boyle's law, Charles' law, and Avogadro's law. These laws will then be pieced together into the beautiful ideal gas law equation. From this we will find Absolute Zero, and convince ourselves that there can be nothing with a lower temperature.


M8177: In(tro)duction to Induction in Spark 2014 (Mar. 15 - 16, 2014)
How can we ever be sure that something in math is true? We prove it! Mathematical induction is a powerful tool for PROVING hypothesized formulas for patterns. This class will convey the rudiments of inductive thinking, and give multiple examples of inductive methods of solving problems.


S8210: Let's Do Some Modeling in Spark 2014 (Mar. 15 - 16, 2014)
When something is too complicated to be understood, a very effective tool for creating approximate answers is modeling. In this course we will introduce the idea of statistical modeling as well as how to model chemicals using computer programs. We will speak about the applications of modeling and motivation for creating effective models.


S8298: Nature's Fundamental Forces: Electromagnetism and Gravity in Spark 2014 (Mar. 15 - 16, 2014)
What is electricity? How do batteries work? Heck, what is "energy" in the first place? How can a tiny magnet defeat the gravitational pull of the entire earth? And why don't the protons in an atom's nucleus repel each other like positive charges are supposed to? Come hear these questions -- and more -- answered in a lively crash-course on the fundamental forces of the universe. Best of all, you will get to build (and bring home!) your very own electromagnetic motor. I think we can all agree that this is an incredibly "attractive" class to attend.


M7693: Introduction to graph theory in Splash! 2013 (Nov. 23 - 24, 2013)
Ever tried those 'draw this image without picking up your pencil or crossing lines' challenges? This course will give you the rudiments to understanding, verifying, and completing such challenges. This course will be very relaxed on the formalities of graph theory, but focus more on terminology and determining eulerian paths in planar connected graphs, perhaps discussing famous problems related to planar graph theory such as The Traveling Salesmen problem.