In this paper, we prove multiple analogues of famous Ramanujan’s formulas for certain Dirichlet series which were introduced in his well-known notebooks. Furthermore, we prove some multiple versions of analogous formulas of Ramanujan which were given by Berndt and so on.
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers β and γ respectively, such that β and γ are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.
We find complete sets of generating relations between the elements [r] = rⁿ - r for and for n = 3. One of these relations is the n-derivation property [rs] = rⁿ[s] + s[r], r,s ∈ R.