Many problems with computer programs are associated with the order of groups of numbers. If a computer was asked to find a combination of numbers that would work, then it would pick up different combinations one by one. This computer method can take a very long time, if given a large combinational number. Using computer algorithms, the mathematical function that makes combinational numbers in the pointer can cause the computer to skip numbers that we know will not work. This project for find a mathematical function that will index the numbers. In this work, a function is created that can enter numbers in the index. This method is used to find the combinational number. To determine the mathematical equation that is created, we need to look at the first combinational number of the constructed group. Then, it is necessary to find the serial number of the combination number, which we are trying to find. You also need to find out how many times each item changes. To do this, we divide the sequence number by the number of the element change, starting from the left to the right element. This is what is called the number of the sample. Using the number of the sample, it is necessary to find out the combination number. The method that is proposed could save a lot of time and make combinational number problems more simple. For the analysis, we will analyze the combinational order. To do this, let’s see how our number system works. The number system that we suggest is based around dozens. In this system, the numbering of the units changes every step. The place of the tens changes every tenth step and so on. To start a project on combinations, we define how the decimal system works and the hexadecimal system. We have always been interested in what we call: complex problems. We call them difficult problems, because they have a solution, but sometimes the solution can not be solved in our lifetime. In addition, they are very difficult to deduce, because there are so many different solutions.