A Simple Method Which Generates Infinitely Many Congruence Identities

MaRDI QIDQ3825140zbMATH OpenFDO

Authors Bau-Sen Du

Publication date 1989

Full work available at URL https://arxiv.org/abs/0706.2421

zbMATH Keywords

congruence identityinteger-valued functionlinear recursive sequence

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Recurrences (11B37)

Abstract: A simple method called symbolic representation for piecewise linear functions on the real line is introduced and used to compute the numbers of periodic points of all periods for some such functions. Since, for every positive integer m, the number of periodic points of minimal period m must be divisible by m, we obtain infinitely many congruence identities.

Recommendations

• On a generalization of the Fermat's little theorem
• scientific article; zbMATH DE number 4061316
• scientific article; zbMATH DE number 2188543
• scientific article; zbMATH DE number 895350
• A generalization of Fermat's little theorem

Cited in

(4)

• Congruence identities arising from dynamical systems
• Generalized Fermat, double Fermat and Newton sequences.
• The number of attractors in dynamical systems associated with cycles
• On a generalization of the Fermat's little theorem

This page was built for publication: A Simple Method Which Generates Infinitely Many Congruence Identities

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