30 Apr
2015
30 Apr
'15
11:23 a.m.
A quick Python hack says, for base=10 and n=6, there's no path connecting 100003 and 294001 (disallowing 0 as a leading digit for any intermediate values). Of couse, that's assuming I didn't make a mistake, so feel free to prove me wrong... Tom James Propp writes:
For what values of n is it possible to get from every n-digit prime number to every other by way of a succession of single-digit alterations?
It's trivially true for n=1, and it's also true for n=2 since every 2-digit prime remains prime if you change its first digit to a 1.
Jim Propp _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun