On some pairs of multiplicative functions correlated by an equation II
Aequationes Mathematicae, 2000
It is proved that if F and G are multiplicative functions such that the equation $ G(n+k) = F(n) ... more It is proved that if F and G are multiplicative functions such that the equation $ G(n+k) = F(n) $ is satisfied for some positive integer k and for every positive integer n, furthermore the sets¶¶ $ {\Cal S}_F:=\{n\in{\Bbb N} \mid F(n)\neq 0\} \text{ and } {\Cal S}_G:=\{n\in{\Bbb N} \mid G(n)\neq 0\} $ ¶are finite, then either $ {\Cal S}_F:=\{n\in{\Bbb N} \mid F(n)\neq 0\} \text{ and } {\Cal S}_G:=\{n\in{\Bbb N} \mid G(n)\neq 0\} $ are finite, then either $ {\Cal S}_F = \{1\} $ , or $ {\Cal S}_F=\{1,p^{\delta}\} $ holds with some prime power $ p^{\delta} $ except for the following cases:¶¶ $ k = 3;~8;~20;~90;~\pi=\hbox{Mersenne prime} $ ,¶in which cases $ {\Cal S}_F $ has exactly three elements.
Uploads
Papers by Bui Phong