Affluent Savvy
Photo by KoolShooters Pexels Logo Photo: KoolShooters

What are immortal numbers?

The immortal numbers were defined and researched by Daniel Marschall and are defined as integers, which contain themselves as suffix when raised to a power.

misc.daniel-marschall.de - Immortal numbers - Daniel Marschall
What is the unlucky color for 2022?
What is the unlucky color for 2022?

Unlucky numbers: 6, 7, and 8 and numbers containing them (like 67 and 87) Unlucky color: brown. Nov 11, 2022

Read More »
Last updated Jun 2, 2021
Can any job make you a billionaire?
Can any job make you a billionaire?

Quite frankly, there are certain jobs that will make you a billionaire. At the same time, a job title is not a guarantee for wealth. Indeed, it...

Read More »
Last updated May 3, 2018
Awaken your dormant DNA ability to attract wealth effortlessly
Awaken your dormant DNA ability to attract wealth effortlessly

The simple yet scientifically proven Wealth DNA method laid out in the report allows you to effortlessly start attracting the wealth and abundance you deserve.

Learn More »
Promotion

Immortal numbers

Last update: 27 December 2020

The immortal numbers were defined and researched by Daniel Marschall and are defined as integers, which contain themselves as suffix when raised to a power.

Table of contents

1. Definitions

1.0 Digit count function

In this document we use following function that counts the amount of digits of an integer n ∈ ℤ , represented in base b ∈ ℕ ∖ { 0 , 1 } : Υ b ⁢ ( n ) = ⌊ log b ⁡ ( ∣ n ∣ ) + 1 ⌋

1.1 Simple case (base 10, power 2)

Definition: A number n ∈ ℕ 0 is "immortal" (with power 2 at base 10), if it satisfies following equation:

n 2 ≡ n mod 10 Υ 10 ⁢ ( n )

Example: The number 625 is immortal at base 10, because 625 x 625 = 390 625

1.2 General case (base b, power p)

Definition: A number n ∈ ℕ 0 is "immortal" with power p ∈ ℕ ∖ { 0 , 1 } at base b ∈ ℕ ∖ { 0 , 1 } , if it satisfies following equation:

n p ≡ n mod b Υ b ⁢ ( n )

Example: The number 2047 ( 3777 (8) ) is immortal with power 3 at base 8 , because 3777 (8) 3 = 7772001 3777 (8) A more general case with complex numbers and negative numbers can be found here.

1.3 Set of immortal numbers

The set 𝕄 b p contains all immortal numbers with power p at base b .

Definition:

n ∈ 𝕄 b p ⇔ n p ≡ n mod b Υ b ⁢ ( n )

Example: 625 ∈ 𝕄 10 2

1.4 Immortality of base/power-tuples

The "immortality" of a ( b , p ) tuple is defined by the amount of immortal numbers divided by the maximum length of these numbers. The higher the maximum length is chosen, the more accurate is the immortality. The unit of measurement can be optionally written as I D ("Immortals per Digit"). Since the numbers { 0 , 1 } are always immortal, they will be exluded from this calculation.

Formal definition:

| 𝕄 b p | ∗ := lim L → ∞ ⁡ [ 1 L ⋅ | { n ∈ 𝕄 b p ∩ ℕ | 1 < n < b L } | ] Example: For base 10, power 3, there are 1176 immortal numbers with length of 1..100 digits, exluding 0 and 1. The immortality of ( 10 , 3 ) is therefore approximately | 𝕄 10 3 | ∗ ≈ 1176 100 = 11.76 Here you can find a plot that compares the immortality of various ( b , p ) tuples.

1.5 Pseudo immortal base/power-tuples

There are base/power-tuples ( b , p ) where only the numbers 𝕄 b p = { 0 , 1 } are immortal. These base/power-tuples are called "pseudo-immortal". An example is ( 9 , 2 ) . Their immortality is zero | 𝕄 b p | ∗ = 0 because: | { 0 , 1 } | ∗ = lim L → ∞ ⁡ [ 1 L ⋅ | { n ∈ { 0 , 1 } | 1 < n < b L } | ] = lim L → ∞ ⁡ [ 1 L ⋅ | { } | ] = 0 Here you can find a plot that shows the ( b , p ) values of some pseudo-immortals.

