To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Multiplicative digital root

From Wikipedia, the free encyclopedia

In number theory, the multiplicative digital root of a natural number in a given number base is found by multiplying the digits of together, then repeating this operation until only a single-digit remains, which is called the multiplicative digital root of .[1][2] The multiplicative digital root for the first few positive integers are:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 4, 6, 8, 0, 2, 4, 6, 8, 0, 3, 6, 9, 2, 5, 8, 2, 8, 4, 0. (sequence A031347 in the OEIS)

Multiplicative digital roots are the multiplicative equivalent of digital roots.

YouTube Encyclopedic

  • 1/5
    Views:
    14 526
    40 598
    21 684
    652
    3 658
  • Using the digital root to check multiplication problems
  • How to find a digital root
  • Digital Logic - Multiplication division and square roots
  • Verify number Multiplication using Digital Root technique
  • Uses of Digital Root | Vedic Method to Verify Answers Quickly | Sruthi Lakshmi Karupaiah

Transcription

Definition

Let be a natural number. We define the digit product for base to be the following:

where is the number of digits in the number in base , and

is the value of each digit of the number. A natural number is a multiplicative digital root if it is a fixed point for , which occurs if .

For example, in base , 0 is the multiplicative digital root of 9876, as

All natural numbers are preperiodic points for , regardless of the base. This is because if , then

and therefore

If , then trivially

Therefore, the only possible multiplicative digital roots are the natural numbers , and there are no cycles other than the fixed points of .

Multiplicative persistence

The number of iterations needed for to reach a fixed point is the multiplicative persistence of . The multiplicative persistence is undefined if it never reaches a fixed point.

In base 10, it is conjectured that there is no number with a multiplicative persistence : this is known to be true for numbers .[3][4] The smallest numbers with persistence 0, 1, ... are:

0, 10, 25, 39, 77, 679, 6788, 68889, 2677889, 26888999, 3778888999, 277777788888899. (sequence A003001 in the OEIS)

The search for these numbers can be sped up by using additional properties of the decimal digits of these record-breaking numbers. These digits must be sorted, and, except for the first two digits, all digits must be 7, 8, or 9. There are also additional restrictions on the first two digits. Based on these restrictions, the number of candidates for -digit numbers with record-breaking persistence is only proportional to the square of , a tiny fraction of all possible -digit numbers. However, any number that is missing from the sequence above would have multiplicative persistence > 11; such numbers are believed not to exist, and would need to have over 20,000 digits if they do exist.[3]

Extension to negative integers

The multiplicative digital root can be extended to the negative integers by use of a signed-digit representation to represent each integer.

Programming example

The example below implements the digit product described in the definition above to search for multiplicative digital roots and multiplicative persistences in Python.

def digit_product(x: int, b: int) -> int:
    if x == 0:
        return 0
    total = 1
    while x > 1:
        if x % b == 0:
            return 0
        if x % b > 1:
            total = total * (x % b)
        x = x // b
    return total


def multiplicative_digital_root(x: int, b :int) -> int:
    seen = []
    while x not in seen:
        seen.append(x)
        x = digit_product(x, b)
    return x


def multiplicative_persistence(x: int, b: int) -> int:
    seen = []
    while x not in seen:
        seen.append(x)
        x = digit_product(x, b)
    return len(seen) - 1

See also

References

  1. ^ Weisstein, Eric W. "Multiplicative Digital Root". MathWorld.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A031347". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ a b Sloane, N. J. A. (ed.). "Sequence A003001". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ Weisstein, Eric W. "MultiplicativePersistence". MathWorld.

Literature

External links

This page was last edited on 22 January 2023, at 03:45
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.