加载中…
We study generalized Fibonacci sequences with initial values and . Let be nonzero integers such that is not a perfect square. We show that if then the sequence misses a congruence class modulo every prime large enough. On the other hand, if , we prove that (under GRH) the sequence hits every congruence class modulo infinitely many primes.

生成讲解博客的中文版本

生成AI智能校验的中文版本