1.6 Super immortal numbers

Super immortal numbers are numbers which are immortal to every ( b , p ) tuple. Only the numbers { 0 , 1 } satisfy this property (see proof). 𝕄 s := ⋂ b = 2 ∞ ⋂ p = 2 ∞ 𝕄 b p = { 0 , 1 }

2. Branch graph notation

Immortal numbers can be written in graph with "branches".

In base 10, power 2, things are quite easy: There are only 4 branches 0, 1, 5 and 6. The branches 0 and 1 are trivial branches and have no children. In branch 5, the immortal numbers are 5, 25, 625, 90625, 890625, 2890625, 12890625, 212890625, 8212890625, ... In branch 6, the immortal numbers are 6, 76, 376, 9376, 109376, 7109376, 87109376, 787109376, 1787109376, ... In this case, immortal numbers of base 10 power 2 can be generated using a tree node and adding a single digit in front of it. Additionally, the sum of the pairs of digits below branch 5 and 6 always add up to 9.

However, there are more complex graphs, for example base 10, power 3:

Credits: The graphs were created with mind-map-online.de

3. Immortal number search

3.1 Base 10, power 2

There has been a huge effort to find immortal numbers with several million digits. A special algorithm, optimized extensively using SSE/MMX technology, has been written to archive this task. On July, 9th 2019, the immortal number of base 10, power 2 with 1.1 billion digits was found and on March, 30th 2020, the result was double-verified.

Download the giant immortal numbers:

Credits: The search for giant immortal numbers at base-10-power-2 were only made possible by the users of the matheboard.de thread who contributed the algorithm for finding base-10-power-2 numbers as well as the contributor of this StackOverflow question who has showed me how to speed up the algorithm using SSE/MMX instructions.

3.2 Base b, power p

A rather trivial search algorithm has been developed to find all immortal numbers between base 2 and 36 and power 2 till 10, with a maximum length of 100 digits.

Python source code

Get a list of immortal numbers with max length 100 digits, for powers 2 till 10, with following base: 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

3.3 Calculation using Chinese Remainder Theorem (power 2)

