Showing the Français version because no English translation exists yet. Add that translation.
Unreviewed. This problem has not been reviewed by trusted users yet.
E=100000000000000000000000000000001
F=999999999999999999999999999999970000000000000000000000000000000299999999999999999999999999999999
Expliquer pourquoi ∀n∈N≤1015,(E×1032(n+1)modF)mod1032=n2.
Remarque : amodb représente le reste de la division euclidienne de a par b.
References
Original problem
les dattes à Dattier
Details
Download: BibTeX · JSON