ESP Biography



JACK GUREV, MIT sophomore studying Mathematics




Major: math

College/Employer: MIT

Year of Graduation: 2019

Picture of Jack Gurev

Brief Biographical Sketch:

Not Available.



Past Classes

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

W12565: Flow Arts in Splash 2018 (Nov. 17 - 18, 2018)
Restless from sitting in classes all day? Come get out that energy with us through spinning or flow arts. We’ll provide the props and teach you the moves.


W9580: ScienceBowl in Splash 2015 (Nov. 21 - 22, 2015)
The High School National Science Bowl (NSB) is a science knowledge competition using a quiz bowl format. A buzzer system similar to those seen on popular television game shows is used to signal an answer. Come play high school ScienceBowl in teams of four for fun!


M9612: Just Do It in Splash 2015 (Nov. 21 - 22, 2015)
When asked to prove some mathematical object exists, sometimes the proof is just a contradiction. In fact, sometimes the construction is exceedingly simple, and it is very clear to check that it is actually a valid construction. For example, say you want to know if there is a sequence of moves that will, for any Rubik's cube configuration, solve it at some point. Trying to invent such a "magic" sequence would seem impossible. Instead, you can just do it! There are only finitely many Rubik's cube positions $$r_1,... r_n$$ - so just solve assuming the position was initially $$r_1$$, and then solve assuming the position was initially $$r_2$$, and so on and so forth. Just build this sequence up, some elements after some elements, and the result is a solution. Instead of trying to generate some magic algorithm by describing a string of left turns and right turns, we just characterize a way to solve all Rubik's cubes, just knowing that Rubik's cubes are solvable. A great many problems that appear complex actually have a simple "just do it" solution. In this class we will show you some of our favorite examples, in addition to some asymptotic problems. Asymptotic problems might ask you to prove something gets small as $$n$$ gets large, and they are omnipresent - for instance in the notation $$O(f(n))$$ denoting complexity.


M10054: Abstract Nonsense in Splash 2015 (Nov. 21 - 22, 2015)
Have you ever wondered if all mathematical objects were secretly the same thing? Do you wish you could do your math homework by drawing a picture? Come to this class to learn both with category theory.