a homeschooling blog about Simon, a young mathematician and programmer, and his little sister Neva. Visit https://simontiger.com
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 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
Simon working on his proof of the Fundamental Theorem of Arithmetic (he got stuck and then searched for existing proofs online).
Simon shows three false proofs. Can you find the mistake in each proof? Simon reveals the answers to the first two. Try to give your answer to the third one. … Continue reading False Proofs: Can you figure out what’s wrong?
Simon explains why the proof that root 4 is irrational is false and shows a couple more related theorems (he came up with) generalizing the relationship between the exponent and … Continue reading Simon’s findings about the relationship between the exponent and the factor of a number
Simon explains: “Induction is a mathematical term, type of mathematical proof, if you have a couple of base cases (n base cases), then the inductive hypothesis implies that for the … Continue reading Induction as mathematical proof
Simon saw this proof on the Numberphile channel.
This has probably been proven before, but Simon likes to come up with his own proof. Here he uses proof by induction, that is a proof that proves that some … Continue reading Simon’s proof that every Fibonacci number is a sum of its neighbouring Lucas numbers divided by 5
“Mom, I’m just one step away from proving that every factorial is a highly composite number!”
Geeks out of the box 