Hello David,

> Here is a puzzle about sequences of 5 consecutive integers.

>

> Definition: A sequence of consecutive positive

> integers, beginning with N, has strength

> s = log(N)/log(p), where p is the largest prime

> dividing any integer in the sequence.

as I wrote in

http://tech.groups.yahoo.com/group/primenumbers/message/22884,
it seems that for fixed p maximal N grows nearly as exp(b*sqrt(p)), where b

is a constant depending on the length of the chain, so it's little sense to

use log(N)/log(p) as a measure of the "strength". The better would be

log(N)/sqrt(p), and the largest currently known for 5 integers is

log(1517)/sqrt(41) = 1.14389...

Best regards,

Andrey