|
Problems & Puzzles:
Puzzles
|
Puzzle 1290. Triple Sliding Primes Puzzle
On Oct 30, 2026, Tesfamichael sent the following nice puzzle:
Start
with the smallest prime (2) and consider sets of three consecutive primes in
a sliding manner. That means: (P1, P2, P3), (P2, P3, P4), (P3, P4, P5),
and so on.
(P1, P2, P3) = (2, 3, 5). 1. Calculate P1*P2 + P2*P3 +
P1*P3. If prime, proceed to (P2, P3, P4) 2. Calculate P2*P3 + P3*P4 +
P2*P4. If prime, proceed to (P3, P4, P5) and so on 3. Check the streak of
primes before encountering composite.
For example, staring with
(2, 3, 5): 2*3 + 2*5 + 3*5 = 31 (Prime) 3*5 + 3*7 + 5*7 = 71 (Prime)
5*7 + 5*11 + 7*11 = 167 (Prime) 7*11 + 7*13 + 11*13 = 311 (Prime)
11*13 + 11*17 + 13*17 = 551 = 19*29 (Composite)
Hence, the streak
breaks after 4 successful primes.
Following the same process, the
following has been discovered:
Smallest Starting Prime (p) Prime
Streak (k) 2. 4 1378,. 5 1860763, 6 1900949951, 7 2280561797,
8
Q1. Find the smallest starting
prime for a streak of 9. Q2. Is there a better smallest starting prime
(P1), instead of 2, and longer streaks can be achieved?
|
|
|
|
|
|

|