Question

How to know if a number is quartic residue or nonresidue modulo n?

score 243 · Answer 1 · 2026-04-15 12:54:32

243

Views

How to know if a number is quartic residue or nonresidue modulo n?

Published on 15 Apr 2026 - 12:54

score 30 · Answer 2 · 2026-04-17 03:16:42

30

Views

If a/b gives remainder r, and b/c also gives same remainder r => a/c would also give same remainder r for sure?

Published on 17 Apr 2026 - 3:16

score 471 · Answer 3 · 2026-04-11 23:53:29

471

Views

how to prove lcm divides any common multiple from definition of lcm(a,b) = (a*b)/gcd(a,b)

Published on 11 Apr 2026 - 23:53

score 467 · Answer 4 · 2026-04-16 13:58:05

467

Views

If $a ≡ b$ (mod $n$), prove that $a^5 ≡ b^5$ (mod $n$)

Published on 16 Apr 2026 - 13:58

score 33 · Answer 5 · 2026-04-12 02:19:33

33

Views

Consequences in number theory if we have ${\sigma}^{k}(x)\equiv 0\pmod{x}$ for all positive integers $k>1$?

Published on 12 Apr 2026 - 2:19

score 247 · Answer 6 · 2026-04-10 21:41:20

247

Views

RSA encoding function is bijection

Published on 10 Apr 2026 - 21:41

score 406 · Answer 7 · 2026-04-11 09:14:38

406

Views

Properties of the remainders from division into primes

Published on 11 Apr 2026 - 9:14

score 397 · Answer 8 · 2026-04-16 13:59:31

397

Views

Primes dividing Fibonacci mod 4

Published on 16 Apr 2026 - 13:59

score 64 · Answer 9 · 2026-04-16 09:10:16

64

Views

is $f: \Bbb Z_3 → \Bbb Z_9, f(\bar x) \ =[2x]$ a function?

Published on 16 Apr 2026 - 9:10

score 71 · Answer 10 · 2026-04-13 03:15:24

71

Views

Fermat's little theorem and modular arithmetic

Published on 13 Apr 2026 - 3:15

score 153 · Answer 11 · 2026-04-14 10:41:57

153

Views

All primitive Pythagorean triples with $y=2x+1$ and $y<1000$

Published on 14 Apr 2026 - 10:41

score 433 · Answer 12 · 2026-04-12 23:21:03

433

Views

Do the floor and ceiling functions count as closed-form expressions?

Published on 12 Apr 2026 - 23:21

score 155 · Answer 13 · 2026-04-17 05:10:56

155

Views

Let $\Phi_n: \Bbb Z_n\to \Bbb Z_n$ s. t. $\Phi_n(x)=x^n+x^{n-1}+\ldots+x+1$.

Published on 17 Apr 2026 - 5:10

score 76 · Answer 14 · 2026-04-11 13:06:09

76

Views

What's wrong with my modular arithmetic?

Published on 11 Apr 2026 - 13:06

score 628 · Answer 15 · 2026-04-14 00:10:11

628

Views

Order of elements in $\mathbb{Z}_{27}$

Published on 14 Apr 2026 - 0:10

List Question

How to know if a number is quartic residue or nonresidue modulo n?

If a/b gives remainder r, and b/c also gives same remainder r => a/c would also give same remainder r for sure?

how to prove lcm divides any common multiple from definition of lcm(a,b) = (a*b)/gcd(a,b)

If $a ≡ b$ (mod $n$), prove that $a^5 ≡ b^5$ (mod $n$)

Consequences in number theory if we have ${\sigma}^{k}(x)\equiv 0\pmod{x}$ for all positive integers $k>1$?

RSA encoding function is bijection

Properties of the remainders from division into primes

Primes dividing Fibonacci mod 4

is $f: \Bbb Z_3 → \Bbb Z_9, f(\bar x) \ =[2x]$ a function?

Fermat's little theorem and modular arithmetic

All primitive Pythagorean triples with $y=2x+1$ and $y<1000$

Do the floor and ceiling functions count as closed-form expressions?

Let $\Phi_n: \Bbb Z_n\to \Bbb Z_n$ s. t. $\Phi_n(x)=x^n+x^{n-1}+\ldots+x+1$.

What's wrong with my modular arithmetic?

Order of elements in $\mathbb{Z}_{27}$

Trending Questions

Popular # Hahtags

Popular Questions