Fun with num3ers
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.
http://www.cs.uwaterloo.ca/journals/JIS/colton/joisol.html
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment