The author has considered the digital way of shifting function in the time domain using the method of representing vectors. This is the operational method which assigns a p-dimensional vector to any time functions at finite time interval and assigns matrix (pxp) to linear operator. Further changes necessary to shift the functions are carried out by numerical methods. A function of time is associated with a vector which is called a depicting vector, and shift operations in the direct and opposite direction are associated with matrix operators, the latter are replaced in the operator delay chain of Laplace transform by the differentiation matrix. The shift operator function in the time domain is found by calculating the series coefficients by the known degradation of the matrix exponential in the Fourier series. The time function is recovered by the depicting vector inner product on the vector of Chebyshev polynomials of the second kind. All this allows applying successfully the computer equipment and recording the final result on the basis of the inversion formula in analog form as a function of time. The author proposes the method of expansion of positive integers of n degree into a series of odd numbers. The sum of a geometric progression is the coefficient of expansion of positive integers. This method binds the product of decomposition and the amount of positive integers and allows replacing the n degree of a positive integer by a sum of the series of odd positive integers. Unity (as the most complex number) expansion to the fifth power is considered as an example.