Project Euler Forum

Hi,

I haven't solved problems 223 & 224 yet, but it seems to me the wording is a little misleading. More specifically, I think that instead of

a <= b <= c

it should say

1 < a <= b <= c

Otherwise, problem 223 is trivial, keep a = 1, b = c. Well, not trivial, I realize there's more solutions than that.

Of course, maybe I misunderstood and that is in fact supposed to be one of the solutions.

Moved it here.....

The wording used for a problem description is reviewed thouroughly in all its details by several people (at least three), before a problem is published, to make sure it is fully accurate and prevent any misunderstanding.

What you see is what you have to work with.

Can somebody confirm if the answer to 224 for perimeter<=9e6 is 496403.
Thanks.

Yes.

Hi,

Do I have to take only the (a, b, c) triplet for which a < b + c, b < a + c, c < a + b and 1 <= a?

I mean, should I be able to construct a triangle with sides a, b, c?

Thanks.

"Let us call an integer sided triangle with sides a &le; b &le; c", so yes.

Oh! sorry, and thanks!

Hey, I have a question about 224... I solved 223 but it took me almost half an hour to compute the results (my algorithm is identical to that used by others, code optimized by some methods, and I use external modules for some mathematical functions that are very efficient). Python, yes. 224 is not very different - I know exactly how to solve it and it will probably work fine if I give it like, say, 7 hours. Is there something I missed or is this problem supposed to be more demanding from the computer than 223?

For me problem 224 was easier than problem 223. I used nearly the same code and I had no problems [...] Runs in 10 seconds. (Java)

Okay, I've solved it. There's a really smart solution (and I found that solution in a VERY dumb way), and there actually is a semi-smart solution that I didn't think of, but this semi-smart solution is much more difficult to find than the semi-smart solution for 223.

Can somebody please confirm the number of solutions for perimeter < 10^4 is equal to 13656

Yes, viv_ban, your answer for Problem 223 (View Problem) and perimeter &le;10000, seems to be correct.

That is strange, for (a+b+c) <= 10000 I get 13651. That is, I haven't found a solution yet, and certainly not an efficient one.
I suppose nobody can give me a hint?
Edit: ah, I used a < b < c instead of a <= b <= c. Now I have 13656 too. But still too slow to get anywhere near 25.000.000 .

Let us call an integer sided triangle with sides a <= b <= c barely acute if the sides satisfy a^2 + b^2 = c^2 + 1.

So, if a = 1then I get approximately 12.5 million positive results*: 1^2 + b^2 = c^2 + 1, with b = c. Also a = 1 is not excluded in the description, so how can 10^4 be 13,656?

* with a perimeter <= 25,000,000

Because there are more triangles than perimeterlimit/2.

I think I've found my mistake...

So, with a perimeter <= 20,000 that would make 29257 triangles?

Yes.

Hi,

I have written 2 pieces of code for problem 223.
I get two different answers , for the perimeter limit = 100.000 I get :
val1 = 168921 , val2 = 168676
EDIT : I also get val3 = 168350 when I try to optimize.

Can you please tell me which one is correct ?
Thanks.

youth4ever wrote: Sat Oct 28, 2017 3:19 pm I have written 2 pieces of code for problem 223.
I get two different answers , for the perimeter limit = 100.000 I get :
val1 = 168921 , val2 = 168676

I can't find my code for this problem right now.
What you could do is have your computer compare the triangles generated by the two methods until you find one that is counted by method 1 but not by method 2. It is easily checked whether that is a valid almost right-angled triangle or not, so you then know see whether method 1 falsely includes it or method 2 falsely excludes it. The same then goes for your optimized method.