Monday, December 6, 2010

Looking at Colton's conjecture

Colton's conjecture :

Zelinsky (2002) proved that there are no refactorable numbers, that is to say, there are no tau numbers x and y such that x - y = 5, and also Colton's conjecture that no three consecutive integers can all be refactorable.





No comments:

Post a Comment