Search found 261 matches

by harryh
Sat Nov 13, 2010 9:48 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 310
Replies: 8
Views: 3031

Re: Problem 310

1) If a player takes the last stone, does it win or loose? (Both versions of nim are played.) 310 states "normal play Nim". It means that the player who takes the last stone(s) wins. Find the number of losing positions for the next player -- does it mean number of winning positions for starting pla...
by harryh
Tue Nov 09, 2010 8:31 am
Forum: News, Suggestions, and FAQ
Topic: Processing math ....12....37......62.........%
Replies: 9
Views: 3177

Re: Processing math ....12....37......62.........%

euler wrote:Seriously, why do people use IE?
Because site admins are quite happy (or at least willing) to patch and hack their scripts, in order to make them compatible with it :!:
by harryh
Sat Nov 06, 2010 7:01 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 004
Replies: 83
Views: 16919

Re: Problem 004

Have you also looked at the pdf for the problem?
If you have, and if you are absolutely certain that your method is faster than that, you can PM me your method.
We will then consider re-opening the thread.
by harryh
Wed Nov 03, 2010 8:53 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 242
Replies: 1
Views: 1302

Re: Problem 242

Problem 242 (View Problem)
I believe that for n [le] 1000, the correct answer is 5793.
Good luck !
by harryh
Fri Oct 29, 2010 9:45 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 162
Replies: 37
Views: 13024

Re: Problem 162

Our apologies for the inconvenience. The bug has been fixed; everything should be ok now :)
by harryh
Fri Oct 29, 2010 7:27 am
Forum: News, Suggestions, and FAQ
Topic: Scores question
Replies: 1
Views: 1190

Re: Scores question

No: Level 3 includes only the users who have solved 100-149 problems.
by harryh
Fri Oct 29, 2010 7:20 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 162
Replies: 37
Views: 13024

Re: Problem 162

@henrylaxen : Yes, currently there is a bug with the answer-checking script; it will soon be fixed (and a post will be made here to that effect).
by harryh
Sun Oct 24, 2010 10:01 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 068
Replies: 20
Views: 6257

Re: Problem 068

Magic 5-gon's (just like magic 3-gon's, magic squares etc) use each number once.
Problem 68 (View Problem) states:
Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings.
So, yes, it is implicitly assumed that each of the numbers 1 to 10 will be used only once.
by harryh
Sat Oct 23, 2010 7:46 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 232
Replies: 35
Views: 11999

Re: Problem 232

Waldovski wrote:Question: When you say "On each turn Player 2 selects the number, T, of coin tosses that maximises the probability of her winning.", do you mean maximising the probability of reaching 100 in one turn?
Your question has already been answered; see this previous post.
by harryh
Mon Oct 18, 2010 6:49 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 103
Replies: 38
Views: 10865

Re: Problem 103

It's not a valid tuple because 11+22+23=16+19+21, whereas Problem 103 (View Problem) states :
S(B) ≠ S(C); that is, sums of subsets cannot be equal.
by harryh
Sun Oct 17, 2010 1:43 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 125
Replies: 12
Views: 6702

Re: Problem 125

Well, 125 states : Note that 1 = 0 2 + 1 2 has not been included as this problem is concerned with the squares of positive integers. For the same reason, your values 121, 484 and 676 are not acceptable (they are not sums of squares of positive integers). That leaves you with ten acceptable values (i...
by harryh
Sat Oct 16, 2010 8:10 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 002
Replies: 54
Views: 17305

Re: Problem 002

@phillyj : Please don't start a new thread (topic) if one already exists for the same problem.
by harryh
Mon Oct 11, 2010 1:51 pm
Forum: News, Suggestions, and FAQ
Topic: Statistics: number of users / number of problems solved
Replies: 2
Views: 1275

Re: Statistics: number of users / number of problems solved

Not exactly what you asked for, but good enough for most purposes : Number of problems solved : Number of users (305 problems) 0-4 : 52114 5-9 : 20631 10-14 : 14608 15-19 : 8218 20-24 : 5200 25-29 : 4438 30-34 : 3133 35-39 : 2282 40-44 : 1636 45-49 : 1136 50-54 : 1838 55-59 : 1276 60-64 : 1224 65-69...
by harryh
Thu Oct 07, 2010 6:44 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 011
Replies: 66
Views: 9456

Re: Problem 011

@JerBear:
Your question has already been answered as you can see.
If only you had looked at the previously existing topic for this problem...
by harryh
Mon Sep 13, 2010 9:00 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 015
Replies: 63
Views: 9592

Re: Problem 015

Your interpretation of the problem seems correct :) Now, see if you can verify the results given in previous posts for smaller "words"; e.g. how many 10-letter words are there using 5 r's and 5 d's ? Does your result agree with that posted previously by stijn263 for a 5x5 board? If so, you are on th...
by harryh
Sat Sep 11, 2010 8:34 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 093
Replies: 54
Views: 16887

Re: Problem 093

( 7 - ( 9 / 2 ) ) * 6
by harryh
Sat Jul 24, 2010 7:39 am
Forum: News, Suggestions, and FAQ
Topic: Why isn't their a link to the forum on the main page?
Replies: 8
Views: 2218

Re: Why isn't their a link to the forum on the main page?

dwaltrip77 wrote:Why isn't their a link on the main home page at projecteuler.net?
There is a clear reference to the "alternative phpBB forum" and a direct link: see the contact section.
Is there any particular reason you want it on the main home page?
by harryh
Thu Jul 22, 2010 5:30 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 125
Replies: 12
Views: 6702

Re: Problem 125

@ DDgeva :

Please do not start a new topic, if one already exists for the problem you are trying to solve!

As you can see, your question was (mostly) already answered before...
by harryh
Fri Jul 09, 2010 11:19 am
Forum: Combinatorics
Topic: Vending machine
Replies: 10
Views: 6630

Re: Vending machine

@ Lord_Farin : We cannot use TeX, but we can use the [ sub ] tag to write items like S i , S j , a nk etc We can also use the [ ent ] tag to write sum ...., lfloor ... rfloor etc, though sum(...) and floor(...) are just as good. On the other hand, if each person uses their own notation for variables...
by harryh
Thu Jul 08, 2010 12:13 pm
Forum: News, Suggestions, and FAQ
Topic: Idea for Measuring Problem Difficulty
Replies: 9
Views: 3194

Re: Idea for Measuring Problem Difficulty

Ah yes, you are right! Those expressions are a remnant of an old era. "descending difficulty" should have been replaced by "ascending number of solutions" and "ascending difficulty" should have been replaced by "descending number of solutions", since that's exactly what those selections do. The shor...