polydivisible number

Given a base b integer n with k digits d1,,dk, consider dk the least significant digit and d1, to suit our purpose in this case. If for each 1<j<k it is the case that


then n is said to be a polydivisible number.

A reasonably good estimate of how many polydivisible numbers base b has is


In any given base, there is only one polydivisible number that is also a pandigital number.

Title polydivisible number
Canonical name PolydivisibleNumber
Date of creation 2013-03-22 16:22:20
Last modified on 2013-03-22 16:22:20
Owner CompositeFan (12809)
Last modified by CompositeFan (12809)
Numerical id 5
Author CompositeFan (12809)
Entry type Definition
Classification msc 11A63