These parameters are saved and used when nextNumber() is called. modulo is the largest number that can be generated (exclusive)

simple constructor that receives a key or uses default key = 0

encrypt_key is an NxN numpy matrix

returns the size of the vector

mul implements the scalar multiplication and the dot-product

implements the matrix-vector multiplication. implements the matrix-scalar multiplication

returns a string representation of the vector

returns a string representation of this matrix.

input: other vector assumes: other vector has the same size returns a new vector that represents the differenz.

implements the matrix-subtraction.

Pure implementation of binary search algorithm in Python by recursion Be careful collection must be sorted, otherwise result will be unpredic

Pure implementation of binary search algorithm in Python using stdlib Be careful collection must be sorted, otherwise result will be unpredic

input: 'content' of type list and 'key' of type int output: decrypted string 'content' as a list of chars if key not passed the method uses

input: filename (str) and a key (int) output: returns true if decrypt process was successful otherwise false if key not passed the method

input: 'content' of type string and 'key' of type int output: encrypted string 'content' as a list of chars if key not passed the method use

input: filename (str) and a key (int) output: returns true if encrypt process was successful otherwise false if key not passed the method

>>> englishFreqMatchScore('Hello World') 1

input: positive integer 'n' returns the factorial of 'n' (n!)

input: positive integer 'n' returns the n-th fibonacci term , indexing by 0

Gets the n-th prime number. input: positive integer 'n' >= 0 returns the n-th prime number, beginning at index 0

input: prime numbers 'pNumber1' and 'pNumber2' pNumber1 < pNumber2 returns a list of all prime numbers between 'pNumb

Goldbach's assumption input: a even positive integer 'number' > 2 returns a list of two prime numbers whose sum is equal to '

input: positive integer 'number' >= 0 returns the greatest prime number factor of 'number'

Pure implementation of interpolation search algorithm in Python by recursion Be careful collection must be sorted, otherwise result will be un

>>> isEnglish('Hello World') True >>> isEnglish('llold HorWd') False

input: integer 'number' returns true if 'number' is odd, otherwise false.

input: positive integer 'number' > 1 returns true if 'number' is a perfect number otherwise false.

Least common multiple input: two positive integer 'number1' and 'number2' returns the least common multiple of 'number1' and