scientific article; zbMATH DE number 17620

zbMATH Open0736.11001MaRDI QIDQ3974946FDOQ3974946

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

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Fast arithmetics using Chinese remaindering
• An algorithm for the chinese remainder problem
• scientific article
• 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

zbMATH Keywords

Fibonacci numberschinese remainder theorem

Mathematics Subject Classification ID

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

Cited In (4)

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

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)