Interactive Mathematical Pendulum Simulation

Mathematical pendulums are among the most fundamental oscillating systems studied in physics. This interactive simulation allows you to explore how pendulum motion depends on length, gravity, and initial displacement. The model uses the full nonlinear pendulum equation and integrates the motion using a fourth-order Runge–Kutta method for improved numerical accuracy.

Interactive Pendulum Wave Simulation

A pendulum wave is a mesmerizing physical phenomenon created by multiple pendulums of different lengths oscillating from the same support. Although all pendulums start in phase, their slightly different natural periods gradually cause them to drift apart, forming beautiful wave-like patterns. After a certain amount of time, the system partially or fully synchronizes again, creating repeating visual structures.

This interactive simulation lets you experiment with pendulum lengths, initial angle, gravity, and time scale while observing how differences in oscillation period influence phase relationships between multiple pendulums.

Lemniscate of Bernoulli

The Lemniscate of Bernoulli is a fascinating plane curve discovered by the Swiss mathematician Jakob Bernoulli in 1694. Its characteristic figure-eight shape makes it one of the most recognizable curves in mathematics. The curve can be defined as the set of points for which the product of the distances to two fixed points (foci) remains constant.

Visualizing Sorting Algorithms in Real Time

Sorting algorithms are one of the fundamental building blocks of computer science. While their source code is often only a few lines long, understanding how elements move through a collection can be much easier when the process is visualized.

Using ISPC for SIMD Acceleration on Windows

This note documents a practical experiment with ISPC on Windows: compiling a simple SIMD kernel, exporting it from a DLL, generating an import library, and calling it from Rust and LabVIEW. The goal is to compare ISPC’s generated AVX2 code with native Rust and LabVIEW implementations and to examine the generated assembly.

Finding the Remainder of \(9^{2018} \mod 7\) - Understanding Modular Patterns

When you first see an expression like

\[ 9^{2018} \mod 7, \]

it looks impossible to compute. The number \(9^{2018}\) is unimaginably large — far beyond what any calculator can display.

Fortunately, modular arithmetic has a wonderful property: even enormous powers often fall into small repeating cycles. Once you notice the pattern, the problem becomes surprisingly simple.

This post walks you through the reasoning step by step.