Tagged Questions
2
votes
3answers
61 views
Convenient way to write $x \bmod{n}$
I'm trying to figure out an easy way to write $x \bmod{n}$.
For example, in this exercise, where I need to show that this is an homomorphism:
...
0
votes
2answers
82 views
Inconsistent definitions of “quadratic residue” versus (linear) “residue”?
The Legendre symbol $(94 / 59)$ is equal to $1$, therefore, by definition, $94$ is a quadratic residue mod $59$.
At the same time, the residue of $a\mod n$ is defined as the (positive) remainder when ...
1
vote
2answers
83 views
Modulus of inverse of a number
In the Chinese Remainder Thm., $y_i$ is the modular inverse of $\frac{P}{p_i}$, where $p_i$ is the $i$th modulus in a set of $n$ congruencies and $P$ is $\prod_{i=1}^np_i$ (right?). So if I calculated ...
1
vote
2answers
258 views
The right way to write modulus equation?
I came from computer forum, and I came across many different expression of modulus equation, which of the following is authentic ?
...
4
votes
3answers
221 views
Is it mathematically correct to write $a \mod n \equiv b$?
This is not a technical question, but a question on whether we can use a particular notation while doing modular arithmetic.
We write $a \equiv b \mod n$, but is it right to write $a \mod n \equiv ...
1
vote
1answer
341 views
Notation for modulo: congruence relation vs operator
If a and b are congruent modulo a number c, we might write $a \equiv b \pmod c$. When writing programs, it's often useful to compute the remainder after division, and in pseudocode we might write a = ...
2
votes
5answers
126 views
Confused about modular notations
I am little confused about the notations used in two articles at wikipedia.
According to the page on Fermat Primality test
$
a^{p-1}\equiv 1 \pmod{m}$ means that when $a^{p-1}$ is divided by $m$, ...
