Vampire number

Last updated

In recreational mathematics, a vampire number (or true vampire number) is a composite natural number with an even number of digits, that can be factored into two natural numbers each with half as many digits as the original number, where the two factors contain precisely all the digits of the original number, in any order, counting multiplicity. The two factors cannot both have trailing zeroes. The first vampire number is 1260 = 21 × 60. [1] [2]

Contents

Definition

Let be a natural number with digits:

Then is a vampire number if and only if there exist two natural numbers and , each with digits:

such that , and are not both zero, and the digits of the concatenation of and are a permutation of the digits of . The two numbers and are called the fangs of .

Vampire numbers were first described in a 1994 post by Clifford A. Pickover to the Usenet group sci.math, [3] and the article he later wrote was published in chapter 30 of his book Keys to Infinity. [4]

Examples

nCount of vampire numbers of length n
47
6148
83228
10108454
124390670
14208423682
1611039126154

1260 is a vampire number, with 21 and 60 as fangs, since 21 × 60 = 1260 and the digits of the concatenation of the two factors (2160) are a permutation of the digits of the original number (1260).

However, 126000 (which can be expressed as 21 × 6000 or 210 × 600) is not a vampire number, since although 126000 = 21 × 6000 and the digits (216000) are a permutation of the original number, the two factors 21 and 6000 do not have the correct number of digits. Furthermore, although 126000 = 210 × 600, both factors 210 and 600 have trailing zeroes.

The first few vampire numbers are:

1260 = 21 × 60
1395 = 15 × 93
1435 = 35 × 41
1530 = 30 × 51
1827 = 21 × 87
2187 = 27 × 81
6880 = 80 × 86
102510 = 201 × 510
104260 = 260 × 401
105210 = 210 × 501

The sequence of vampire numbers is:

1260, 1395, 1435, 1530, 1827, 2187, 6880, 102510, 104260, 105210, 105264, 105750, 108135, 110758, 115672, 116725, 117067, 118440, 120600, 123354, 124483, 125248, 125433, 125460, 125500, ... (sequence A014575 in the OEIS )

There are many known sequences of infinitely many vampire numbers following a pattern, such as:

1530 = 30 × 51, 150300 = 300 × 501, 15003000 = 3000 × 5001, ...

Al Sweigart calculated all the vampire numbers that have at most 10 digits. [5]

Multiple fang pairs

A vampire number can have multiple distinct pairs of fangs. The first of infinitely many vampire numbers with 2 pairs of fangs:

125460 = 204 × 615 = 246 × 510

The first with 3 pairs of fangs:

13078260 = 1620 × 8073 = 1863 × 7020 = 2070 × 6318

The first with 4 pairs of fangs:

16758243290880 = 1982736 × 8452080 = 2123856 × 7890480 = 2751840 × 6089832 = 2817360 × 5948208

The first with 5 pairs of fangs:

24959017348650 = 2947050 × 8469153 = 2949705 × 8461530 = 4125870 × 6049395 = 4129587 × 6043950 = 4230765 × 5899410

Variants

Pseudovampire numbers (disfigurate vampire numbers) are similar to vampire numbers, except that the fangs of an n-digit pseudovampire number need not be of length n/2 digits. Pseudovampire numbers can have an odd number of digits, for example 126 = 6 × 21.

More generally, more than two fangs are allowed. In this case, vampire numbers are numbers n which can be factorized using the digits of n. For example, 1395 = 5 × 9 × 31. This sequence starts (sequence A020342 in the OEIS ):

126, 153, 688, 1206, 1255, 1260, 1395, ...

A vampire prime or prime vampire number, as defined by Carlos Rivera in 2002, [6] is a true vampire number whose fangs are its prime factors. The first few vampire primes are:

117067, 124483, 146137, 371893, 536539

As of 2007 the largest known is the square (94892254795 × 10103294 + 1)2, found by Jens K. Andersen in September, 2007. [2]

A double vampire number is a vampire number which has fangs that are also vampire numbers, an example of such a number is 1047527295416280 = 25198740 × 41570622 = (2940 × 8571) × (5601 × 7422) which is the smallest double vampire number.

A Roman numeral vampire number is vampire number that uses Roman numerals instead of base-10. An example of this number is II × IV = VIII.

Other bases

Vampire numbers also exist for bases other than base 10. For example, a vampire number in base 12 is 10392BA45768 = 105628 × BA3974, where A means ten and B means eleven. Another example in the same base is a vampire number with three fangs, 572164B9A830 = 8752 × 9346 × A0B1. An example with four fangs is 3715A6B89420 = 763 × 824 × 905 × B1A. In these examples, all 12 digits are used exactly once.

See also

Related Research Articles

