How to use the mod function from mathjs

math_4.2.2.js

GitHub: nicebook/Node.js-Reference

10
11
12
13
14
15
16
17
18
19
var dotval2 = [[3, 2], [5, 2]];    
var dotval3 = [[1, 2], [4, 3]];
var multiply1 = [[1, 2], [4, 3]];
var multiply2 = [[1, 2, 3], [3, -4, 7]];
function isOdd(x) {
        return math.mod(x, 2) != 0;
}    
console.log(math.abs(3.5));  
console.log(math.abs(-4.2));  
console.log(math.abs([3, -5, -1, 0, 2]));  

19

29

6

+ 3 other calls in file

index.js

GitHub: jly36963/notes

38
39
40
41
42
43
44
45
46
47
math.cbrt(8); // cube root
math.divide(a, b); // divide
math.exp(8) // exponent (e ** x)
math.log(a) // ln
math.log(a, 2) // log base 2
math.mod(a, b) // modulus (remainder)
math.multiply(a, b) // multiply
math.pow(a, b) // a ** b
math.sqrt(a) // square root
math.subtract(a, b) // subtract

0

3

0

+ 6 other calls in file

HillFunctions.js

GitHub: JuanLara18/MadameX

48
49
50
51
52
53
54
55
56
57
58
59
}


let modInverseMatrix = (A, modn = 26) => {
    //depends on validateMatrix, factors and modInverse
    console.log(modn)
    A = math.mod(A, modn)
    let det = validateMatrix(A, modn)
    if (det == null) return null


    //compute adjoint matrix 

0

0

0

+ 7 other calls in file

hillCipher.js

GitHub: OrghoN/hillCipher

64
65
66
67
68
69
70
71
72
var block = math.size(key)._data[0];

//filter text for anything that can be coded
text = text.toLowerCase().match(/[A-Z .?]/gi);
//padding, if required
text = math.mod(text.length, block) == 0 ? text : pad(text, text.length + block - math.mod(text.length, block), " ");

//chunking
text = math.matrix(math.reshape(text, [block, text.length / block]));

0

0

0

+ 3 other calls in file