Prove that there exists a triangle which can be cut into 2005 congruent triangles.











up vote
24
down vote

favorite
10












I thought maybe we can start with congruent triangle and try to cut it similar to how we create a Sierpinski's Triangle? However, the number of smaller triangles we get is a power of $4$ so it does not work. Any ideas?










share|cite|improve this question




























    up vote
    24
    down vote

    favorite
    10












    I thought maybe we can start with congruent triangle and try to cut it similar to how we create a Sierpinski's Triangle? However, the number of smaller triangles we get is a power of $4$ so it does not work. Any ideas?










    share|cite|improve this question


























      up vote
      24
      down vote

      favorite
      10









      up vote
      24
      down vote

      favorite
      10






      10





      I thought maybe we can start with congruent triangle and try to cut it similar to how we create a Sierpinski's Triangle? However, the number of smaller triangles we get is a power of $4$ so it does not work. Any ideas?










      share|cite|improve this question















      I thought maybe we can start with congruent triangle and try to cut it similar to how we create a Sierpinski's Triangle? However, the number of smaller triangles we get is a power of $4$ so it does not work. Any ideas?







      geometry contest-math






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 26 at 2:08









      Akash Roy

      1




      1










      asked Nov 26 at 1:59









      mathnoob

      1,505217




      1,505217






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          46
          down vote



          accepted










          The decomposition is possible because $2005 = 5cdot 401$ and both $5$ and $401$ are primes of the form $4k+1$. This allow $2005$ to be written as a sum of squares.



          $$2005 = 22^2 + 39^2 = 18^2+41^2$$



          For any integer $n = p^2 + q^2$ that can be written as a sum of squares.
          Consider a right-angled triangle $ABC$ with
          $$AB = psqrt{n}, AC = qsqrt{n}quadtext{ and }quad BC = n$$
          Let $D$ on $BC$ be the foot of attitude at $A$. It is easy to
          see $triangle DBA$ and $triangle DAC$ are similar to $triangle ABC$ with



          $$BD = p^2, AD = pqquadtext{ and }quad CD = q^2$$
          One can split $triangle DBA$ into $p^2$ and $triangle DAC$ into $q^2$
          triangles with sides $p, q$ and $sqrt{n}$.



          As an example, following is a subdivision of a triangle into $13 = 2^2 + 3^2$ congruent triangles.



          tiling by 13 congruent triangles



          In the literature, this is known as a biquadratic tiling of a triangle. For more information about subdividing triangles into congruent triangles, look at answers in this MO post. In particular, the list of papers by Michael Beeson there. The construction described here is based on what I have learned from one of Michael's papers.






          share|cite|improve this answer






























            up vote
            12
            down vote













            Since $2005$ is the sum of two squares, there exists this sort of triangle. In a contest setting, if you're trying to show $2005$ is a sum of two squares, realize that $2005=401cdot 5$. Since 401 and 5 are sums of squares, we know that their product is also a sum of squares.



            Now in general if we have $n=x^2+y^2$, let our triangle be an $x$ by $y$ right triangle. Then, we can split this triangle along the altitude to the hypotenuse, which gives us two similar triangles with hypotenuses $x$ and $y$ respectively. Finally, we can decompose each of these into $x^2$ and $y^2$ similar right triangles with hypotenuses $1$, via a stretched version of the following picture.



            Triangle Tiling






            share|cite|improve this answer





















            • I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
              – Isaac Browne
              Nov 26 at 2:49








            • 4




              The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
              – Empy2
              Nov 26 at 3:07






            • 2




              Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
              – Isaac Browne
              Nov 26 at 3:11






            • 6




              It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
              – achille hui
              Nov 26 at 4:00






            • 1




              @achillehui: Gosh — a lovely paper, and very hot off the press!
              – Peter LeFanu Lumsdaine
              Nov 26 at 10:21











            Your Answer





            StackExchange.ifUsing("editor", function () {
            return StackExchange.using("mathjaxEditing", function () {
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            });
            });
            }, "mathjax-editing");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "69"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3013709%2fprove-that-there-exists-a-triangle-which-can-be-cut-into-2005-congruent-triangle%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            46
            down vote



            accepted










            The decomposition is possible because $2005 = 5cdot 401$ and both $5$ and $401$ are primes of the form $4k+1$. This allow $2005$ to be written as a sum of squares.



            $$2005 = 22^2 + 39^2 = 18^2+41^2$$



            For any integer $n = p^2 + q^2$ that can be written as a sum of squares.
            Consider a right-angled triangle $ABC$ with
            $$AB = psqrt{n}, AC = qsqrt{n}quadtext{ and }quad BC = n$$
            Let $D$ on $BC$ be the foot of attitude at $A$. It is easy to
            see $triangle DBA$ and $triangle DAC$ are similar to $triangle ABC$ with



            $$BD = p^2, AD = pqquadtext{ and }quad CD = q^2$$
            One can split $triangle DBA$ into $p^2$ and $triangle DAC$ into $q^2$
            triangles with sides $p, q$ and $sqrt{n}$.



            As an example, following is a subdivision of a triangle into $13 = 2^2 + 3^2$ congruent triangles.



            tiling by 13 congruent triangles



            In the literature, this is known as a biquadratic tiling of a triangle. For more information about subdividing triangles into congruent triangles, look at answers in this MO post. In particular, the list of papers by Michael Beeson there. The construction described here is based on what I have learned from one of Michael's papers.






            share|cite|improve this answer



























              up vote
              46
              down vote



              accepted










              The decomposition is possible because $2005 = 5cdot 401$ and both $5$ and $401$ are primes of the form $4k+1$. This allow $2005$ to be written as a sum of squares.



              $$2005 = 22^2 + 39^2 = 18^2+41^2$$



              For any integer $n = p^2 + q^2$ that can be written as a sum of squares.
              Consider a right-angled triangle $ABC$ with
              $$AB = psqrt{n}, AC = qsqrt{n}quadtext{ and }quad BC = n$$
              Let $D$ on $BC$ be the foot of attitude at $A$. It is easy to
              see $triangle DBA$ and $triangle DAC$ are similar to $triangle ABC$ with



              $$BD = p^2, AD = pqquadtext{ and }quad CD = q^2$$
              One can split $triangle DBA$ into $p^2$ and $triangle DAC$ into $q^2$
              triangles with sides $p, q$ and $sqrt{n}$.



              As an example, following is a subdivision of a triangle into $13 = 2^2 + 3^2$ congruent triangles.



              tiling by 13 congruent triangles



              In the literature, this is known as a biquadratic tiling of a triangle. For more information about subdividing triangles into congruent triangles, look at answers in this MO post. In particular, the list of papers by Michael Beeson there. The construction described here is based on what I have learned from one of Michael's papers.






              share|cite|improve this answer

























                up vote
                46
                down vote



                accepted







                up vote
                46
                down vote



                accepted






                The decomposition is possible because $2005 = 5cdot 401$ and both $5$ and $401$ are primes of the form $4k+1$. This allow $2005$ to be written as a sum of squares.



                $$2005 = 22^2 + 39^2 = 18^2+41^2$$



                For any integer $n = p^2 + q^2$ that can be written as a sum of squares.
                Consider a right-angled triangle $ABC$ with
                $$AB = psqrt{n}, AC = qsqrt{n}quadtext{ and }quad BC = n$$
                Let $D$ on $BC$ be the foot of attitude at $A$. It is easy to
                see $triangle DBA$ and $triangle DAC$ are similar to $triangle ABC$ with



                $$BD = p^2, AD = pqquadtext{ and }quad CD = q^2$$
                One can split $triangle DBA$ into $p^2$ and $triangle DAC$ into $q^2$
                triangles with sides $p, q$ and $sqrt{n}$.



                As an example, following is a subdivision of a triangle into $13 = 2^2 + 3^2$ congruent triangles.



                tiling by 13 congruent triangles



                In the literature, this is known as a biquadratic tiling of a triangle. For more information about subdividing triangles into congruent triangles, look at answers in this MO post. In particular, the list of papers by Michael Beeson there. The construction described here is based on what I have learned from one of Michael's papers.






                share|cite|improve this answer














                The decomposition is possible because $2005 = 5cdot 401$ and both $5$ and $401$ are primes of the form $4k+1$. This allow $2005$ to be written as a sum of squares.



                $$2005 = 22^2 + 39^2 = 18^2+41^2$$



                For any integer $n = p^2 + q^2$ that can be written as a sum of squares.
                Consider a right-angled triangle $ABC$ with
                $$AB = psqrt{n}, AC = qsqrt{n}quadtext{ and }quad BC = n$$
                Let $D$ on $BC$ be the foot of attitude at $A$. It is easy to
                see $triangle DBA$ and $triangle DAC$ are similar to $triangle ABC$ with



                $$BD = p^2, AD = pqquadtext{ and }quad CD = q^2$$
                One can split $triangle DBA$ into $p^2$ and $triangle DAC$ into $q^2$
                triangles with sides $p, q$ and $sqrt{n}$.



                As an example, following is a subdivision of a triangle into $13 = 2^2 + 3^2$ congruent triangles.



                tiling by 13 congruent triangles



                In the literature, this is known as a biquadratic tiling of a triangle. For more information about subdividing triangles into congruent triangles, look at answers in this MO post. In particular, the list of papers by Michael Beeson there. The construction described here is based on what I have learned from one of Michael's papers.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Nov 27 at 0:23

























                answered Nov 26 at 2:57









                achille hui

                94.7k5129255




                94.7k5129255






















                    up vote
                    12
                    down vote













                    Since $2005$ is the sum of two squares, there exists this sort of triangle. In a contest setting, if you're trying to show $2005$ is a sum of two squares, realize that $2005=401cdot 5$. Since 401 and 5 are sums of squares, we know that their product is also a sum of squares.



                    Now in general if we have $n=x^2+y^2$, let our triangle be an $x$ by $y$ right triangle. Then, we can split this triangle along the altitude to the hypotenuse, which gives us two similar triangles with hypotenuses $x$ and $y$ respectively. Finally, we can decompose each of these into $x^2$ and $y^2$ similar right triangles with hypotenuses $1$, via a stretched version of the following picture.



                    Triangle Tiling






                    share|cite|improve this answer





















                    • I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
                      – Isaac Browne
                      Nov 26 at 2:49








                    • 4




                      The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
                      – Empy2
                      Nov 26 at 3:07






                    • 2




                      Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
                      – Isaac Browne
                      Nov 26 at 3:11






                    • 6




                      It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
                      – achille hui
                      Nov 26 at 4:00






                    • 1




                      @achillehui: Gosh — a lovely paper, and very hot off the press!
                      – Peter LeFanu Lumsdaine
                      Nov 26 at 10:21















                    up vote
                    12
                    down vote













                    Since $2005$ is the sum of two squares, there exists this sort of triangle. In a contest setting, if you're trying to show $2005$ is a sum of two squares, realize that $2005=401cdot 5$. Since 401 and 5 are sums of squares, we know that their product is also a sum of squares.



                    Now in general if we have $n=x^2+y^2$, let our triangle be an $x$ by $y$ right triangle. Then, we can split this triangle along the altitude to the hypotenuse, which gives us two similar triangles with hypotenuses $x$ and $y$ respectively. Finally, we can decompose each of these into $x^2$ and $y^2$ similar right triangles with hypotenuses $1$, via a stretched version of the following picture.



                    Triangle Tiling






                    share|cite|improve this answer





















                    • I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
                      – Isaac Browne
                      Nov 26 at 2:49








                    • 4




                      The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
                      – Empy2
                      Nov 26 at 3:07






                    • 2




                      Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
                      – Isaac Browne
                      Nov 26 at 3:11






                    • 6




                      It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
                      – achille hui
                      Nov 26 at 4:00






                    • 1




                      @achillehui: Gosh — a lovely paper, and very hot off the press!
                      – Peter LeFanu Lumsdaine
                      Nov 26 at 10:21













                    up vote
                    12
                    down vote










                    up vote
                    12
                    down vote









                    Since $2005$ is the sum of two squares, there exists this sort of triangle. In a contest setting, if you're trying to show $2005$ is a sum of two squares, realize that $2005=401cdot 5$. Since 401 and 5 are sums of squares, we know that their product is also a sum of squares.



                    Now in general if we have $n=x^2+y^2$, let our triangle be an $x$ by $y$ right triangle. Then, we can split this triangle along the altitude to the hypotenuse, which gives us two similar triangles with hypotenuses $x$ and $y$ respectively. Finally, we can decompose each of these into $x^2$ and $y^2$ similar right triangles with hypotenuses $1$, via a stretched version of the following picture.



                    Triangle Tiling






                    share|cite|improve this answer












                    Since $2005$ is the sum of two squares, there exists this sort of triangle. In a contest setting, if you're trying to show $2005$ is a sum of two squares, realize that $2005=401cdot 5$. Since 401 and 5 are sums of squares, we know that their product is also a sum of squares.



                    Now in general if we have $n=x^2+y^2$, let our triangle be an $x$ by $y$ right triangle. Then, we can split this triangle along the altitude to the hypotenuse, which gives us two similar triangles with hypotenuses $x$ and $y$ respectively. Finally, we can decompose each of these into $x^2$ and $y^2$ similar right triangles with hypotenuses $1$, via a stretched version of the following picture.



                    Triangle Tiling







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Nov 26 at 2:47









                    Isaac Browne

                    4,59731032




                    4,59731032












                    • I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
                      – Isaac Browne
                      Nov 26 at 2:49








                    • 4




                      The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
                      – Empy2
                      Nov 26 at 3:07






                    • 2




                      Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
                      – Isaac Browne
                      Nov 26 at 3:11






                    • 6




                      It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
                      – achille hui
                      Nov 26 at 4:00






                    • 1




                      @achillehui: Gosh — a lovely paper, and very hot off the press!
                      – Peter LeFanu Lumsdaine
                      Nov 26 at 10:21


















                    • I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
                      – Isaac Browne
                      Nov 26 at 2:49








                    • 4




                      The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
                      – Empy2
                      Nov 26 at 3:07






                    • 2




                      Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
                      – Isaac Browne
                      Nov 26 at 3:11






                    • 6




                      It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
                      – achille hui
                      Nov 26 at 4:00






                    • 1




                      @achillehui: Gosh — a lovely paper, and very hot off the press!
                      – Peter LeFanu Lumsdaine
                      Nov 26 at 10:21
















                    I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
                    – Isaac Browne
                    Nov 26 at 2:49






                    I know this sum of squares is a sufficient condition, but I'm not sure if it's necessary. Any thoughts on this? As a particular example, would $3$ or $7$ work?
                    – Isaac Browne
                    Nov 26 at 2:49






                    4




                    4




                    The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
                    – Empy2
                    Nov 26 at 3:07




                    The $30-60-90$ triangle can be divided into three triangles. Start by bisecting the 60 angle.
                    – Empy2
                    Nov 26 at 3:07




                    2




                    2




                    Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
                    – Isaac Browne
                    Nov 26 at 3:11




                    Alright, so $3$ works. I also just thought of the construction of connecting vertices of an equilateral triangle to the center, which would create three congruent triangles. Any others?
                    – Isaac Browne
                    Nov 26 at 3:11




                    6




                    6




                    It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
                    – achille hui
                    Nov 26 at 4:00




                    It seems Michael Beeson has proved that $7$ is impossible recently. this appears on his web site, not yet available on arXiv...
                    – achille hui
                    Nov 26 at 4:00




                    1




                    1




                    @achillehui: Gosh — a lovely paper, and very hot off the press!
                    – Peter LeFanu Lumsdaine
                    Nov 26 at 10:21




                    @achillehui: Gosh — a lovely paper, and very hot off the press!
                    – Peter LeFanu Lumsdaine
                    Nov 26 at 10:21


















                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3013709%2fprove-that-there-exists-a-triangle-which-can-be-cut-into-2005-congruent-triangle%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Berounka

                    Sphinx de Gizeh

                    Different font size/position of beamer's navigation symbols template's content depending on regular/plain...