Let
(n,n+1,n+2) represent a triplet of consecutive numbers, each having
5 distinct prime factors.
Find tne value of the lowest n.
(In reply to
computer solution by Charlie)
Interesting. I had a look at this before deciding it was too difficult.
I had read '5 distinct prime factors' as being nonpowered factors, since a factor that repeats is not distinct. This would imply divisibility of the central number of the triplet by exactly 2.
However, none of the triplets given has that form.
Is this a feature of such triplets, or is it just that the search needs to be prolonged?

Posted by broll
on 20150702 22:23:37 