Strictly non-palindromic number

from Wikipedia, the free encyclopedia

A strictly non-palindromic number is a natural number that is not a number palindrome in any place value system , the basis of which is in the range .

The upper limit on the size of the base is necessary to keep the sequence nontrivial, since

  • each number (greater than 1) is written as a single-digit (also palindromic) number for each base ;
  • every number (greater than 2) to the base is written as , i.e. non-palindromic;
  • every number (greater than 3) to the base is written as (palindromic).

For the set of bases is empty, so these numbers are trivially also strictly non-palindromic.

Examples

For example, the (decimal) number 6 is written

  • to base two: 110,
  • to base three: 20 and
  • to base four: 12

Since none of these spellings are palindromic, 6 is strictly non-palindromic.

The sequence of strictly non-palindromic numbers begins with

0, 1, 2, 3, 4, 6, 11, 19, 47, 53, 79, 103, 137, 139, 149, 163, 167, 179, 223, 263, 269, 283, 293, ...

properties

All strictly non-palindromic numbers greater than 6 are prime numbers . For every composite number , a base can be found that is palindromic.

proof

  1. If is even , then the base is written as 22 (palindromic).
  2. Otherwise is odd and can be written as , where the smallest prime factor is. Understandably then .
  • If then , then is what is written for base 2 as 1001 (palindromic).
  • If then , the base is written as 121 (palindromic).
Otherwise is . The case cannot occur because both and are odd.
In this case, the two-digit number (palindromic) is written to the base .

In each of these cases the base is in the range .

Individual evidence

  1. Follow A016038 in OEIS