Obtaining New Dividing Formulas n|Q(n) From the Known Ones

zbMATH Open0945.11004arXiv0706.2743MaRDI QIDQ4494906FDOQ4494906

Authors: Bau-Sen Du 

Publication date: 9 August 2000

Abstract: In this note, we present a few methods (Theorems 1, 2, and 3) from discrete dynamical systems theory of obtaining new functions Q(n) from the known ones so that the dividing formulas n|Q(n) hold.

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

Recommendations

• A unified way for obtaining dividing formulas \(n| Q(n)\)
• scientific article; zbMATH DE number 1175367
• New algorithms for the division's quotient
• On the \(\mathbb Q\)-divisor method and its application
• Divisors, partitions and some new \(q\)-series identities
• Some new approaches to infinite divisibility
• scientific article; zbMATH DE number 31766
• On some formulas involving the divisor function
• New convolutions for the number of divisors
• On divisibility properties of integers of the form \(a+a'\)

zbMATH Keywords

algebraic dynamics

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Dynamical systems involving maps of the interval (37E05) Sequences (mod (m)) (11B50)

Cited In (2)

• Generalized Fermat, double Fermat and Newton sequences.
• A unified way for obtaining dividing formulas \(n| Q(n)\)

This page was built for publication: Obtaining New Dividing Formulas n|Q(n) From the Known Ones

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