At the main entrance to CERN there is an impressive smooth curve of a memorial to the world’s most important equations and scientific discoveries:
I’ve discovered that base 3 is the most efficient base (not base 2). Actually the most efficient base is e, and 3 is the closest to e (the proof requires Calculus).
South Korea has published a complete design of a ternary computer in July 2019! So this is actually cutting edge material here!
(Inefficiency is calculated by multiplying the number of digits by the base number).
Simon has also showed me a trick to translate any number into binary using a grid:
and a card trick based on quickly translating a number into binary in his head:
How he designed and made it:
This summer, aged 9, Simon @simontigerh was named a World Science Scholar and joined a two-year program for the world’s most exceptional young math talents, as the youngest among the 75 students selected in 2018 and 2019. See the official press release for more info: https://www.businesswire.com/news/home/20190905005166/en/World-Science-Festival-Announces-Newest-Class-%E2%80%9CWorld
Simon’s passion for science and his unique way to see the world have blossomed again once we have pulled him out of school, where he was becoming increasingly unhappy and was considered a problem student. The only way to set his mind free and allow him to follow the path that suits him best, the path of self-directed learning, was to leave Simon’s native Amsterdam and The Netherlands, where school attendance is compulsory.
I am sharing this at the time when educational freedom and parental rights in The Netherlands are in serious danger to become limited even further. It is bittersweet to celebrate Simon’s beautiful journey and at the same time see how The Netherlands are chasing away extreme talent as we are aware of more stories similar to that of Simon’s.
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 I could try solving them. This morning he produced this beautiful piece of design:
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 two parties (marked “you” and “your friend” in Simon’s diagram) with no prior knowledge of each other to establish a shared secret key over an insecure channel (a public area or an “eavesdropper”). This key can then be used to encrypt subsequent communications using a symmetric keycipher. Simon calls it “a neat algorithm”). Later the same night, he also gave me a lecture on a similar but more complicated algorithm called the RSA. Simon first learned about this on Computerphile and then also saw a video about the topic on MajorPrep. And here is another MajorPrep video on modular arithmetic.
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 sketchbook to do some math or computer science!