Abstract This paper presents an entirely new way of calculating exponential functions. This method uses the 2n sequence at its foundation. An example of the 2n sequence is 2,4,8,16,32,64 and so on. This method is vastly more time saving and energy saving because one performs very few multiplication operations once an exponent has been broken down into its 2n components. This method can be coded into a computer software and this will improve the speed with which computer libraries calculate exponential functions. This paper also explains how this new method of exponential function calculation can partly help to solve the discrete exponential and discrete logarithm problem through easier calculation of exponential functions.