#### Calculating a lucky number for Scott

The lucky number for Scott (or any other name) is calculated by using a special table which gives a numeric value to each letter of the alphabet. The table we used is derived from the Kabbalah and used by Hebrew and Arab mystics.

Here are the letters of the roman alphabet and their values:

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |

1 | 2 | 3 | 4 | 5 | 8 | 3 | 5 | 1 | 1 | 2 | 3 | 4 | 5 | 7 | 8 | 1 | 2 | 3 | 4 | 6 | 6 | 6 | 5 | 1 | 7 |

So the numbers for each letter of Scott are:

S | c | o | t | t |

3 | 3 | 7 | 4 | 4 |

First we add the digits of all the letters: **3**+**3**+**7**+**4**+**4** = **21**

Which is still more than one digit

so we add the digits of **21**: **2**+**1** = **3**

Which gives Scott a lucky number of **three**!

#### Calculating two digit lucky numbers for Scott

The two digit lucky numbers for Scott are those two digit numbers which when their digits are summed to give a single digit, give the lucky number (three) for the name.

Mathematically, this turns out to be the set of numbers less than 100 of the form **L + 9n** (where L is the lucky number and n is a natural number).

Algorithmically, this is:

*for ( int i = luckynum + 9; i < 100; i += 9 )*

*print( i );*

Which, for Scott gives us: **12 21 30 39 48 57 66 75 84 93**!