Classical Mathematics Seven Bridges of Konigsberg

Classical Mathematics (a Look Into Its History and Fields)

In this article, I take a look at classic mathematics. I discuss intuitionism and constructivism and the uses of classical mathematics throughout time. Then, from the Islamic Golden age to European developments, I review some of its histories. I also briefly explain some of the elementary fields of classic mathematics. In the end, mathematics concerns itself with the search for truth.

Chinese Remainder Theorem Examples Included Fresh chicken eggs in a basket scaled 1

Chinese Remainder Theorem (The Definitive Guide)

This definitive guide covers proofs, examples, algorithms, applications, and the Chinese Remainder Theorem history. It also includes links to additional resources such as online articles, courses, books, and tutors to help students learn from various sources. Professionals can also use these resources to increase their knowledge of the field or help structure courses for their students.

Applications of Congruence in Number Theory Week days signpost scaled 1

Applications of Congruence (in Number Theory)

So you probably know a divisibility test for 2, 3, and 5. But what about 7, 11, 13, or even larger primes? In this article, I go over divisibility tests. Including how to create your own. I also discuss the Days of the Week problem, where you are to determine the day of the week from a given date very quickly.

A lines and curves are dizzying but oh so beautiful The wonderful blue sky added extra pizazz scaled 1

Polynomial Congruences with Hensel’s Lifting Theorem

The idea behind solving polynomial congruence equations is that we can reduce a congruence equation to an equivalent system of congruence equations using prime factorization. We then 1) solve each equation modulo a prime number (by brute force), 2) use Hensel’s Lifting theorem, and then 3) piece together the solutions using the Chinese Remainder Theorem. We provide several nontrivial examples many of which are workable by hand.

Linear Congruences and Their Solvability made into a linear network with data points scaled 1

Linear Congruences and Their Solvability

In this article, you will learn what linear congruences are and when they are solvable. How to solve them will also be covered in detail. I discuss an ad hoc method, using the Euclidean algorithm, and using the inverse of an integer.

New York Manhattan 5th ave Big street cast iron clock on skyscrapers background scaled 1

Congruence Theorems (and Their Proofs)

In this article, I discuss modular congruence. I demonstrate the congruence is an equivalence relation, and I prove several lemmas concerning the basic properties of congruence. Towards the end, I go over modular arithmetic and its properties.

High voltage power lines and lattice crosses under a blue sky with wispy white clouds scaled 1

Diophantine Equations (of the Linear Kind)

In this article, I discuss what Diophantine Equations are and the difficulting of solving them. Then, I detail how to solve two-variable linear diophantine equations. Towards the end, I solve a multi-variable linear Diophantine equation concerning pennies, dimes, and quarters.

The shabby and cracked wall of an old building of blocks and bricks scaled 1

Fundamental Theorem of Arithmetic

In this article, I prove one of the most celebrated theorems in all of mathematics. But first, I explain why this theorem is both fundamental and unique. I also explore some applications and discuss the least common multiple and their connection to greatest common divisors.

Transport Layer Security Secure Socket Layer TLS SSL cryptographic protocols provide secured communications scaled 1

Euclidean Algorithm (by Example)

The Euclidean Algorithm is to find the greatest common divisor of two given integers. In this article, you will see this critical algorithm proven in detail. Further, I will show you how to use these computations to solve linear congruence equations and linear Diophantine equations. While this algorithm has been around a while, it is the key to much success.

Greatest Common Divisors and Their Importance 1

Greatest Common Divisors (and Their Importance) [Video]

We discuss several simple lemmas for greatest common divisors and linear combinations. I then prove Bezout’s identity to show that the greatest common divisor of two integers is the smallest linear combination. We also work through several elementary facts concerning relatively prime integers, and I present many examples.