Project Euler Forum

As you can see Fastest Solvers Table and overview are in sync now. The solve count is cached on the site. It's not updated until someone solves the problem or an admin views who solved this problem. Even then the overview page is cached so the updated count is only showed when the overview page is r...

After several failed attempts at solving this problem, i decided to look for the answer somewhere. It appears to me that I found some other solutions that are not stated on the answer given. I double checked and still I think my solutions include more pandigital products. There might be some wordin...

Could you try another browser?
With me the problem turns up in IE11, but not in Chrome or Firefox. (With seemingly random pages. By me the page affected behaved normal again after about 48 hours)
Please let us know the result.

You generated your recovery key on Sat, 25 Mar 2017, 23:56.30.
The only way to recover your account is to find back this key. I assume that you saved it somewhere.
If you don't find it back, your account is lost.

Does the problem persist?

It should read $1\le p\lt q\le n$. Problem edited.

Squaring a matrix has nothing to do with matrix addition.
What you can read there is that for some matrices A,B,C holds that $A=B^2$ but also $A=C^2$

If you want to go up to 5 you have to concatenate 2469*1 and 2469*2 and 2469*3 and 2469*4 and 2469*5.
This gives 246949387407987612345

mdean wrote: ↑

Tue Nov 06, 2018 5:55 pm

I think I have some idea how to approach this problem, but I am completely lost by this thread, which seems to bear no resemblance to anything in problem 641...

Nothing is left in this thread to get lost.

The alternative account could have been creyD_
That one has solved one more problem than creyD has solved now. The problems solved by creyD were also solved by creyD_.

Please read the provided pdf write-up on the main site. (click on the pdf-icon)
Hint: you can use the formula for the sum of an arithmetic sequence. https://en.wikipedia.org/wiki/Arithmetic_progression

Vamsi, could you please stop throwing hints around?
People should be able to browse this board without fear for unwanted hints.

Yes it is a spoiler. And moreover it doesn't belong to Recreational.

Answer to your question: solving for small cases could reveal resources on the web.

Never, never put this kind of spoiler on a public resource again.

At the end of the section you wanted to display as code you wrote : [\code]. I should have been :[/code].
I edited it for you.

The publication time are on the feed.
The layout of the problems makes use of markup that can't be put in a feed.
Those can be found on the site itself.

The only thing I did was enter in Google's search field: "uva online judge java".
Then the first few results gave what you needed.
Have fun.

Here is a sample JAVA code from the site itself:
https://uva.onlinejudge.org/data/p100.java.html

Hovering and showing which problems would result in too much text for those who have solved many problems. Instead what I have done is changed the colouring system when a problem is solved. The shading indicates the difficulty of the problem. Great. Orange is the color of our royal family. :lol: It...

This simple program tells you the answer: def primefactorcnt(n): res=0 f=2 while n>1: while n%f==0: n/=f res+=1 f+=1 return res cnt=0 for n in xrange(2,10000): k=primefactorcnt(n) if k>=5: cnt+=1 if cnt==1000: print n break

This problem has been solved by 122912 members.
So try to find your own error.