In mathematics, the factorial of a non-negative integer , denoted by , is the product of all positive integers less than or equal to . The factorial of also equals the product of with the next smaller factorial:

<span class="mw-page-title-main">Fibonacci sequence</span> Numbers obtained by adding the two previous ones

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted Fn. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes from 1 and 2. Starting from 0 and 1, the first few values in the sequence are:

A palindromic number is a number that remains the same when its digits are reversed. In other words, it has reflectional symmetry across a vertical axis. The term palindromic is derived from palindrome, which refers to a word whose spelling is unchanged when its letters are reversed. The first 30 palindromic numbers are:

<span class="mw-page-title-main">Parity (mathematics)</span> Property of being an even or odd number

In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not. For example, −4, 0, 82 are even because

<span class="mw-page-title-main">Square number</span> Product of an integer with itself

In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals 32 and can be written as 3 × 3.

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit. The term stands for "repeated unit" and was coined in 1966 by Albert H. Beiler in his book Recreations in the Theory of Numbers.

<span class="mw-page-title-main">Clifford A. Pickover</span> American novelist

Clifford Alan Pickover is an American author, editor, and columnist in the fields of science, mathematics, science fiction, innovation, and creativity. For many years, he was employed at the IBM Thomas J. Watson Research Center in Yorktown, New York, where he was editor-in-chief of the IBM Journal of Research and Development. He has been granted more than 700 U.S. patents, is an elected Fellow for the Committee for Skeptical Inquiry, and is author of more than 50 books, translated into more than a dozen languages.

<span class="mw-page-title-main">Power of two</span> Two raised to an integer power

A power of two is a number of the form 2n where n is an integer, that is, the result of exponentiation with number two as the base and integer n as the exponent.

73 (seventy-three) is the natural number following 72 and preceding 74. In English, it is the smallest natural number with twelve letters in its spelled out name.

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.

A powerful number is a positive integer m such that for every prime number p dividing m, p2 also divides m. Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a2b3, where a and b are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful.

A Friedman number is an integer, which represented in a given numeral system, is the result of a non-trivial expression using all its own digits in combination with any of the four basic arithmetic operators (+, −, ×, ÷), additive inverses, parentheses, exponentiation, and concatenation. Here, non-trivial means that at least one operation besides concatenation is used. Leading zeros cannot be used, since that would also result in trivial Friedman numbers, such as 024 = 20 + 4. For example, 347 is a Friedman number in the decimal numeral system, since 347 = 73 + 4. The decimal Friedman numbers are:

A divisibility rule is a shorthand and useful way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers. Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in Scientific American.

In number theory, Kaprekar's routine is an iterative algorithm named after its inventor, Indian mathematician D. R. Kaprekar. Each iteration starts with a number, sorts the digits into descending and ascending order, and calculates the difference between the two new numbers.

5 (five) is a number, numeral and digit. It is the natural number, and cardinal number, following 4 and preceding 6, and is a prime number. It has garnered attention throughout history in part because distal extremities in humans typically contain five digits.

In number theory, a factorion in a given number base is a natural number that equals the sum of the factorials of its digits. The name factorion was coined by the author Clifford A. Pickover.

The digits of some specific integers permute or shift cyclically when they are multiplied by a number n. Examples are:

<span class="mw-page-title-main">Bit-reversal permutation</span> Permutation that reverses binary numbers

In applied mathematics, a bit-reversal permutation is a permutation of a sequence of items, where is a power of two. It is defined by indexing the elements of the sequence by the numbers from to , representing each of these numbers by its binary representation, and mapping each item to the item whose representation has the same bits in the reversed order.

<span class="mw-page-title-main">Telephone number (mathematics)</span> Number of ways to pair up n objects

In mathematics, the telephone numbers or the involution numbers form a sequence of integers that count the ways n people can be connected by person-to-person telephone calls. These numbers also describe the number of matchings of a complete graph on n vertices, the number of permutations on n elements that are involutions, the sum of absolute values of coefficients of the Hermite polynomials, the number of standard Young tableaux with n cells, and the sum of the degrees of the irreducible representations of the symmetric group. Involution numbers were first studied in 1800 by Heinrich August Rothe, who gave a recurrence equation by which they may be calculated, giving the values

A schizophrenic number or mock rational number is an irrational number that displays certain characteristics of rational numbers.

References

  1. Weisstein, Eric W. "Vampire Numbers". MathWorld .
  2. 1 2 Andersen, Jens K. "Vampire numbers".
  3. Pickover's original post describing vampire numbers
  4. Pickover, Clifford A. (1995). Keys to Infinity. Wiley. ISBN   0-471-19334-8.
  5. Sweigart, Al. "Vampire Numbers Visualized".
  6. Rivera, Carlos. "The Prime-Vampire numbers".