Page 1 of 1

Problem 221

Posted: Mon Feb 02, 2009 2:36 pm
by timpa
Can someone confirm the following Alexandrian numbers?

1000th: 787167192
10000th: 649280243274
100000th: 584788819726944

Re: Problem 221

Posted: Mon Feb 02, 2009 6:44 pm
by Georg
No, I got a different result.

Re: Problem 221

Posted: Sat Jan 09, 2010 2:14 pm
by estanford
There may be some bugs in my code, but I get 772168278 as the thousandth Alexandrian.

EDIT: I know my algorithm successfully generates all Alexandrians up to the fortieth in sequence, but I can't verify it beyond that.

Re: Problem 221

Posted: Sat Jan 09, 2010 3:55 pm
by zwuupeape
This is correct. The 1000th Alexandrian Integer is indeed 772168278.

Believe it or not, but if you solve the problem, you'll see that there's an algorithm that finds these numbers O(nlogn) time. :)

Re: Problem 221

Posted: Wed Mar 25, 2015 10:49 pm
by Oliver1978
For the 10,000th I get 628[...]090 and for the 100,000th I get 232[...]8200.

???

Re: Problem 221

Posted: Thu Mar 26, 2015 1:40 pm
by Svartskägg
leghorn wrote:For the 10,000th I get 628[...]090 and for the 100,000th I get 232[...]8200.
The value for 10000 is right, the other one wrong.

Re: Problem 221

Posted: Thu Mar 26, 2015 2:56 pm
by Oliver1978
Oh well, I suspect there's an overflow.

Re: Problem 221

Posted: Wed May 27, 2015 1:50 am
by h_anand
Svartskägg wrote:
leghorn wrote:For the 10,000th I get 628[...]090 and for the 100,000th I get 232[...]8200.
The value for 10000 is right, the other one wrong.
I get the following values:

Thousandth: 772...278
Ten thousandth: 628...090
Hundred thousandth: 756...504

Is the value for Hundred thousandth correct?

Is overflow possible? I mean, would I encounter values larger than 2 ^ 64?

thank you,

Re: Problem 221

Posted: Wed May 27, 2015 6:05 pm
by Svartskägg
h_anand wrote:Hundred thousandth: 756...504
Is the value for Hundred thousandth correct?
No
h_anand wrote:Is overflow possible? I mean, would I encounter values larger than 2 ^ 64?
I don't remember how my program works, but it uses no variable with more than 64 bits and it gives the right answer, so presumably there is no overflow.

Re: Problem 221

Posted: Thu Jun 18, 2015 7:11 pm
by h_anand
Thank you, Svartskägg. I was able to solve the problem eventually. To give you an idea of my level, this is the toughest problem I have solved till date. My attempt at solving the arithmetic derivative might take several years to complete. :(

Re: Problem 221

Posted: Thu Aug 06, 2015 6:26 pm
by Oliver1978
I've iterated my way into this, but I've encountered an issue, which keeps me wondering. My code is ready to run, and it does find the correct answer...but not in the right spot. Would somebody care to take a look?

edit

Top of the evening. Solved this one. Had an overflow, temporary big integer helped me out.

Re: Problem 221

Posted: Sun Mar 17, 2019 8:23 pm
by pxor
Hey, could anyone confirm these numbers are correct ?, thanks.

20k - 488-------508
60k - 124---------660
100k - 148----------350
140k - 276-----------940

Re: Problem 221

Posted: Sun Mar 17, 2019 8:36 pm
by hk
The first two are correct. The second two not.