A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
[pedantic]
The problem states: "It can be shown that there exists at least one rectangle whose sides are parallel to the largest square which encloses the Pythagorean tree completely." I disagree. The existence of a largest square which encloses the tree is contradictory, since an even larger square enclosing the first is trivial to construct.
[/pedantic]
Seriously, I wasted five minutes trying to figure out what could possibly be meant by this sentence. It seems that the rectangle must be the thing that encloses the tree. Someone in charge please move the confusing dependent clause, add commas, or otherwise repair the confusion. Maybe read Eats, Shoots & Leaves http://en.wikipedia.org/wiki/Eats,_Shoots_%26_Leaves while you're at it
It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
If so, I'll change the wording. Apologies for the confusion and thanks for pointing that out.
Decimal places should not be confused with decimal digits. In Mathematics, decimal places is defined as the number of fractional decimal digits; that is, the number of decimal digits after the decimal point.
OK, thank you euler. I wasn't aware of (or maybe forgot over the time) the precise meaning of "decimal places", and many other problems (e.g. Problem 394) use the formulation "decimal places behind the decimal point".
Thank you for all the beautiful problems, I will continue to search for the right algorithm for this problem ...
my algorithm takes about 100 fractal iterations to get an area precision of 10 digits after the decimal point.
Is it enough to use vector-calculations with double-precision (as there are hundreds of double-calculations), or do we have to use arbitrary-precision arithmetic this problem?
@Ulrich.
The caption of this forum is:
"A place to air possible concerns or difficulties in understanding ProjectEuler problems. "
Your question does not fall in the categories mentioned in this caption. So it is off topic.
War ruins the life and health of untold numbers of innocent children.
If you have a set of pencils lying on the ground, can you draw a rectangle in a way all the pencils lie inside that rectangle? There are many ways to draw with different orientations right? This problem specifically asks for the rectangle whose sides are parallel to the largest square in the tree.
I'm having problems with this problem. I've gotten an answer I'm fairly confident in, except that it's wrong. Here's an image of the rectangle I'm getting, around a tree for n=9. Am I really off? if not, can I PM someone who speaks python my code for some advice? thanks!
jake223 wrote:I'm having problems with this problem. I've gotten an answer I'm fairly confident in, except that it's wrong. Here's an image of the rectangle I'm getting, around a tree for n=9. Am I really off? if not, can I PM someone who speaks python my code for some advice? thanks!
Yes, it is really off. It is not a numerical precision problem.