English: German: We want to find all x ∈ 𝕄 b 2 b ∈ ℕ ≥ 2 (1) Let ω ⁢ ( b ) ∈ ℕ be the number of unique prime factors of b and the the prime decomposition of b be: b = ∏ i = 1 ω ⁢ ( b ) ( p i ) ( e i ) with e i being the valuation (how many times n can be divded by p i ) e i := v p i ⁢ ( b ) , e i , i ∈ ℕ and p i ∈ ℙ , p 1 < p 2 < … < p ω ⁢ ( b ) , p i ≠ p j ⁢ ∀ i ≠ j . (2) Let m ∈ ℕ be the length of the number we want to find. (3) The congruence equation for an immortal number with power 2, base b and length m can be written as: x 2 ≡ x ( mod b m ) x 2 - x ≡ 0 ( mod b m ) x ⁢ ( x - 1 ) ≡ 0 ( mod b m ) (3b) x and x - 1 are coprime: gcd ⁡ ( x , x - 1 ) = 1 . (3c) Therefore, each ( p i e i ) m , for 1 ≤ i ≤ ω ⁢ ( b ) , must divide into either just x , giving that x ≡ 0 ( mod ( p i e i ) m ) ; or x - 1 , giving that x ≡ 1 ( mod ( p i e i ) m ) . (see additional explanation) (3d) So, the immortal number x for a given length m ∈ ℕ can be found using the following congruence equation: x ≡ a 1 ( mod ( p 1 e 1 ) m ) x ≡ a 2 ( mod ( p 2 e 2 ) m ) ⋮ x ≡ a ω ⁢ ( b ) ( mod ( p ω ⁢ ( b ) e ω ⁢ ( b ) ) m ) simplified: x ≡ a 1 ( mod p 1 e 1 ⋅ m ) x ≡ a 2 ( mod p 2 e 2 ⋅ m ) ⋮ x ≡ a ω ⁢ ( b ) ( mod p ω ⁢ ( b ) e ω ⁢ ( b ) ⋅ m ) with a n ∈ { 0 , 1 } (3e) Only the smallest canonical x of the congruence equation is immortal ( not: x + k ⋅ b m , k ∈ ℤ ). (3f) The permutations of ( a 1 , a 2 , a 3 , … , a ω ⁢ ( b ) ) generate numbers of a specific branch. Example for x ∈ 𝕄 10 2 b = 10 = 2 1 ⋅ 5 1 Therefore: x ≡ a 1 ( mod ( 2 1 ) m ) x ≡ a 2 ( mod ( 5 1 ) m ) Now x can be found using the Chinese Remainder Theorem. The ( a 1 , a 2 ) permutations generate the different branches of the immortal numbers of 𝕄 10 2 : Tuple ( 0 , 0 ) generates branch 0 (only one element: { 0 } ) generates (only one element: ) Tuple ( 0 , 1 ) generates branch 6 (elements { 6 , 76 , 376 , … } for m = 1 , 2 , 3 , … ) generates (elements for ) Tuple ( 1 , 0 ) generates branch 5 (elements { 5 , 25 , 625 , … } for m = 1 , 2 , 3 , … ) generates (elements for ) Tuple ( 1 , 1 ) generates branch 1 (only one element: { 1 } ) Credits: John Omielan for the proof above and why this scheme cannot be easily applied to powers other than 2. Gesucht sind die Zahlen x ∈ 𝕄 b 2 , die zu der Basis b ∈ ℕ ≥ 2 unsterblich sind. (1) Sei ω ⁢ ( b ) ∈ ℕ die Anzahl der verschiedenen Primfaktoren von b und die kanonische Primfaktorzerlegung von b : b = ∏ i = 1 ω ⁢ ( b ) ( p i ) ( e i ) wobei e i die p i -Bewertung von b ist (wie oft b durch p i teilbar ist) e i := v p i ⁢ ( b ) , e i , i ∈ ℕ sowie p i ∈ ℙ , p 1 < p 2 < … < p ω ⁢ ( b ) , p i ≠ p j ⁢ ∀ i ≠ j . (2) m ∈ ℕ sei die Länge der unsterblichen Zahl, die wir suchen.. (3) Die Kongruenzgleichung für die unsterbliche Zahl mit Potenz 2, Basis b und Länge m kann geschrieben werden als: x 2 ≡ x ( mod b m ) x 2 - x ≡ 0 ( mod b m ) x ⁢ ( x - 1 ) ≡ 0 ( mod b m ) (3b) x und x - 1 sind teilerfremd. (3c) Deswegen muss ( p i e i ) m für alle 1 ≤ i ≤ ω ⁢ ( b ) sich entweder durch x teilen (ergibt x ≡ 0 ( mod ( p i e i ) m ) ) oder durch x - 1 (ergibt x ≡ 1 ( mod ( p i e i ) m ) ). (Weitere Erklärungen auf Englisch) (3d) Deswegen gilt die Kongruenzgleichung zur Findung aller x mit jeweils m ∈ ℕ Stellen: x ≡ a 1 ( mod ( p 1 e 1 ) m ) x ≡ a 2 ( mod ( p 2 e 2 ) m ) ⋮ x ≡ a ω ⁢ ( b ) ( mod ( p ω ⁢ ( b ) e ω ⁢ ( b ) ) m ) bzw. x ≡ a 1 ( mod p 1 e 1 ⋅ m ) x ≡ a 2 ( mod p 2 e 2 ⋅ m ) ⋮ x ≡ a ω ⁢ ( b ) ( mod p ω ⁢ ( b ) e ω ⁢ ( b ) ⋅ m ) mit a n ∈ { 0 , 1 } (3e) Die unsterbliche Zahl der kleinste kanonische Wert x der Kongruenzgleichung ist ( nicht x + k ⋅ b m , k ∈ ℤ ). (3f) Die Permutationen von ( a 1 , a 2 , a 3 , … , a ω ⁢ ( b ) ) erzeugen unsterbliche Zahlen eines bestimmten Stamms. Beispiel für x ∈ 𝕄 10 2 b = 10 = 2 1 ⋅ 5 1 Es ergibt sich damit folgende Kongruenzgleichung: x ≡ a 1 ( mod ( 2 1 ) m ) x ≡ a 2 ( mod ( 5 1 ) m ) x kann mit dem Chinesischem Restsatz gefunden werden. Die ( a 1 , a 2 ) Permutationen erzeugen die verschiedenen Stämme der unsterblichen Zahlen von 𝕄 10 2 : Tupel ( 0 , 0 ) generiert Stamm 0 (nur ein Element: { 0 } ) generiert (nur ein Element: ) Tupel ( 0 , 1 ) generiert Stamm 6 (Elemente { 6 , 76 , 376 , … } für m = 1 , 2 , 3 , … )

