Question: A Number Theory Conjecture about Smoothness

Hi Maple Experts and all,


There is a conjecture from a book written in 1986.

This conjecture states that

"Given any four consecutive integers greater than 11, there is at least one of them that is divisible by a prime greater than 11."

Is anyone willing to write Maple code to test this up to a reasonable numerical limit?

See a discussion thread

I imagine the ifactor() command and loops.  I'm not that good at coding.




Please Wait...