Use Brilliant to build your problem solving skills in math and science

Sign up! or Log in

Waste less time on Facebook — follow Brilliant.

×

This section requires Javascript.
You are seeing this because you have javascript disabled. Load the non-javascript version of this page.

This section requires Javascript.
You are seeing this because you have javascript disabled. Load the non-javascript version of this page.

This section requires Javascript.
You are seeing this because you have javascript disabled. Load the non-javascript version of this page.

Riccardo Zanotto

Volpiano, Italy • Liceo Scientifico Isaac Newton Chivasso

Followers 30

Following 36

Checking the divisibility of a factorial

When Madin learnt about factorials, he was delighted that they had so many factors since ...

Solve this hard Number Theory problem.

Prime Divisors Positive Difference

For a composite positive integer \(x\), denote by \(pd(x)\) the smallest positive difference between any two prime divisors of ...

Solve this hard Number Theory problem.

×

Problem Loading...

Note Loading...

Set Loading...