scientific article; zbMATH DE number 17620

MaRDI QIDQ3974946zbMATH OpenFDO

Authors Kenji Nagasaka, Chung-Wu Ho, Peter J.-S. Shiue

Publication date 26 June 1992

zbMATH Keywords

chinese remainder theoremFibonacci numbers

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Number-theoretic algorithms; complexity (11Y16)

Review text

[For the entire collection see Zbl 0725.00005.] By elementary considerations it is shown that the Chinese remainder problem is equivalent to solving a certain congruence what is possible in somewhat shorter time than solving the congruence system by the usual method. One example with Fibonacci numbers involved is given.

Recommendations

• Fast arithmetics using Chinese remaindering
• An algorithm for the chinese remainder problem
• scientific article; zbMATH DE number 1807669
• A fast algorithm for computing large Fibonacci numbers
• Fast evaluation of iterated multiplication of very large polynomials: an application to Chinese remainder theory
• Fast Chinese remaindering in practice
• Fast Computation of Fibonacci Numbers and Their Sums
• A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
• scientific article; zbMATH DE number 2096584
• The generalization of the Chinese remainder theorem

Cited in

(6)

• Combined random number generator via the generalized Chinese remainder theorem
• Census algorithms for chinese remainder pseudorank
• The Chinese remainder clock
• Fast Chinese remaindering in practice
• Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu)
• Fast arithmetics using Chinese remaindering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974946)