Strictly non-palindromic number: Difference between revisions

Revision as of 16:56, 10 January 2006

Revision as of 22:20, 24 January 2006

Line 5:

:[[1 (number)|1]], [[2 (number)|2]], [[3 (number)|3]], [[4 (number)|4]], [[6 (number)|6]], [[11 (number)|11]], [[19 (number)|19]], [[47 (number)|47]], [[53 (number)|53]], [[79 (number)|79]], [[103 (number)|103]], [[137 (number)|137]], [[139 (number)|139]], [[149 (number)|149]], [[163 (number)|163]], [[167 (number)|167]], 179, 223, 263, 269, 283, 293, …

To test whether a number ''n'' is strictly non-palindromic, it must be verified that ''n'' is non-palindromic in all bases up to ''n'' − 2. The reasons for thesethis upper limit are:

*any ''n'' ≥ 3 is written 11 in base ''n'' − 1, so ''n'' is palindromic in base ''n'' − 1;

*any ''n'' ≥ 2 is written 10 in base ''n'', so any ''n'' is non-palindromic in base ''n'';