# Number theory, programming and RMO !!

The mathematician Duro Kurepa defined $!n = 0! + 1! + \ldots + (n-1)!$ for $(n-1)!$ and conjectured that $(!n, n!) = 2$ for all $n \geq 2$. This conjecture has been verified by Ivic and Mijajlovic for $n < 10^{6}$. Write a program in C or C++, or even MATLAB, Maple, or Mathematica or Scilab showing that this conjecture is true up to $n=1000$.

I will surely share more programming pearls in number theory here.

Nalin Pithwa

## 3 thoughts on “Number theory, programming and RMO !!”

1. Can you please share the source of this conjecture?

Like

• A. Ivic, and Z. Mijajlovic. On Kurepa’s problems in number theory, Publ. Inst. Math (Belgrade), 55, (1995), 19-28

Like

This site uses Akismet to reduce spam. Learn how your comment data is processed.