An Algorithm for Accelerated Acquirement of Minimal Representation of Super-large Numbers
Mohammed Al-Maitah
Journal of Computer Science, Volume 2, Issue 12, pp. 875–878 · doi.org/10.3844/jcssp.2006.875.878
Abstract
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Al-Maitah, M. (2006). An Algorithm for Accelerated Acquirement of Minimal Representation of Super-large Numbers . Journal of Computer Science, 2(12), 875–878. https://doi.org/10.3844/jcssp.2006.875.878
- Licence
- © Science Publications
- Issue
- Volume 2, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