What is the flower of abundance?
What is the flower of abundance?

Peonies. Peony is one of the flowers that symbolize prosperity, wealth and good fortune. Aside from that, it also symbolizes dignity, honor and...

Read More »
Last updated May 28, 2018
What is the powerful birthstone?
What is the powerful birthstone?

At long last, we have landed on the most valuable birthstone – the ruby. Rubies convey passion and love. The deep red color of the ruby is thought...

Read More »
Last updated May 5, 2019
Awaken your dormant DNA ability to attract wealth effortlessly
Awaken your dormant DNA ability to attract wealth effortlessly

The simple yet scientifically proven Wealth DNA method laid out in the report allows you to effortlessly start attracting the wealth and abundance you deserve.

Learn More »
Promotion

generiert (Elemente für ) Tupel ( 1 , 0 ) generiert Stamm 5 (Elemente { 5 , 25 , 625 , … } für m = 1 , 2 , 3 , … ) generiert (Elemente für ) Tupel ( 1 , 1 ) generiert Stamm 1 (nur ein Element: { 1 } )

4. Graphical plots

4.1 Immortal number overview

Python source code

Base 10 filtered:

4.2 Immortality of various (b,p)-tuples

Python source code

A red x denotes an immortality of zero. Dots denote an immortality. The bigger the dots are, the greater is the immortality of 𝕄 b p .

Green dots denote an immortality of ℕ .

Blue dots denote an immortality of ℝ .

4.3 Pseudo immortal base/power tuples

Python source code

5. Miscellaneous proofs, theorems and attributes

5.1 An immortal number with power p is also immortal with power p+k(p-1) We want to prove that 𝕄 b p ⊆ 𝕄 b p + k ⁢ ( p - 1 ) , k ∈ ℕ 0

Let's begin with:

n ∈ 𝕄 b p ⇔ n p ≡ n ( mod b Υ b ⁢ ( n ) ) | ⋅ n p - 1 n p ⋅ n p - 1 ≡ n ⋅ n p - 1 mod b Υ b ⁢ ( n ) n p + p - 1 ≡ n 1 + p - 1 mod b Υ b ⁢ ( n ) n p + ( p - 1 ) ≡ n p mod b Υ b ⁢ ( n )

With mathematical induction we can now prove that

n p + k ⁢ ( p - 1 ) ≡ n p + ( k - 1 ) ⁢ ( p - 1 ) ≡ … ≡ n p + ( p - 1 ) ≡ n p ≡ n mod b Υ b ⁢ ( n )

therefore

n ∈ 𝕄 b p + k ⁢ ( p - 1 ) ⇔ n ∈ 𝕄 b p + ( k - 1 ) ⁢ ( p - 1 ) ⇔ … ⇔ n ∈ 𝕄 b p + ( p - 1 ) ⇔ n ∈ 𝕄 b p Since all immortal numbers of power p are also immortal in power p + k ⁢ ( p - 1 ) , we have now proven that 𝕄 b p ⊆ 𝕄 b p + k ⁢ ( p - 1 ) ■

5.2 Theorem of complete immortality

Theorem: For every number n ∈ ℕ 0 there is a tuple ( b , p ) so that n ∈ 𝕄 b p . In other words, every number is immortal to some specific base and power. ∀ n ∈ ℕ 0 ⁢ ∃ ( b , p ) : n ∈ 𝕄 b p

