Default constructor of the class.
Euclidean algorithm to compute the Greatest Common Divisor or GCD.
The greatest common divisor between the operand A et operand B.
Application of the Thales Theorem used to compute 2 of the 6 side's size missing.
Length of the segment AD.
Length of the segment AB.
Length of the segment AE.
Length of the segment AC.
Length of the segment DE.
Length of the segment BC.
An object with the length of each segments expected as an associative array with the name of the segment as key and the size of the segment as value.
Indicate if the segment [DE] and [BC] are parallel or not.
Length of segment AD.
Length of segment AB.
Length of segment AE.
Length of segment AC.
Precision of the result excepted. By default, the number of digit expected is equal at 2 digits.
A boolean to indicate if the segment [DE] and [BC] are parallel or not.
Check if a number is a Mersenne Number or not.
This method implement the Lucas-Lehmer algorithm. You can get more information about this algorithm here : https://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer_primality_test
The number to test.
True if x is a Mersenne Number.
Check if a number is a prime number or not.
Number to check is a prime number.
True if x is a prime number.
Get the Least Common Multiple (LCM) of two numbers.
A number.
Another number.
The least common multiple between a and b.
Pythagorean theorem used to check if a triangle is right or not.
Hypotenuse of the potential right triangle
First cathetus of the potential right triangle.
Seconde cathetus of the potential right triangle.
A boolean to indicate if the triangle is right or not.
Compute the thirds side of a right triangle. To this, get two sizes to compute the last size.
Hypotenuse of the triangle.
First side of the triangle.
Second side of the triangle.
The size of the third value of the right triangle.
Generated using TypeDoc
Class who contains all elements relatives to the Mathematics sciences.
Nicolas GILLE nic.gille@gmail.com
0.1.0
1.0
MIT