Question

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here $15^{48}$ mod $53$.

score 101 · Answer 1 · 2018-12-10 17:31:36

101

Views

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here $15^{48}$ mod $53$.

Published on 10 Dec 2018 - 17:31

score 160 · Answer 2 · 2018-12-10 23:10:16

160

Views

Question about a kind of generalized Fermat numbers

Published on 10 Dec 2018 - 23:10

score 110 · Answer 3 · 2018-12-17 17:36:52

110

Views

Show that the term $xy+1$ is a perfect square.

Published on 17 Dec 2018 - 17:36

score 88 · Answer 4 · 2019-01-19 01:47:23

88

Views

If prime $p$ such $p|F_{n}(n\ge 2)$, show that $p\equiv \pm 2 \pmod 5$

Published on 19 Jan 2019 - 1:47

score 67 · Answer 5 · 2019-01-30 00:12:28

67

Views

Prove $n$ having to be an exponent of 2 for $b^n + 1 =$ a prime number

Published on 30 Jan 2019 - 0:12

score 253 · Answer 6 · 2019-02-13 15:18:06

253

Views

Is $10^{2^{21}}+1$ known to be composite?

Published on 13 Feb 2019 - 15:18

score 179 · Answer 7 · 2019-03-03 11:58:10

179

Views

Fermat's Little Theorem & Euler's Theorem

Published on 03 Mar 2019 - 11:58

score 300 · Answer 8 · 2019-03-08 13:53:43

300

Views

Use Fermat’s Theorem to prove Euler’s Theorem in the case m = pq. with p and q being two distinct prime numbers

Published on 08 Mar 2019 - 13:53

score 69 · Answer 9 · 2019-04-05 10:36:15

69

Views

If $q$ is a Fermat prime, is $\sigma(q^k)/2$ a square if $k \equiv 1 \pmod 4$?

Published on 05 Apr 2019 - 10:36

score 28 · Answer 10 · 2019-04-14 11:44:04

28

Views

Show that $a$ generates the group of units $(\Bbb{Z}/F_n\Bbb{Z})^\times$

Published on 14 Apr 2019 - 11:44

score 1.3k · Answer 11 · 2019-05-13 17:28:33

1.3k

Views

If the order of a number (mod n) equals n-1 then n is prime?

Published on 13 May 2019 - 17:28

score 97 · Answer 12 · 2019-05-13 17:29:16

97

Views

Why is it that exponents that are divisors of φ(N) capable of generating the identity element as a power when N is prime?

Published on 13 May 2019 - 17:29

score 358 · Answer 13 · 2019-06-09 19:13:23

358

Views

Fermat's last theorem. Where is the mistake?

Published on 09 Jun 2019 - 19:13

score 41 · Answer 14 · 2019-06-17 00:41:49

41

Views

An elaboration of a step in an example.

Published on 17 Jun 2019 - 0:41

score 94 · Answer 15 · 2019-06-30 18:56:36

94

Views

Can we prove that $(2^{2^{n}}+1)+(2^{2^{n-1}}+1) -1$ have at least $n$ different prime divisors

Published on 30 Jun 2019 - 18:56

List Question

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here $15^{48}$ mod $53$.

Question about a kind of generalized Fermat numbers

Show that the term $xy+1$ is a perfect square.

If prime $p$ such $p|F_{n}(n\ge 2)$, show that $p\equiv \pm 2 \pmod 5$

Prove $n$ having to be an exponent of 2 for $b^n + 1 =$ a prime number

Is $10^{2^{21}}+1$ known to be composite?

Fermat's Little Theorem & Euler's Theorem

Use Fermat’s Theorem to prove Euler’s Theorem in the case m = pq. with p and q being two distinct prime numbers

If $q$ is a Fermat prime, is $\sigma(q^k)/2$ a square if $k \equiv 1 \pmod 4$?

Show that $a$ generates the group of units $(\Bbb{Z}/F_n\Bbb{Z})^\times$

If the order of a number (mod n) equals n-1 then n is prime?

Why is it that exponents that are divisors of φ(N) capable of generating the identity element as a power when N is prime?

Fermat's last theorem. Where is the mistake?

An elaboration of a step in an example.

Can we prove that $(2^{2^{n}}+1)+(2^{2^{n-1}}+1) -1$ have at least $n$ different prime divisors

Trending Questions

Popular # Hahtags

Popular Questions