Note: The theorem of complete immortality also leads to the conclusion:

⋃ b = 2 ∞ ⋃ p = 2 ∞ 𝕄 b p = ℕ 0

Proof:

(0) Let n ∈ ℕ 0 with an arbitary value.

(1) Let b be a prime b ∈ ℙ that is not a prime factor of n ( n ∤ b ), then m := b Υ b ⁢ ( n ) is not a prime factor of n either ( n ∤ m ). In other words: gcd ⁡ ( b , n ) = 1 ⇒ gcd ⁡ ( m , n ) = 1 . (2) Since we have gcd ⁡ ( m , n ) = 1 , we can create following term using the Fermat-Euler theorem:

n φ ⁢ ( m ) ≡ 1 mod m

Transforming it a bit, we get:

n φ ⁢ ( m ) ≡ 1 ( mod m ) | ⋅ n

n φ ⁢ ( m ) ⋅ n ≡ n mod m

n φ ⁢ ( m ) + 1 ≡ n mod m

(3) If we now define p := φ ⁢ ( m ) + 1 and insert the definition of m from above, then we get:

n p ≡ n mod b Υ b ⁢ ( n )

which is equivalent to:

n ∈ 𝕄 b p ■

Credits: Many thanks to Finn from matheboard.de for showing me how to prove this theorem!

5.3 The only super-immortals are 0 and 1

We want to prove that the only super-immortals are 0 and 1.

𝕄 s := ⋂ b = 2 ∞ ⋂ p = 2 ∞ 𝕄 b p = { 0 , 1 } (1) First, we verify that 0 and 1 are immortal to every b , p ∈ ℕ ∖ { 0 , 1 } : (1.1) ∀ b , p ≥ 2 : 0 p = 0 ⇒ 0 p ≡ 0 mod b Υ b ⁢ ( n ) ⇒ 0 ∈ 𝕄 b p (1.2) ∀ b , p ≥ 2 : 1 p = 1 ⇒ 1 p ≡ 1 mod b Υ b ⁢ ( n ) ⇒ 1 ∈ 𝕄 b p (2) To prove that the only super-immortals are 0 and 1, we want to find a ( b , p ) tuple for every n > 1 that will cause n ∉ 𝕄 b p : ∀ n ∈ ℕ ∖ { 0 , 1 } ⁢ ∃ ( b , p ) : n ∉ 𝕄 b p ; b , p ∈ ℕ ∖ { 0 , 1 }

(3) The definition of an immortal number is

n p ≡ n mod b Υ b ⁢ ( n )

We can see that a number can only be immortal if n p is a number that has more digits (in the notation of base b ) than n . (4) If we choose a high enough base b , then n and n p would have the same amounts of digits, and therefore n could not be immortal. So, we need to find a b , so that b Υ b ⁢ ( n ) > n p .

If we choose b := n p , we get:

n p Υ ( n p ) ⁢ ( n ) > n p n p ⌊ log n p ⁡ ( n ) + 1 ⌋ > n p n p + ⌊ log n p ⁡ ( n ) + 1 ⌋ > n p n p + ⌊ ln ⁡ n ln ⁡ n p + 1 ⌋ > n p n p + ⌊ ln ⁡ n p ⋅ ln ⁡ n + 1 ⌋ > n p

n p + ⌊ 1 p + 1 ⌋ > n p

n p + ⌊ 1 p ⌋ + 1 > n p

If p > 1 , then ⌊ 1 p ⌋ = 0 and therefore: n p + 0 + 1 > n p , which is true, if n > 1 .

(5) We continue by taking the general definition of an immortal number

n p ≡ n mod b Υ b ⁢ ( n ) ; b , p ∈ ℕ ∖ { 0 , 1 }

which can also be written as:

( n p mod b Υ b ⁢ ( n ) ) = ( n mod b Υ b ⁢ ( n ) ) Since b Υ b ⁢ ( n ) > n p and b Υ b ⁢ ( n ) > n ( because n p > n if p ≥ 2 ) : ( n p mod b Υ b ⁢ ( n ) ) = ( n mod b Υ b ⁢ ( n ) ) ⇒ n p = n , which is false if p ≥ 2 .

