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 !!”

Can you please share the source of this conjecture?

LikeLike

nkpithwa

August 27, 2016 at 6:15 am

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

LikeLike

Reply
- gaurish
  
  August 27, 2016 at 6:26 am
  
  Thanks! Found the paper (https://arxiv.org/abs/math/0312202), it’s called “left factorial hypothesis”.
  
  LikeLike

Leave a Reply Cancel reply

Enter your comment here...

Fill in your details below or click an icon to log in:

Email (required) (Address never made public)

Name (required)

Website

You are commenting using your WordPress.com account. ( Log Out / Change )

You are commenting using your Google account. ( Log Out / Change )

You are commenting using your Twitter account. ( Log Out / Change )

You are commenting using your Facebook account. ( Log Out / Change )

Cancel

Connecting to %s

Share this:

Like this:

Related

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

Leave a Reply Cancel reply