MathsJam Antwerp 20 May 2019
Simon has been asked to help compiling the program for the next MathsJam!
a homeschooling blog about Simon, a young mathematician and programmer, and his little sister Neva. Visit https://simontiger.com
Simon has been asked to help compiling the program for the next MathsJam!
Repl.it has published a cool interview with Simon! It was interesting how Simon struggling to answer some of the more general questions gave me another glimpse into his beautiful mind … Continue reading Interview with Simon on Repl.it
Simon has shown us a curious puzzle: if you hang a poster on a string using two pins, what is the way to arrange the string so that the poster … Continue reading A Knot Theory Puzzle
This project is a simulation of how many people can stem from the same ancestor, something Simon has learned from James Grime’s “Every Baby is a Royal Baby” video on … Continue reading The All Common Ancestors Generation
Wow! We have received an e-mail from his mathematical majesty Ron Graham today! In reaction to Simon’s Graham Scan project: “Hi Sophia and Simon, I love the video on Graham’s … Continue reading E-mail from Ron Graham
What you see here is the sequence of moves to solve the Towers of Hanoi puzzle. The sequence goes up to 2 to the power of the number of rings … Continue reading Tower of Hanoi moves plotted under a binary log plot
Simon is always extremely active in the discussions about the current projects made by/ lectures given by NYU’s Asdociate Professor Daniel Shiffman during his live sessions on the Coding Train … Continue reading More examples of Simon’s chat contributions on math and coding
When we arrived at the MathsJam last Tuesday, we heard a couple of people speak Russian. One of them turned out to be a well known Russian puzzle inventor Vladimir … Continue reading Vladimir Krasnoukhov at MathsJam Antwerp!
Simon’s code is published online at: https://www.wolframcloud.com/objects/monajune0/Published/Random_walk_distribution.nbhttps://www.wolframcloud.com/objects/monajune0/Published/Random_walk_distribution2D.nb “If I take many random walks and see what the endpoints of those random walks are, what I’ll find is a Gaussian distribution!” … Continue reading Experimenting with random walks in Wolfram Mathematica
“Connect some points into a convex polygon such that all of the remaining points are inside that convex polygon. The algorithm that will find it for me is called the … Continue reading Graham Scan Algorithm
“Mom, how long would it take a supercomputer running at 10^15 additions per second to calculate the 1000th Fibonacci number?” Simon has learned this problem from the new course he … Continue reading Fun with Brilliant’s Computer Courses