MathBoxIT

Description:

Mathematical tools for informatics (A program which I programmed after the mathematics and cryptography lecture to practice math, cryptography and programming) This program is created only to learn and not for efficiency functions. !!!No teacher checked the programming functions so there can be errors, to be sure to have correct results use tested programs and nothing here!!!

I program this with Python, Flask Framework, Jinja, HTML and CSS.

How to use?

1. Open the Code with Github Codespace or other development environment
2. Install Python if not already installed
3. Go in the project directory with the command if not already in
4. Install Python Flask Framework with the command: pip install flask
5. Start the Application with the command: flask run
6. Open the web application with go to PORTS right of TERMINAL and open in Browser mostly Port 5000

Math functions

Miller-Rabin-Test (probabilistic primality test)

This test check if a number is prime or not. If Miller_Rabin_Test answer is false so the number is not prime. If the answer is true so the number is most likely prime (Miller-Rabin-Test with 15 repeats in this program is high).

Prime factors

This test breaks down a number into its prime factors.

ISBN-10-Test

This test check if a ISBN-10 number is valid. Enter here the number without space or other signs.

Euclidean algorithm

This algorithm checks with modulo calculating which is the great common divisior of two entered numbers.

Extended Euclidean algorithm

This algorithm calculate the great common divisior and reconstruct a linear combination with the two entered numbers Equalizer to the great common divisor.

Chinese remainder theorem

With this algorithm we can get the smallest natural number which meets the following conditions. From a list of equations which looks like: (X congruent number mod)

(X congruent 4 mod7)
(X congruent 3 mod5)
(X congruent 5 mod2)

When the mods are all coprime the chinese remainder function can find the smallest number X which solves the conditions.

To use the function enter the numbers in the following format:
Number list:4 3 5
Mod list:7 5 2

Gaussian elimination

This algorithm solves a linear system of equations like below to line step shape.

3X + 7Y = 0
5X + 9Y = 0

To use the function enter the numbers as a matrix but in one line:
Matrix:3 7 5 9

Finite prime field division

This function do a division in a finite prime field.

Binary world

Decimal to numeral system

Converts a decimal number to an equivalent number from the selected numeral system.

Numeral system to decimal

Converts a number from selected numeral system to an equivalent number from the decimal system.

Decimal to Binary

Converts a decimal number to an equivalent number from the binary system.

Binary to decimal

Converts a binary number to an equivalent number from the decimal system.

Pictures of the Webpages

Homepage with all functions buttons to klick.

Examples of the webpages with the functions.