arXiv · 2609.03091
Perfect numbers, Wieferich primes and the solutions of $\binom{2n}{n}\equiv 2^n \bmod n$
Abstract
In this article we focus on the solutions of a congruence equation: $\binom{2n}{n}\equiv 2^n \bmod n$. Using the main result of this article and the SageMath software, we improve largely the number of known solutions. Furthermore, we prove that some famous numbers like even perfect numbers and Wieferich primes are connected to solutions of this equation.
Explore related subjects
Keep this discovery
Gabriel Guedes, Ricardo Machado. 2026-09-02. Perfect numbers, Wieferich primes and the solutions of $\binom{2n}{n}\equiv 2^n \bmod n$. https://doi.org/10.7546/nntdm.2023.29.4.705-712
Cite the original work for its findings. Save a collection to share your selection of sources.