Multiplicative digital root
- Multiplicative digital root
-
The multiplicative digital root of a positive integer n is found by multiplying the digits of n together, then repeating this operation until only a single digit remains. This single digit number is called the multiplicative digital root of n.[1]
Multiplicative digital roots obviously depend upon the base in which n is written. If the term is used without qualification, it is assumed that n is written in base 10.
Multiplicative digitial roots are the multiplicative equivalent of digital roots.
Example
9876 would be reduced as 9876 -> 9x8x7x6 = 3024 -> 3x0x2x4 = 0. So the multiplicative digital root of 9876 is 0 and its multiplicative persistence (the number of steps required to reach a single digit) is 2.
References
- ^ Weisstein, Eric W., "Multiplicative Persistence" from MathWorld.
Wikimedia Foundation.
2010.
Look at other dictionaries:
Querprodukt — Das Querprodukt einer natürlichen Zahl ist – analog zur Quersumme – das Produkt ihrer Ziffernwerte. Ebenso wie die Quersumme ist auch das Querprodukt zahlensystemabhängig. Das dezimale Querprodukt von 5496 ist beispielsweise 5·4·9·6 = 1080. Im… … Deutsch Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
Persistence of a number — In mathematics, the persistence of a number is a term used to describe the number of times one must apply a given operation to an integer before reaching a fixed point, i.e. until further application does not change the number any more. Usually,… … Wikipedia
Complex number — A complex number can be visually represented as a pair of numbers forming a vector on a diagram called an Argand diagram, representing the complex plane. Re is the real axis, Im is the imaginary axis, and i is the square root of –1. A complex… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
RSA — In cryptography, RSA is an algorithm for public key cryptography. It is the first algorithm known to be suitable for signing as well as encryption, and one of the first great advances in public key cryptography. RSA is widely used in electronic… … Wikipedia
Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… … Wikipedia
Trigonometry in Galois fields — In mathematics, the theory of quadratic extensions of finite fields supports analogies with trigonometry.The main motivation to deal with a finite field trigonometry is the power of the discrete transforms, which play an important role in… … Wikipedia
Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) … Wikipedia
BCH code — In coding theory the BCH codes form a class of parameterised error correcting codes which have been the subject of much academic attention in the last fifty years. BCH codes were invented in 1959 by Hocquenghem, and independently in 1960 by Bose… … Wikipedia
