Errors/Warnings/Bugs

[Bubbler]

I encountered a weird bug on the Problems page.
I was viewing Unsolved problems, sorted by Solved By in Descending order.
I clicked to see All problems, and then the page suddenly showed:



After I clicked All again, the page returned to normal.

[Arcoth]

@Colin: It worked, thanks a lot - ymmd

Unfortunately, i couldn't reply per email as i got the same error message again. This is how it looks:

[snipped by euler - thanks for the info]

Now that i got a new password i don't care anymore though. Thanks again.

[euler]

@Bubbler: Thanks for that. I'm not sure how that happened to you in the first place, but I've made some small changes to the scripts that should stop it happening again.

[jorge]

Hi...

I think I found an error in the overview given in the pdf file of problem 003.

The implementation (that uses maxFactor = square root of n) given in page 2 would not work if ("the evil big number") is:
n = 14, whose prime factors would be 2, 7.

Please let me know if I'm wrong.

Regards.

[mpiotte]

Hi...

I think I found an error in the overview given in the pdf file of problem 003.

The implementation (that uses maxFactor = square root of n) given in page 2 would not work if ("the evil big number") is:
n = 14, whose prime factors would be 2, 7.

Please let me know if I'm wrong.

Regards.

The algorithm is correct. In particular, for 14, after division by 2 we have: n=7
Then we never enter the loop (as factor > maxFactor)
Since n≠1, we output n, i.e. 7: the largest prime factor of 14!

[jorge]

Hi...

I think I found an error in the overview given in the pdf file of problem 003.

The implementation (that uses maxFactor = square root of n) given in page 2 would not work if ("the evil big number") is:
n = 14, whose prime factors would be 2, 7.

Please let me know if I'm wrong.

Regards.

The algorithm is correct. In particular, for 14, after division by 2 we have: n=7
Then we never enter the loop (as factor > maxFactor)
Since n≠1, we output n, i.e. 7: the largest prime factor of 14!

Thank you mpiotte for clarifying this issue to me

[nanogyth]

I have 7 kudos from unarchived posts, but not the "Wise Words" forum post award.
Do the kudos need to be from archived posts or is it not updating correctly?

[mpiotte]

I have 7 kudos from unarchived posts, but not the "Wise Words" forum post award.
Do the kudos need to be from archived posts or is it not updating correctly?

The first: see viewtopic.php?f=5&t=3313&p=35478&hilit= ... rds#p35511.

[thialfihar]

I hope this is the right place for the report:
I just solved problem 233 (https://projecteuler.net/problem=233) and then was informed that I got the Fibonacci Fever award for solving the first 12 Fibonacci number problems.
But problem 233 has nothing to do with Fibonacci numbers. Perhaps that's a bug?

Or was "Fibonacci Fever" possibly added after I had solved the 12 problems and only now showed because solving any problem makes the backend check for awards?

[hk]

I hope this is the right place for the report:
I just solved problem 233 (https://projecteuler.net/problem=233) and then was informed that I got the Fibonacci Fever award for solving the first 12 Fibonacci number problems.
But problem 233 has nothing to do with Fibonacci numbers. Perhaps that's a bug?

Or was "Fibonacci Fever" possibly added after I had solved the 12 problems and only now showed because solving any problem makes the backend check for awards?

Here are the first 14 fibonacci numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233.
As 0 isn't a problem ID and 1 occurs twice in this list, 233 is the 12th fibonacci numbered problem.

[thialfihar]

Oh... well, that's embarrassing.
I thought the first 12 problems that had something to do with Fibonacci numbers... but indeed it says "Fibonacci numbered".

Cheers, hk.

[jpaulson]

I am subscribed to the Project Euler RSS feed, but it is not very useful, because the updates happen at the wrong time.

For example, I just got the following update. It links to http://projecteuler.net/problem=483 which is of course not accessible yet. Shouldn't this update occur when problem 483 is actually accessible?
New Problem 483
Release date: Sun, 05 Oct 2014 10:00:00 +0100
500+ Project Euler / 2h

[euler]

It's always worked that way. The point of the RSS feed, in the case of problem publication, is to advise members of the release date and time. If we only published it when the problem went live then members would not receive notice of up-coming problems. The link (and content) of the feed cannot be changed dynamically once it has been read by your feed reader, so it needs to be a fixed link that it will work in the future.

[jpaulson]

OK, that makes sense. I would personally find it more useful if you published two RSS events for each problem.

The first one would happen when you scheduled the problem, and link to a page like this: http://www.timeanddate.com/worldclock/f ... c=0&p1=195. This saves me from doing the timezone conversion manually, which is nice.

The second one would happen when the problem was published, and link to the problem.

[hk]

This one would've been more to the point : http://www.timeanddate.com/worldclock/f ... T13&p1=136
You know, the site isn't based in France but in England. England and France are in different time zones...

[jpaulson]

Sorry, my mistake As I said, saving me from having to convert time zones would be nice.

[hk]

Problems are published at fixed times:
times in London time
Sat 13:00
Sat 16:00
Sat 19:00
Sat 22:00
Sun 01:00
Sun 04:00
Sun 07:00
Sun: 10:00
Apart from a few dates when daylight saving time starts or ends, I assume that the difference in hours between London and your home is pretty much constant.
Is it so hard to do that conversion once? Why asking others to adapt to you instead of vice versa?
People go to great lengths solving numerous PE problems while asking others to solve the most basic problems for them.
BTW daylight saving time ends in England Sunday 26 October.

[jpaulson]

HTML bug: On https://projecteuler.net/show=unsolved, the problem titles are opened as <h3> but closed as </h2>.

I noticed because I'm trying to parse your HTML with BeautifulSoup, and failing.

http://validator.w3.org/check also finds a lot of other small HTML errors.

[euler]

Thanks for reporting the bugs. I think I've fixed most of them.

[djocar]

The various options for retrieving minimal information (referred to in viewtopic.php?f=12&t=3003) are not currently working. Has the facility been discontinued, or have the URLs changed since the problems of last Summer?