×

Find all natural number $$n$$ such that $$n$$, $$n^2 + 10$$, $$n^2 - 2$$, $$n^3 + 6$$, $$n^5 + 36$$ are all prime numbers.

Note by Dev Sharma
2 years, 3 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Note to self: 1 is not a prime number.

Staff - 2 years, 3 months ago

This is from the First HK TST.

- 2 years, 1 month ago

One question from me: Is every odd prime representable in form of 4k $$\pm$$ 1, where k $$\epsilon$$ N ? Or Is every prime greater than 3 is representable in form of 6k $$\pm$$ 1, where k $$\epsilon$$ N ?

- 2 years, 3 months ago

Every odd number (not necessarily prime) is representable in the form $$4k \pm 1$$ for a suitable k.

Staff - 2 years, 3 months ago

And for $$6k \pm 1$$ ?

- 2 years, 3 months ago

Yes every prime is representable in the form $$6k\pm 1$$.

Proof: $$6k, 6k +2,6k+4$$ are divisible by 2

$$6k+3$$ is divisible by 3

- 2 years, 1 month ago