Side note:

( a mod m ) := a - ⌊ a m ⌋ ⋅ m If m > a , then: ( a mod m ) = a - 0 ⋅ m = a

(6) Therefore:

∀ n ∈ ℕ ∖ { 0 , 1 } : n ∉ 𝕄 b := n p p , p ∈ ℕ ∖ { 0 , 1 } ⇔ ∀ n ∈ ℕ ∖ { 0 , 1 } : n ∉ 𝕄 s (7) Bringing together the results of step (1) and (6), we can conclude:

𝕄 s = { 0 , 1 } ■

5.4 Only 0 and 1 are immortal to a base which has only one unique prime in its integer factorization (power 2)

Theorem:

If b ∈ ℙ is prime, or the if the prime decomposition of b consists only of a single prime, then there are no immortal numbers except { 0 , 1 } ∈ 𝕄 b 2 . b = p 1 n 1 ⇒ 𝕄 b 2 = { 0 , 1 }

p 1 ∈ ℙ , n 1 ∈ ℕ 0

Proof:

Since the prime decomposition only consists of a single product p 1 n 1 , there is just one congruence equation (see Solution via Chinese Remainder Theorem above):

x ≡ a 1 mod ( p 1 n 1 ) m

with a 1 = { 0 , 1 } and m ∈ ℕ being the length of x .

Therefore, the solutions of x are { 0 , 1 } ■

6. Extension with complex numbers

6.1 General case (base b, power p) with complex numbers

Definition: A complex number z ∈ { ℂ ∣ ℜ ⁡ ( z ) ∈ ℤ ∧ ℑ ⁡ ( z ) ∈ ℤ } is "immortal" with power p ∈ ℕ ∖ { 0 , 1 } at base b ∈ ℕ ∖ { 0 , 1 } , if it satisfies following equation: z ∈ 𝕄 b p ⇔ | ℜ ( z p ) | ≡ | ℜ ( z ) | ( mod b Υ b ⁢ ( ℜ ⁡ ( z ) ) ) ∧ | ℑ ⁡ ( z p ) | ≡ | ℑ ⁡ ( z ) | mod b Υ b ⁢ ( ℑ ⁡ ( z ) ) This general case also allows negative numbers, e.g. (-313+216i) is immortal with base 10 and power 2, because (- 313 + 216 i)2 = (51 313 -135 216 i).

6.2 Complex immortality of base/power-tuples

How does cinnamon help you lose weight?
How does cinnamon help you lose weight?

Aside from diabetes, cinnamon has shown promise in promoting weight loss. Cinnamon is high in fiber. The spice can therefore help reduce food...

Read More »
Last updated Feb 2, 2022
How do most people get rich?
How do most people get rich?

The stock market is one of the primary sources of income for the rich. Many wealthy individuals invest in stocks and bonds as a way to generate...

Read More »
Last updated Nov 14, 2021
Awaken your dormant DNA ability to attract wealth effortlessly
Awaken your dormant DNA ability to attract wealth effortlessly

The simple yet scientifically proven Wealth DNA method laid out in the report allows you to effortlessly start attracting the wealth and abundance you deserve.

Learn More »
Promotion

The "complex immortality" of a ( b , p ) tuple is defined by the amount of positive complex immortal numbers divided by the maximum length of the imaginary and real part of these complex numbers. The higher the maximum length is chosen, the more accurate is the immortality. The unit of measurement can be optionally written as I D ("Immortals per Digit"). Since the numbers { ( 0 + 0 ⁢ i ) , ( 1 + 0 ⁢ i ) } are always immortal, they will be exluded from this calculation.

Formal definition:

| 𝕄 b p | ∗ ∗ := lim L → ∞ ⁡ [ 1 L ⋅ | { z ∈ 𝕄 b p ∩ ℂ | 0 ≤ ℜ ⁡ ( z ) < b L , 0 ≤ ℑ ⁡ ( z ) < b L } ∖ { ( 0 + 0 ⁢ i ) , ( 1 + 0 ⁢ i ) } | ] Example: For base 10, power 2, there are 27 immortal complex numbers (10 without imaginary part and 17 with imaginary part) with imaginary/real part with length of 1..5 digits, exluding numbers (0+0i) and (1+0i). The complex immortality of ( 10 , 2 ) is therefore approximately | 𝕄 10 2 | ∗ ∗ ≈ 27 5 = 5.4

