On the equation F(n 2 + 1) = bF(n 2 − 1) + c
Under a suitable conjecture concerning prime numbers, we provide a complete solution to the equation F(n 2 + 1) = bF(n 2 − 1) + c for every n ∈ N, n > 1, where F : N → C is a completely multiplicative function and b, c ∈ C, c ̸= 0.
Authors
- Imre Kátai
- Bui Minh Mai Khanh
- Bui Minh Phong
Publication Details
- Journal
- Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio computatorica
- Published
- 2025-01-01
- DOI
- https://doi.org/10.71352/ac.58.180625
- Primary Topic
- Meromorphic and Entire Functions
- Type
- article
- Field-Weighted Citation Impact
- 0.00