The tag has no usage guidance.

learn more… | top users | synonyms

7
votes
0answers
104 views

Bug in PiecewiseExpand and Mod with assumptions

Bug introduced in 9.0 or earlier and fixed in 10.4 The following code using PiecewiseExpandand Modgives the wrong answer <...
3
votes
0answers
41 views

Sparse matrix multiplication mod p

Let A and B be sparse matrices with integer coefficients between 0 and ...
3
votes
0answers
296 views

Parallel PowerMod

Is there anyway to parallelize the PowerMod function? Here is my Left-To-Right modular exponentation: ...
1
vote
0answers
63 views

Working with large integers in Modular Arithemetic

What would be the most efficient method of finding the remainder of the following division, 2^(2^330000000 - 1)/(2^330000001 - 1). I have tried using PowerMod function in Mathematica but i did not get ...
1
vote
0answers
52 views

Sum of zeros in finite Galois field

In the following code: << FiniteFields` GF[2][{0}] + GF[2][{0}] == GF[2][{0}] GF[2][{0}] + GF[2][{0}] + GF[2][{0}] == GF[2][{0}] Why does the second line ...
1
vote
0answers
104 views

Solving an equation for rational modulus 1

I want to solve an system of equations of the form $$\prod_{i=1}^n x_i^{M_{i,k}}=1 \qquad k=1,\ldots,n$$ with complex $x_i$ with constraint $|x_i|=1$ and $M_{i,k}$ integers. This is basically a ...
1
vote
0answers
281 views

Is there a way to speed up Simplify and/or PolynomialReduce Modulus-> 2?

I'm trying to simplify a series of equations with at most 64 input terms. As the number of terms involved in the equations increase, the runtime seems to grow exponentially. Does anyone know of ways ...
0
votes
0answers
39 views

Montgomery Modular reduction

I saw a Mathematica Implementation of Montgomery reduction at Montgomery Modular Exponentiation, a beautiful one by Simon Woods. I ran this in Mathematica and it was fast, but it does not give the ...