Solving a Sudoku is not an easy task, not for humans and even a computer can struggle with it if it has to go through each combination and try brute forcing the puzzle without any clue. Lucky for us we are able to tackle this problem by using Discrete Math...
This post is about the discrete math that is being taught at the University Ghent for people attending the Bridge program to Master Of Science in Industrial Engineering (IT). In this program we learned about 3 specific sub-groups of Discrete Mathematics: * Fields * Graphs * Groups In this post I will summarise...
1 Galois Fields 1.1 Construction of Galois Fields A Galois field has a finite amount of numbers and is written as GF(q) or Fq. Where q = pn. When knowing all this we can now construct a Galois Field with n dimensions and p elements. Example: When we want...
1.1 Weierstrass Equations 1.1.1 Introduction A weierstrass equation is an elliptical curve with a collection of points (x, y) (xεF and yεF) and is of the third grade with the form: $$ y^2 + a1xy + a3y = x^3 + a2x^2 + a4x + a6, ai\epsilon F $$ and ∞ always added...