Question

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

score 622 · Answer 1 · 2026-03-22 02:52:41

622

Views

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

Published on 22 Mar 2026 - 2:52

score 79 · Answer 2 · 2026-03-17 07:27:27

79

Views

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

Published on 17 Mar 2026 - 7:27

score 691 · Answer 3 · 2026-03-22 08:58:11

691

Views

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

Published on 22 Mar 2026 - 8:58

score 129 · Answer 4 · 2026-03-20 02:35:04

129

Views

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

Published on 20 Mar 2026 - 2:35

score 87 · Answer 5 · 2026-03-20 10:45:29

87

Views

Is there a pattern to addition of primesFactored numbers?

Published on 20 Mar 2026 - 10:45

score 1.4k · Answer 6 · 2026-03-20 10:53:49

1.4k

Views

Proof of Fundamental Theorem of Arithmetic: Uniqueness Part of Proof

Published on 20 Mar 2026 - 10:53

score 9.8k · Answer 7 · 2026-03-20 06:35:05

9.8k

Views

Find a prime factor of $7999973$ without a calculator

Published on 20 Mar 2026 - 6:35

score 2.7k · Answer 8 · 2026-03-22 12:14:54

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 22 Mar 2026 - 12:14

score 315 · Answer 9 · 2026-03-21 05:47:22

315

Views

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

Published on 21 Mar 2026 - 5:47

score 136 · Answer 10 · 2026-03-20 08:45:58

136

Views

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

Published on 20 Mar 2026 - 8:45

score 56 · Answer 11 · 2026-03-19 21:41:20

56

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 19 Mar 2026 - 21:41

score 1k · Answer 12 · 2026-03-17 00:17:09

1k

Views

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

Published on 17 Mar 2026 - 0:17

score 446 · Answer 13 · 2026-03-20 09:30:42

446

Views

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

Published on 20 Mar 2026 - 9:30

score 940 · Answer 14 · 2026-03-23 02:17:10

940

Views

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

Published on 23 Mar 2026 - 2:17

score 172 · Answer 15 · 2026-03-17 01:36:21

172

Views

Kalai's algorithm modification

Published on 17 Mar 2026 - 1:36

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