×

# Semi-prime age, version 2

My age is a product of (exactly) two prime numbers. Also, the same was true before my last birthday and will be true after my upcoming birthday.

Assume that I am an elf, with unlimited lifespan.

What are my possible ages?

(See https://brilliant.org/discussions/thread/semi-prime-age-version-1/ for a simpler version of this problem.)

Note by Johan Falk
3 years 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:

Ok, so I just wrote a short script to check this problem out numerically. There are 16 valid ages to find below 1000 years, and 80 valid ages below 10 000 years. This probably covers the life span of the elves in Middle Earth, but it doesn't solve the problem completely.

EDIT: …and there are 2415 valid ages below 1 000 000 years. I am starting to think that the pattern is really difficult to find.

- 3 years ago

Note: I do not yet know if this problem has more than one solution. I have come a bit on analyzing the problem. My steps so far:

Call the age N. Every second number is divisible by two. Every third number is divisible by three. Thus, there is at least one of (N–1), N or (N+1) that is divisible by two , and exactly one is divisible by three.

Every second even number is divisible by 4, so if two numbers in the sequence is divisible by two, one of them is divisible by 2*2. This would then be the only two prime factors in that number. But this cannot be the case, since 4 doesn't fit into a sequence of three semi-prime numbers.

Thus, only one number is divisible by two. Thus the middle number (N) is even.

So we are looking for a number N such that… $$N = 2P_1$$ either $$(N–1)$$ or $$(N+1)$$ is $$3P_2$$ and either $$(N+1)$$ or $$(N–1)$$ is $$P_3 \cdot P_4$$

where $$P_1$$, $$P_2$$ and $$P_3$$ are unique prime numbers, but $$P_4$$ may be equal to $$P_3$$.

- 3 years ago