An Algorithm for Accelerated Acquirement of Minimal Representation of Super-large Numbers

An algorithm for accelerated acquirement of minimal representation of super-large numbers was presented. The algorithm considers a new form of arithmetic, which was called arithmetic of q- representation of large range integers; which was based on the numbers of the generalized sequence of Fibonacci. The estimations of the complexity of the offered algorithms are presented. p p p p i p p p p p l p i p l w p l w w ϕ ϕ , Where ( ) n p ϕ is the n th Fibonacci р-number. Fibonacci р-numbers for positive n are calculated on the basis of the recurrent relationship