# Programmatic Solution for a Real Time Numerology Belief

Three years back, I got a call from one of my friend. During the call he conveyed that he bought a new motor bike and asked my help to get the registration number for his motorbike. You may ponder how I am going to help to him in this regard.

Actually he was looking for an exclusive four digit registration number for his motor vehicle based on numerology with the following conditions.

- The recursive sum of all the four digits should be 1.
- Four digits of the number should be in ascending order. i.e., First number should be less than second, second less than third and third less than fourth.

To be honest, I was puzzled when he stated the above conditions. I asked him to give some time to find out those exclusive numbers. When I thought of this problem, I felt why didn’t automate this task by writing a program!! Hence this blog post!!

I usually do coding by divide and conquer approach. i.e., Split the entire problem into small logical units, and then integrate those small logical units to create the final one. Here in this case the following are the logical units.

- Unit to find those exclusive vehicle registration numbers.
- Unit to find the recursive sum of a number.
- Unit to check whether the digits of the given number are in ascending order are not.

When you look sharper at the logical unit 2, it can be divided further into a small logical unit.

- Unit to find those exclusive vehicle registration numbers.
- Unit to find the recursive sum of digits of a number
- Unit to find the sum of digits of a number
- Unit to check whether the digits of the given number are in ascending order are not.

That’s it. All things were nicely setup to create a program which solves my friend’s vehicle registration number numerology problem. Still one thing is missing the logical flow of program. Before sitting in front of the system and start coding, It is highly recommended to manually work out the program logic in a paper. If you follow this approach, you can develop the program with free of bugs :P So What is the logic to solve this problem ??

Here is the logic!!

- Traverse from 1000 to 9999
- For each no check whether the digits are in ascending order.If the digits are in ascending order, then check whether the recursive sum of the digits of the number is 1 or not. If the recursive sum is 1, My friend got the solution for his problem.