In comparison, the non-complex immortality is:

| 𝕄 10 2 | ∗ ≈ 10 5 = 2

6.3 Complex immortal number search

See a list of 1700 found immortal numbers with non-zero imaginary part here 6.4 Proof that (k+ki) is not immortal with power 2 for k ≠ 0 at any base b

Let z := ( x + y ⁢ i ) .

z ∈ 𝕄 b 2 ⇔ | ℜ ( z 2 ) | ≡ | ℜ ( z ) | ( mod b Υ b ⁢ ( ℜ ⁡ ( z ) ) ) ∧ | ℑ ⁡ ( z 2 ) | ≡ | ℑ ⁡ ( z ) | mod b Υ b ⁢ ( ℑ ⁡ ( z ) ) ⇔ | x 2 - y 2 | ≡ | x | ( mod b Υ b ⁢ ( x ) ) ∧ | 2 ⁢ x ⁢ y | ≡ | y | mod b Υ b ⁢ ( y ) , x ∈ ℤ , y ∈ ℤ Assume x = y ⇒ ℜ ( z 2 ) = x 2 - y 2 = 0 , 0 ≢ ∣ x ∣ ( mod b Υ b ⁢ ( x ) ) ∀ x > 0 .

Therefore, x can only be 0.

Then, y can only be 0, too, due to our previous assumption x = y and additionally because x = 0 ⇒ ℑ ( z 2 ) = 2 x y = 0 , 0 ≢ | y | ( mod b Υ b ⁢ ( y ) ) ∀ y > 0 . So, the only possibility is x = y = 0 ⇒ ( 0 + 0 ⁢ i ) 2 = ( 0 + 0 ⁢ i ) ■

7. Alternative immortal numbers

We can extend the definition of immortal numbers by searching the source number not only at the ending but at any position in the resulting power. We define r ∈ ℕ 0 which is the amount of digits which is omitted at the right.

The definition of these immortal numbers is:

z ∈ 𝕄 b ; r p ⇔ ⌊ | ℜ ⁡ ( z p ) | b r ⌋ ≡ | ℜ ( z ) | ( mod b Υ b ⁢ ( ℜ ⁡ ( z ) ) ) ∧ ⌊ | ℑ ⁡ ( z p ) | b r ⌋ ≡ | ℑ ⁡ ( z ) | mod b Υ b ⁢ ( ℑ ⁡ ( z ) ) , z ∈ { ℂ ∣ ℜ ⁡ ( z ) ∈ ℤ ∧ ℑ ⁡ ( z ) ∈ ℤ } , r ∈ { ℕ 0 ∣ r ≤ Υ b ⁢ ( ℜ ⁡ ( z p ) ) - Υ b ⁢ ( ℜ ⁡ ( z ) ) ∧ r ≤ Υ b ⁢ ( ℑ ⁡ ( z p ) ) - Υ b ⁢ ( ℑ ⁡ ( z ) ) } , b , p ∈ ℕ ∖ { 0 , 1 } , r ∈ ℕ 0 Example: 14651 ∈ 𝕄 10 ; 3 2 because 14651 2 = 2 14651 801 Here you can find a list of immortal numbers with b = 10 , p = 2 , r > 0 .

8. Open questions and unproven theorems

Help and suggestions are welcome!

#1:

⋂ b = 2 ∞ ( ⋃ p = 2 ∞ 𝕄 b p ) = ? { 0 , 1 }

#2:

⋂ p = 2 ∞ ( ⋃ b = 2 ∞ 𝕄 b p ) = ? { 0 , 1 }

#3: Is there a base that does not have any non-trivial (not 0,1) immortal numbers?

∃ ? ⁢ b ∈ ℕ ∖ { 0 , 1 } : ∑ p = 2 ∞ | 𝕄 b p | ∗ = 0

