So there's a pretty useless number called the delectable number. A delectable number has nine digits, using the numbers 1-9 once in each digit. The first digit of a delectable number must be divisible by one. The first and second digits must be divisible by two, the first through third must be divisible by three, etc. There has only been one delectable number discovered: 381654729. The question I want to ask is whether there exists delectable numbers in bases other than ten. For example, base 16; could there be a 15-digit number such that all digits 1-F are use and the first digit is divisible by 1, the first 2 by 2... the first F by F etc. Anyone have any way of finding these?
2026-03-27 22:03:52.1774649032
Delectable numbers in other bases
1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in NUMBER-SYSTEMS
- Why do we can't replace binary numbers with decimal like we do in hexadecimal and octal?
- How many numerals (unique glyphs) do we use to note a number in a non-integer base numeral system?
- How to convert from base 4 to base 16?
- Find possible bases of an operation
- What is the logic behind the octal to decimal conversion using the expansion method?
- Why the hexadecimal numbers can be converted directly into binary numbers so cleanly?
- Base 17 on a Suanpan (Chinese abacus)
- How to Prove Square Number?
- Multiplication of two number in 2's complement
- We know that $2^0$=1 but why $(-2)^0$=not 1
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
This is only a partial answer: There are no "delectable" numbers base $b$ if $b$ is odd.
The proof is based on the elementary generalization of casting out $9$'s, namely a number written base $b$ is divisible by $b-1$ if and only if the sum of its base-$b$ digits is divisible by $b-1$. But if $b=2m+1$, then $b-1=2m$ does not divide $1+2+\cdots+(2m)={(2m)(2m+1)\over2}=m(2m+1)$. So even if a number appears delectable for the first $b-2$ divisions, it's guaranteed to go sour at the end.
As for even bases, the first few are fairly easy:
$$\begin{align} \text{base }2:&\quad1\\ \text{base }4:&\quad123,321\\ \text{base }6:&\quad14325,54321 \end{align}$$
After that, it gets a little hairy. For base $8$, it's easy to see that delectable numbers must be of the form _2_4_6_ or _6_4_2_, where the _'s are to be filled with the odd digits 1,3,5, and 7, so at worst there are $48$ ($=2\cdot4!$) possibilities to pick through. But naively, at least, it looks like the amount of searching will grow factorially, so even by the time you get to base $16$, you've got something on the order of $7!8!$ numbers to look at -- small enough for a computer to handle, but verging on the unmanagable in the absence of additional ideas.
Remark: I was a little surprised to find that googling on the OP's number 381654729 didn't turn up much that was relevant; to be sure, it gives hits for "polydivisible" numbers, but little that pertains to the question at hand.