**Narcissistic Numbers**

Narcissistic Numbers are defined as follows:

An n digit number is narcissistic if the sum of its digits to the nth power equal the original number.

For example with 2 digits, say I choose the number 36:

3^{2} + 6^{2} = 45. Therefore 36 is not a narcissistic number, as my answer is not 36.

For example with 3 digits, say I choose the number 124:

1^{3} + 2^{3} + 4^{3} = 73. Therefore 124 is not a narcissistic number as my answer is not 124.

The question is how to find all the narcissistic numbers less than 1000, without checking 1000 different numbers? Let’s start with 1 digit numbers.

**1 digit numbers**

0^{1} = 0

1^{1} = 1

2^{1} = 2 etc.

Therefore all numbers from 0-9 are narcissistic.

**2 digit numbers**

For 2 digit numbers in the form ab we need the following:

a^{2} + b^{2} = 10a + b.

Therefore

a^{2} – 10a + b^{2} – b = 0.

Next if we choose a = 1,2,3,4,5 we get the following simultaneous equations:

b^{2} – b -16 = 0

b^{2} – b -21 = 0

b^{2} – b -24 = 0

b^{2} – b -25 = 0

None of these factorise for integer solutions, therefore there are no 2 digit solutions from 11 to 59. Trying a = 6,7,8,9 we find that we get the same as the first four equations. This is because a and 10-a give equivalent solutions. In other words, when a = 1 we get the equation b^{2} – b -9 = 0 and when a = 9 we also get the equation b^{2} – b -9 = 0. This is because:

for:

a^{2} – 10a

if we substitute a = (10 – a) we get

(10 – a)^{2} – 10(10 – a) = a^{2} – 10a.

Therefore we prove that there are no 2 digit narcissistic numbers.

**3 digit numbers**

First we list the cube numbers:

1^{3} = 1, 2^{3} = 8, 3^{3} = 27, 4^{3} = 64, 5^{3} = 125, 6^{3} = 216, 7^{3} = 343, 8^{3} = 512, 9^{3} = 729.

and then consider 3 digit numbers of the form 1bc first. We need:

1^{3}+ b^{3} + c^{3} = 100 + 10b + c.

If our first digit is 1, then b^{3} + c^{3} need to add up to give us a number in the one hundreds, therefore:

99 ≤ ^{ }b^{3} + c^{3}≤ 198.

We can then check the cube numbers and see that the only possible combinations for a and b are 0 5, 5 0, 1 5, 5 1, 2 5, 5 2, 3 5, 5 3, 4 4, 4 5, 5 4. We can check these (only have to use the calculator for half as the reversed numbers give equivalent answers) and find that for 153 we do indeed get a narcissistic number i.e:

1^{3}+ 5^{3} + 3^{3} = 153.

Next we consider 3 digit numbers of the form 2bc first. We need:

192 ≤ ^{ }b^{3} + c^{3}≤ 292

This gives the following possibilities for b and c: 6 0, 0 6, 6 1, 16, 2 6, 6 2, 6 3, 3 6, 6 4, 4 6.

None of these give narcissistic numbers.

Next we consider 3 digit numbers of the form 3bc first. We need:

273 ≤ ^{ }b^{3} + c^{3}≤373

This gives the following possibilities for b and c: 6 4, 4 6, 6 5, 5 6, 7 1, 1 7, 7 2, 2 7, 7 3, 3 7, 7 0, 0 7.

Checking these we find 2 more narcissistic numbers:

370 = 3^{3}+ 7^{3} + 0^{3}

371= 3^{3}+ 7^{3} + 1^{3}

Using the same method, we can find that the only possibilities for 4bc are: 5 6, 6 5, 7 1, 1 7, 7 2, 2 7, 7 3, 3 7, 7 4, 4 7, 7 0, 0 7. Checking these gives us 1 more narcissistic number:

407= 4^{3}+ 0^{3} + 7^{3}

We can carry on with this method checking up to the form 9ab (it gets easier as there are less combinations possible, but will find no more narcissistic numbers. Therefore we have all the narcissistic numbers less than 1000:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407.

**Is there a limit to how many narcissistic numbers there are?**

Surprisingly there is a limit – there are exactly 88 narcissistic numbers in base 10. To see why we can consider the following:

In 3 digits the biggest number we can choose is 999. That would give 9^{3}+ 9^{3} + 9^{3} (or 3(9)^{3}). This needs to give a number in the hundreds (10^{2}) otherwise it would be impossible to achieve a narcissistic number. Therefore with an n digit number the largest number we can make is n(9)^{n} and if we can’t make a number in the 10^{n-1}, then a narcissistic number is not possible. If we can prove that the inequality:

n(9)^{n} < 10^{n-1}

is true for some values of n, then there will be an upper bound to the narcissistic numbers we can make. We could simply plot this directly, but let’s see if we can convince ourselves it’s true for some n without using graphical software first. Let’s see if we can find an equality:

n(9)^{n} = 10^{n-1}

First we take log base 10 of both sides

log n(9)^{n} = n-1

log(n) + nlog(9) = n-1

n(log9 -1) + logn +1 = 0

Next we make the substitution logn = u and therefore 10^{u} = n. This gives:

10^{u}(log9 -1) + u + 1 = 0.

Now we can clearly see that 10^{u} will grow much larger than u + 1, so any root must be for u is small. Let’s see, when u = 1 we get a positive number (as log9 -1 is a negative number close to 0), but when u = 2 we get a negative number. Therefore we have a root between u = 1 and u = 2. Given that we made the substitution logn = u, that means we have found the inequality n(9)^{n} < 10^{n-1} will hold for n somewhere between 10^{1} and 10 ^{2}.

Using Wolfram we can see that the equality is reached when u = 1.784, i.e when n = 10^{1.784} or approx 60.8. Therefore we can see that when we have more than 60 digit numbers, it is no longer possible to make narcissistic numbers.