#4: Is there a power that does not have any non-trivial (not 0,1) immortal numbers?

∃ ? ⁢ p ∈ ℕ ∖ { 0 , 1 } : ∑ b = 2 ∞ | 𝕄 b p | ∗ = 0 #5: The topic "Base B / Power P" is not researched very much. It is not known how to find "Base B / Power P" immortal numbers without brute-forcing them.

#6: some old notes from 2011 (in German):

Jede Basis b ∈ ℕ ≥ 2 hat immer 0 und 1 als unsterbliche Zahlen: 𝕄 b 2 ⊆ { 0 , 1 } ⁢ ∀ b ∈ ℕ , b ≥ 2 bzw. ⋂ b = 2 ∞ 𝕄 b 2 = { 0 , 1 } hat immer 0 und 1 als unsterbliche Zahlen: bzw. 𝕄 i 2 = 𝕄 j 2 ⇒ i = j , da die Darstellung als "zusammengefasste Primfaktoren" für jede Basis eindeutig ist. (???) , da die Darstellung als "zusammengefasste Primfaktoren" für jede Basis eindeutig ist. (???) Es ist unmöglich, dass durch das Zusammenfassen von Primfaktoren eine Menge entsteht, die wiederum doppelte Elemente enthält, da ( p n ) r n ∤ ( p m ) r m bzw. g ⁢ g ⁢ T ⁢ ( ( p n ) r n , ( p m ) r m ) = 1 mit r n , r m ∈ ℕ als Wiederholungen von den Primzahlen p n , p m ∈ ℙ bzw. mit als Wiederholungen von den Primzahlen Bei einer Basis b mit ω ⁢ ( b ) verschiedene Primfaktoren gibt es 2 ω ⁢ ( b ) Permutationen und somit 2 ω ⁢ ( b ) Stämme (inklusive der 2 trivialen Stämme { 0 , 1 } ) mit verschiedene Primfaktoren gibt es Permutationen und somit (inklusive der 2 trivialen Stämme ) Vermutung: Jede Basis b mit mindestens 2 verschiedenen Primfaktoren ω ⁢ ( b ) ≥ 2 besitzt unsterbliche Zahlen, die nicht aus den trivialen Stämmen entspringen. Äquivalente Aussage: Der chinesische Restsatz ist immer lösbar.

Various notes and other stuff: runs, old_notes

Credits: The MathML equations are rendered by MathJax because Google Chrome does not care about MathML.

Contact: info&daniel-marschall.de

misc.daniel-marschall.de - Immortal numbers - Daniel Marschall
What does the angel number 333 mean?
What does the angel number 333 mean?

In numerology, angel number 333 is a message sent from your guardian angel that they are by your side helping you to make the hard decisions in...

Read More »
Last updated Nov 4, 2019
Is cinnamon a Christmas thing?
Is cinnamon a Christmas thing?

Cinnamon is one of those spices inherently linked with Christmas. Whether as an addition to Christmas cookies, mulled wine, a spiced latte or a...

Read More »
Last updated Apr 14, 2021
Awaken your dormant DNA ability to attract wealth effortlessly
Awaken your dormant DNA ability to attract wealth effortlessly

The simple yet scientifically proven Wealth DNA method laid out in the report allows you to effortlessly start attracting the wealth and abundance you deserve.

Learn More »
Promotion
What should you not keep in your wallet?
What should you not keep in your wallet?

7 Things You Should Never Carry in Your Wallet Social Security number. ... Checks. ... Numerous credit cards. ... Multiple gift cards. ... Password...

Read More »
Last updated Jun 3, 2021
Awaken your dormant DNA ability to attract wealth effortlessly
Awaken your dormant DNA ability to attract wealth effortlessly

The simple yet scientifically proven Wealth DNA method laid out in the report allows you to effortlessly start attracting the wealth and abundance you deserve.

Learn More »
Promotion
How do you ask for a message from the Universe?
How do you ask for a message from the Universe?

Show action and do research around it, as if you are proving your capability to a trusted adviser. Then, speak clearly and directly to the...

Read More »
Last updated Jun 12, 2021