PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
Zuckerman number (Definition)

Consider the integer 384. Multiplying its digits, $$3 \times 8 \times 4 = 96$$ and $${{384} \over {96}} = 91.$$

When an integer is divisible by the product of its digits, it's called a Zuckerman number. That is, given $m$ is the number of digits of $n$ and $d_x$ (for $x \le k$ is an integer of $n$

$${\prod_{i = 1}^m d_i}|n$$

All 1-digit numbers and the base number itself are Zuckerman numbers.

It is possible for an integer to be divisible by its multiplicative digital root and yet not be a Zuckerman number because it doesn't divide its first digit product evenly (for example, 1728 in base 10 has multiplicative digital root 2 but is not divisible by $1 \times 7 \times 2 \times 8 = 112$ . The reverse is also possible (for example, 384 is divisible by 96, as shown above, but clearly not by its multiplicative digital root 0).

Bibliography

1
J. J. Tattersall, Elementary number theory in nine chapters, p. 86. Cambridge: Cambridge University Press (2005)




"Zuckerman number" is owned by CompositeFan. [ owner history (2) ]
(view preamble | get metadata)

View style:

Log in to rate this entry.
(view current ratings)

Cross-references: divide, multiplicative digital root, base, number, product, divisible, digits, integer

This is version 1 of Zuckerman number, born on 2006-07-11.
Object id is 8134, canonical name is ZuckermanNumber.
Accessed 1520 times total.

Classification:
AMS MSC11A63 (Number theory :: Elementary number theory :: Radix representation; digital problems)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)