Search found 59 matches

by RobertStanforth
Fri Jul 24, 2020 8:26 am
Forum: News, Suggestions, and FAQ
Topic: Errors/Warnings/Bugs
Replies: 557
Views: 138413

Re: Errors/Warnings/Bugs

Hi, I am having trouble opening the thread for Problem 497. Chrome would load a few posts but when I scrolled down further, it became just a blank screen. Maths formulas were not rendered and code sections would not open. Thank you for reporting this. I cannot load the thread either: the Chrome tab...
by RobertStanforth
Fri May 22, 2020 9:33 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 298
Replies: 18
Views: 6273

Re: Problem 298

Thanks for flagging. This is now fixed.
by RobertStanforth
Thu Apr 09, 2020 6:29 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 618
Replies: 8
Views: 2865

Re: Problem 618 - optimization

I'm feeling stuck on this problem and want to learn more with some help. I have edited this post to remove potential spoilers, and moved it to the already existing topic for Problem 618 - see the red banner text at the top of this page. Good luck solving the problem! If successful, you'll be able t...
by RobertStanforth
Sat Feb 15, 2020 4:37 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 023
Replies: 56
Views: 20825

Re: Problem 023

Hello guys, I started to solve Project Euler problems recently, I wrote below code to prevent adding duplicate items to collection but it returns incorrect answer at the end. I have merged your post with the existing topic for Problem 23. Please do not post code (or other aids to solving) in this f...
by RobertStanforth
Wed Feb 12, 2020 8:03 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 610
Replies: 18
Views: 6257

Re: Problem 610

The question states The rules do not place any restriction on the number of occurrences of M, so all integers have a valid representation. but doesn't explain how to get negative integers, and I got the tick with an answer which assumes that negative integers don't have a valid representation. I th...
by RobertStanforth
Tue Jan 21, 2020 9:24 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 597
Replies: 3
Views: 845

Re: Problem 597

aTree wrote:
Tue Jan 21, 2020 7:00 am
Is this log base 10 or base e?
You can take it to be base $e$ ... but actually it doesn't matter because a different base would just scale all speeds by the same constant without affecting the sequence of events.
by RobertStanforth
Sat Jan 04, 2020 9:04 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 684
Replies: 13
Views: 3613

Re: Problem 684

Do you have to find the smallest digit sum for each term of the fibonacci sequence from the 2nd to the 90th? No, that is not correct. $S(n)$ is not digitsum. Instead, $s(n)$ is the inverse digit sum, so $\mathrm{digitsum}(s(n)) = n$. Note also that $S$ is the sum of $s$. So, (given a Fibonacci numb...
by RobertStanforth
Mon Nov 18, 2019 7:04 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 688
Replies: 8
Views: 1608

Re: Problem 688

vamsikal3 wrote:
Mon Nov 18, 2019 6:07 am
The problem text reads: It is impossible to divide 10 into 5 non-empty piles and hence f(10,5)=0.
Thank you for pointing this out. The wording has now been amended.
by RobertStanforth
Mon Nov 18, 2019 7:40 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 689
Replies: 3
Views: 1065

Re: Problem 689

Your values of $f$ are correct (albeit with the interpretation of the $\pi^2/6$ value as a limiting case, because $f(x)$ is only defined if $x$ is strictly less than 1).

For answer format, the leading zero is required, as in 0.abcdefgh
by RobertStanforth
Fri Oct 18, 2019 5:34 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 679
Replies: 2
Views: 956

Re: Problem 679

LangerJan wrote:
Fri Oct 18, 2019 10:43 am
Problem 679 (View Problem)

Quick question about counting keywords: Does "AREAREA" count as two occurrences of "AREA"?
Yes, it counts as two occurrences.
by RobertStanforth
Thu Oct 03, 2019 7:25 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 570
Replies: 1
Views: 684

Re: Problem 570

voltara wrote:
Thu Oct 03, 2019 2:03 am
The problem description for 570 contains a broken image; the filename is misspelled "p570-slowflakes.png" instead of "p570-snowflakes.png".
Thank you for letting us know. The broken image has now been fixed.
by RobertStanforth
Mon Sep 23, 2019 6:31 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 669
Replies: 5
Views: 4150

Re: Problem 669

At this point, I'm about 1 step away from challenging the answer to this problem. I know a fair number of people have already solved this problem. I know I have everything in correctly, the program appears to operate just fine. I've done just about everything I can. Next step is to verify each step...
by RobertStanforth
Wed Aug 14, 2019 7:02 pm
Forum: News, Suggestions, and FAQ
Topic: Bookmark / Pinning a problem?
Replies: 26
Views: 6832

Re: Bookmark / Pinning a problem?

To answer your original question, the Project Euler site does not currently have any specific functionality for bookmarking problems (except for "filter by solved/unsolved"). The work-around I suggested earlier of using browser bookmarks may still be viable for the cross-device use case that you des...
by RobertStanforth
Sun Aug 11, 2019 6:49 pm
Forum: News, Suggestions, and FAQ
Topic: Bookmark / Pinning a problem?
Replies: 26
Views: 6832

Re: Bookmark / Pinning a problem?

Your web browser's bookmarking facility should be adequate for this job.
by RobertStanforth
Mon Jul 29, 2019 7:54 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 122
Replies: 14
Views: 6336

Re: Problem 122

RishadanPort wrote:
Sun Jul 28, 2019 6:31 pm
Is m(1) considered 0 or 1?

I'm assuming 0 becomes you don't need any multiplication
Yes, your reasoning is correct.
by RobertStanforth
Mon Jul 29, 2019 7:43 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 351
Replies: 21
Views: 11732

Re: Problem 351

RishadanPort wrote:
Mon Jul 29, 2019 7:34 am
ok I solved this problem...

I am really wondering tho, why H(1000), H(1 000 000), and H(100 000 000) all look so similar... Can anyone explain? feel free to send me private message.
This question would be better asked in the solutions thread for this problem on the main site.
by RobertStanforth
Tue Jul 16, 2019 7:30 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 351
Replies: 21
Views: 11732

Re: Problem 351 Visibility of extremely far away orchard

Let the middle orchard represent (0, 0). if I have say an orchard that is on the X-Axis shifted (100 000 000 - 1) away but shifted up or below by 1, -- do I assume I can see this orchard even tho the line is extremely close to just horizontal line? I am guessing all orchards are points with no widt...
by RobertStanforth
Thu May 09, 2019 10:06 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 653
Replies: 2
Views: 3099

Re: Problem 653

My problem that I've realised that if two particles were to move toward each other while they are an odd number of millimetres away, they would meet at a point with half-integer position ( with a .5); which seemingly goes against what the rest of the problem is implying i.e that all values are inte...
by RobertStanforth
Mon Apr 22, 2019 8:09 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 013
Replies: 76
Views: 25789

Re: Problem 13

reza1615 wrote:
Mon Apr 22, 2019 5:40 am
Hi all,
I don't undrestand the description of problem 13. what does it need? would you please tell me by an example?
Hi reza1615,
I merged your post with the existing topic for this problem. You may find what you need in this thread.
by RobertStanforth
Tue Feb 19, 2019 8:48 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 656
Replies: 9
Views: 2412

Re: Problem 656

vamsikal3 wrote:
Tue Feb 19, 2019 4:17 am
Can I PM someone to verify my result for the 21st term in the sequence given in the example for square_root(31)?
No, that is still not the purpose of this forum.
As Animus said, "it is not appropiate to ask for help for recent problems that have not even reached 100 solvers".