Jittat Fakcharoenphol

DM-LA/2025 - 15-2-4: Secret sharing (part 2) and properties of polynomails

DM-LA/2025 - 15-2-3: Polynomial interpolation

DM-LA/2025 - 15-2-2: Polynomial evaluation and secret sharing (part 1)

DM-LA/2025 - 15-2-1: Fermat's Little Theorem, primality testing, Euler's theorem and RSA

01204223 Unix warm-up

DM-LA/2025 - 15-1-3: A simple secret sharing scheme with straight lines

DM-LA/2025 - 15-1-2: GCD and modular multiplicative inverses

DM-LA/2025 - 15-1-1: The extended Euclidean algorithm

DM-LA/2025 - 14-5: Introduction to modular arithmetics

DM-LA/2025 - 14-4: Brief discussion on the correctness of the Euclid algorithm

DM-LA/2025 - 14-3: Demo for the Euclid algorithm, computing exponentiation using repeated squaring

DM-LA/2025 - 14-2: The running time of the Euclid algorithm

DM-LA/2025 - 14-1: Testing prime numbers and the Euclid algorithm for GCD

DM-LA/2025 - 13-2-3: RSA practice

DM-LA/2025 - 13-2-2: Remainders (and the mod operator)

DM-LA/2025 - 13-2-1: Integers and divisibility

DM-LA/2025 - 13-1-3: Introduction to RSA (public-key cryptography) and number theory

DM-LA/2025 - 13-1-2: Affine spaces and sets of solutions of non-homogeneous linear systems

DM-LA/2025 - 13-1-1: Translation, affine spaces, examples of solutions of nonhomogeneous lin. sys.

DM-LA/2025 - 12-2-4: Linear functions

DM-LA/2025 - 12-2-3: Four fundamental spaces

DM-LA/2025 - 12-2-2: Null spaces

DM-LA/2025 - 12-2-1: Review: row-echelon matrices and ranks

DM-LA/2025 - 12-1-3: Dimensions

DM-LA/2025 - 12-1-2: Row and column spaces

DM-LA/2025 - 12-1-1: Exercise on using Gaussian elimination to find the ranks of matrices

DM-LA/2025 - 11-2-4: Bases

DM-LA/2025 - 11-2-3: Fields, elements of vectors, Lights out, Hamming codes

DM-LA/2025 - 11-2-2: Experiment on Hamming codes

DM-LA/2025 - 11-2-1: Lights out and a system of linear equations