The Van Eck Sequence
Simon explains that the Van Eck Sequence is and shows the patterns he has discovered in the sequence by programming it in Python and plotting it in Wolfram Mathematica. Simon’s … Continue reading The Van Eck Sequence
Category: Murderous Maths
The Brachistochrone
Simon believes that he has found a mistake in one of the installations at the Technopolis science museum. Or at least that the background description of the exhibit lacks a … Continue reading The Brachistochrone
Math on the Beach
Sunday at the beach, Simon was reenacting the 5 doors and a cat puzzle (he had learned this puzzle from the Mind Your Decisions channel). The puzzle is about guessing … Continue reading Math on the Beach
Infinite Series Calculator in Repl.it
Simon has made a small calculator/approximator in Repl.it that shows what number an infinite series converges to: https://repl.it/@simontiger/Series
Benford’s Law
Simon is looking at his subscribers count on YouTube. We speculate if he gets to 1000 before the end of the academic year. Simon tells me that’s because subscriber count … Continue reading Benford’s Law
Math Fun
Simon finds the explanation on Brilliant.org incomplete, so he started a discussion about it on the Brilliant community page: https://brilliant.org/discussions/thread/games-of-chance-course-marble-problem/?ref_id=1570424
Parabolas are special
At the bakery, Simon tells me: “Parabola is the only shape that’s both an ellipse and a hyperbola (at least in a projective plane, which means that you can have … Continue reading Parabolas are special
MathsJam Antwerp 20 May 2019
Simon has been asked to help compiling the program for the next MathsJam!
Interview with Simon on Repl.it
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
Pathfinding algorithms: Dijkstra’s and Breadth-first search
The photos below show Simon playing with Breadth-first search and Dijkstra’s algorithms to find the most efficient path from S to E on a set of graphs. The two more … Continue reading Pathfinding algorithms: Dijkstra’s and Breadth-first search
A Knot Theory Puzzle
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
The All Common Ancestors Generation
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
Geeks out of the box 