a homeschooling blog about Simon, a young mathematician and programmer, and his little sister Neva. Visit https://simontiger.com
Simon has been fascinated by these possible-impossible puzzles (that he picked up from the MajorPrep channel) for a couple of days. He prepared many paper visuals so that Dad and … Continue reading Math puzzles: Is it Possible?
As some of you may know, Simon is working on building a real-life 8-bit computer from scratch, guided by Ben Eater’s tutorials (it’s a huge project that may takes months). … Continue reading Simon trying to build a 8-bit computer in circuit simulators
Simon thinking about how to turn an asynchronous language into a synchronous language, using Sleepsort as a test.
This is Simon explaining Diffe-Hellman key exchange (also called DiffeHellman protocol). He first explained the algorithm mixing watercolours (a color representing a key/ number) and then mathematically. The algorithm allows … Continue reading The Diffe-Hellman key exchange algorithm
One more blog post with impressions from our vacation at the Cote d’Azur in France. Don’t even think of bringing Simon to the beach or the swimming pool without a … Continue reading Doing math and computer science everywhere
Take any real number and call it x. Then plug it into the equation f(x) = 1 + 1/x and keep doing it many times in a row, plugging the … Continue reading Why the Golden Ratio and not -1/the Golden Ratio?
While in Southern France, Simon really enjoyed solving this puzzle (he originally saw in a Brilliant.org vid). He was so happy with his solution he kept drawing it out on … Continue reading Simon having fun solving math puzzles on Twitter.
Simon was showing Dad a graph of how technology is developing exponentially, y = a^x. Dad asked for a specific value of a, and Simon said: “All exponentials are stretched … Continue reading Another evening tea
Simon has written a code in Python that generates primes using the finite list from Euclid’s proof that there are infinitely many primes. “Starting with one prime (2) the code … Continue reading Prime Generation Algorithm in Python
Simon solving the Ackermann function (a function that cannot be de-recursed). It’s computable but the computer’s soon runs out of its computing power (see the last line of code below):
Geeks out of the box 