LaTeX Guide!
If you'd like to learn latex, go here: https://www.overleaf.com/read/hdjxrhwxxrgp#090fd2 We also have an online forum, please reach out to me if you're interested!
Latest Blog Post
A Little Note about Mahler’s 9th Symphony
Some comments about a Mahler Symphony I recently went to!
Euclidean Algorithm
The Euclidean Algorithm is used to find the Greatest Common Divisor of very large numbers and is frequently applied to large computational methods for cryptography. I have shown an example of how a program would work as well as how the mathematics behind is works.
Elliptic Curve Cryptography
Elliptic curve cryptography (ECC) is a popular choice for the security of data online, including key exchanges, digital signatures, and encryption. The equation itself is expressed as y2=x3+ax+b, where a and b are some coefficients.
Caesar Ciphers
Caesar Ciphers were first used by Julius Caesar in 58 BC, one of the earliest found evidence of (somewhat) complicated cryptography. I have created a code to make your own cipher here!
Breadth-First Searches
Breadth First searches (BFS) begin at a certain node before moving onto the node’s neighbors. Following this, it moves onto the neighbor’s neighbors, and the sequence continues. This enables us with the ability to calculate the distance from the beginning node to the other node.
An Introduction to Frobenius Numbers
If we suppose that xn are positive integers such that the greatest common factor of x1, x2, x3, …, and xn is 1. The Frobenius Number, often expressed by g(x1, x2, x3, …, xn), is the largest positive integer, y, such that a1x1 + a2x2 + a3x3 + … + anxn = y has no nonnegative solution.
Past posts are currently being edited.
They will be coming back soon! Please email me if you would like access to the past posts.
Contact Me!
Feel free to message me anytime about anything! :)