Question

For which natural numbers are $\phi(n)=2$?

score 635 · Answer 1 · 2026-05-02 14:26:56

635

Views

For which natural numbers are $\phi(n)=2$?

Published on 02 May 2026 - 14:26

score 88 · Answer 2 · 2026-05-06 08:55:13

88

Views

Fractions of the form $\frac{a}{k}\cdot\frac{b}{k}\cdot\frac{c}{k}\cdots=\frac{n}{k}$

Published on 06 May 2026 - 8:55

score 699 · Answer 3 · 2026-04-29 12:18:20

699

Views

(Number of perfect powers ≤ n) ∼ $\sqrt{n}$?

Published on 29 Apr 2026 - 12:18

score 136 · Answer 4 · 2026-05-02 18:42:36

136

Views

How do I solve complicated prime factorization problems? (Ex: 20711)

Published on 02 May 2026 - 18:42

score 95 · Answer 5 · 2026-05-02 18:33:15

95

Views

Is there a pattern to addition of primesFactored numbers?

Published on 02 May 2026 - 18:33

score 1.4k · Answer 6 · 2026-05-02 20:03:13

1.4k

Views

Proof of Fundamental Theorem of Arithmetic: Uniqueness Part of Proof

Published on 02 May 2026 - 20:03

score 9.8k · Answer 7 · 2026-04-29 12:35:25

9.8k

Views

Find a prime factor of $7999973$ without a calculator

Published on 29 Apr 2026 - 12:35

score 2.7k · Answer 8 · 2026-05-10 08:07:31

2.7k

Views

Proof verification: Let $gcd(x,y)=1$. If $xy$ is a perfect square, then $x$ and $y$ are perfect squares.

Published on 10 May 2026 - 8:07

score 323 · Answer 9 · 2026-04-29 12:19:06

323

Views

An idea for approaching Brocard's problem ($n!+1=m^2$)

Published on 29 Apr 2026 - 12:19

score 142 · Answer 10 · 2026-05-02 18:33:01

142

Views

Looking for complex roots of unity which also happen to be complex primes

Published on 02 May 2026 - 18:33

score 63 · Answer 11 · 2026-05-03 15:55:24

63

Views

How can I prove that all prime factors of $f(n,p)=(n+1)^p-n^p$ have form $2kp+1$ (if $p$ - odd prime)?

Published on 03 May 2026 - 15:55

score 1k · Answer 12 · 2026-05-10 12:34:09

1k

Views

How can I prove that there is only one set of prime factors for a number?

Published on 10 May 2026 - 12:34

score 453 · Answer 13 · 2026-05-03 08:50:33

453

Views

How to find algorithm for integer factorization if the prime factorization of the integer is given?

Published on 03 May 2026 - 8:50

score 945 · Answer 14 · 2026-05-07 17:50:18

945

Views

What is the correct notion of unique factorization in a ring?

Published on 07 May 2026 - 17:50

score 181 · Answer 15 · 2026-05-10 12:28:46

181

Views

Kalai's algorithm modification

Published on 10 May 2026 - 12:28

List Question

For which natural numbers are $\phi(n)=2$?

Fractions of the form $\frac{a}{k}\cdot\frac{b}{k}\cdot\frac{c}{k}\cdots=\frac{n}{k}$

(Number of perfect powers ≤ n) ∼ $\sqrt{n}$?

How do I solve complicated prime factorization problems? (Ex: 20711)

Is there a pattern to addition of primesFactored numbers?

Proof of Fundamental Theorem of Arithmetic: Uniqueness Part of Proof

Find a prime factor of $7999973$ without a calculator

Proof verification: Let $gcd(x,y)=1$. If $xy$ is a perfect square, then $x$ and $y$ are perfect squares.

An idea for approaching Brocard's problem ($n!+1=m^2$)

Looking for complex roots of unity which also happen to be complex primes

How can I prove that all prime factors of $f(n,p)=(n+1)^p-n^p$ have form $2kp+1$ (if $p$ - odd prime)?

How can I prove that there is only one set of prime factors for a number?

How to find algorithm for integer factorization if the prime factorization of the integer is given?

What is the correct notion of unique factorization in a ring?

Kalai's algorithm modification

Trending Questions

Popular # Hahtags

Popular Questions