Number of solutions of a function $f(x)$











up vote
0
down vote

favorite












We have function $f: [0,1] rightarrow [0,1]$ such that $f(x) = 4x(1-x)$. Find the number of solutions of $f^{circ n}(x)=f(f(...f(x)))...)$ ($n$ times took $f()$). I think that the answer is $2^n$ and I have tried to prove it by induction, but I did not succeed. Do you have an idea how to solve it?










share|cite|improve this question
























  • Some of the computations in this question could be useful.
    – rtybase
    Nov 25 at 22:39






  • 1




    What is a "solution" of a function?
    – bof
    Nov 25 at 23:54















up vote
0
down vote

favorite












We have function $f: [0,1] rightarrow [0,1]$ such that $f(x) = 4x(1-x)$. Find the number of solutions of $f^{circ n}(x)=f(f(...f(x)))...)$ ($n$ times took $f()$). I think that the answer is $2^n$ and I have tried to prove it by induction, but I did not succeed. Do you have an idea how to solve it?










share|cite|improve this question
























  • Some of the computations in this question could be useful.
    – rtybase
    Nov 25 at 22:39






  • 1




    What is a "solution" of a function?
    – bof
    Nov 25 at 23:54













up vote
0
down vote

favorite









up vote
0
down vote

favorite











We have function $f: [0,1] rightarrow [0,1]$ such that $f(x) = 4x(1-x)$. Find the number of solutions of $f^{circ n}(x)=f(f(...f(x)))...)$ ($n$ times took $f()$). I think that the answer is $2^n$ and I have tried to prove it by induction, but I did not succeed. Do you have an idea how to solve it?










share|cite|improve this question















We have function $f: [0,1] rightarrow [0,1]$ such that $f(x) = 4x(1-x)$. Find the number of solutions of $f^{circ n}(x)=f(f(...f(x)))...)$ ($n$ times took $f()$). I think that the answer is $2^n$ and I have tried to prove it by induction, but I did not succeed. Do you have an idea how to solve it?







functions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 27 at 15:57









rtybase

10.2k21433




10.2k21433










asked Nov 25 at 21:29







user596269



















  • Some of the computations in this question could be useful.
    – rtybase
    Nov 25 at 22:39






  • 1




    What is a "solution" of a function?
    – bof
    Nov 25 at 23:54


















  • Some of the computations in this question could be useful.
    – rtybase
    Nov 25 at 22:39






  • 1




    What is a "solution" of a function?
    – bof
    Nov 25 at 23:54
















Some of the computations in this question could be useful.
– rtybase
Nov 25 at 22:39




Some of the computations in this question could be useful.
– rtybase
Nov 25 at 22:39




1




1




What is a "solution" of a function?
– bof
Nov 25 at 23:54




What is a "solution" of a function?
– bof
Nov 25 at 23:54










2 Answers
2






active

oldest

votes

















up vote
0
down vote













It should be fairly simple to prove informally using an induction-like argument. If you have a function g(x) that has the following properties:




  • continuous

  • n minimal values of zero at x1, x2, x3...xn

  • n-1 maximal values of 1 at y1, y2, y3,...yn-1, where xk < yk < xk+1

  • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


then



applying your f to that function results in another function that has the following properties:




  • continuous

  • 2n-1 minimal values of zero at new x1, x2, x3...x2n-1

  • 2n maximal values of 1 at y1, y2, y3,...y2n, where xk < yk < xk+1

  • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


P{roof of ther first result is elementary. Proof of the second result is simply because your f(x) produces zeros at x=0 and x=1 (so your new x1..x2n-1 will consist your old x1..xn plus your old y1..yn-1. Proof of the third result comes from the fact that f(x)=1 iff x=1/2 and the continuity and monotonicity of g(x) in each sub-interval. Proof of the fourth result should also be fairly elementary.






share|cite|improve this answer




























    up vote
    0
    down vote













    From this question, for $sin^2{frac{alpha}{2}} in [0,1]$



    $$f^{circ n}left(color{red}{sin^2{frac{alpha}{2}}}right)=color{blue}{sin^2{left(2^{n-1}alpharight)}}$$
    and from
    $$color{blue}{sin^2{left(2^{n-1}alpharight)}}=0 Rightarrow
    2^{n-1}alpha=kpi Rightarrow
    alpha=frac{kpi}{2^{n-1}},kinmathbb{Z}$$

    But
    $$color{red}{sin^2{frac{alpha}{2}}}=sin^2{frac{kpi}{2^n}} tag{1}$$
    and
    $$sin^2{frac{(2^n-k)pi}{2^n}}=
    sin^2{left(pi-frac{kpi}{2^n}right)}=
    sin^2{frac{kpi}{2^n}}$$

    Thus, for $kin left{0,1,...,2^{n-1}right}$ we have $2^{n-1}+1$ different values for $(1)$ and the same number of zero's for $f^{circ n}left(xright)$.






    share|cite|improve this answer























      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%2f3013428%2fnumber-of-solutions-of-a-function-fx%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
      0
      down vote













      It should be fairly simple to prove informally using an induction-like argument. If you have a function g(x) that has the following properties:




      • continuous

      • n minimal values of zero at x1, x2, x3...xn

      • n-1 maximal values of 1 at y1, y2, y3,...yn-1, where xk < yk < xk+1

      • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


      then



      applying your f to that function results in another function that has the following properties:




      • continuous

      • 2n-1 minimal values of zero at new x1, x2, x3...x2n-1

      • 2n maximal values of 1 at y1, y2, y3,...y2n, where xk < yk < xk+1

      • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


      P{roof of ther first result is elementary. Proof of the second result is simply because your f(x) produces zeros at x=0 and x=1 (so your new x1..x2n-1 will consist your old x1..xn plus your old y1..yn-1. Proof of the third result comes from the fact that f(x)=1 iff x=1/2 and the continuity and monotonicity of g(x) in each sub-interval. Proof of the fourth result should also be fairly elementary.






      share|cite|improve this answer

























        up vote
        0
        down vote













        It should be fairly simple to prove informally using an induction-like argument. If you have a function g(x) that has the following properties:




        • continuous

        • n minimal values of zero at x1, x2, x3...xn

        • n-1 maximal values of 1 at y1, y2, y3,...yn-1, where xk < yk < xk+1

        • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


        then



        applying your f to that function results in another function that has the following properties:




        • continuous

        • 2n-1 minimal values of zero at new x1, x2, x3...x2n-1

        • 2n maximal values of 1 at y1, y2, y3,...y2n, where xk < yk < xk+1

        • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


        P{roof of ther first result is elementary. Proof of the second result is simply because your f(x) produces zeros at x=0 and x=1 (so your new x1..x2n-1 will consist your old x1..xn plus your old y1..yn-1. Proof of the third result comes from the fact that f(x)=1 iff x=1/2 and the continuity and monotonicity of g(x) in each sub-interval. Proof of the fourth result should also be fairly elementary.






        share|cite|improve this answer























          up vote
          0
          down vote










          up vote
          0
          down vote









          It should be fairly simple to prove informally using an induction-like argument. If you have a function g(x) that has the following properties:




          • continuous

          • n minimal values of zero at x1, x2, x3...xn

          • n-1 maximal values of 1 at y1, y2, y3,...yn-1, where xk < yk < xk+1

          • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


          then



          applying your f to that function results in another function that has the following properties:




          • continuous

          • 2n-1 minimal values of zero at new x1, x2, x3...x2n-1

          • 2n maximal values of 1 at y1, y2, y3,...y2n, where xk < yk < xk+1

          • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


          P{roof of ther first result is elementary. Proof of the second result is simply because your f(x) produces zeros at x=0 and x=1 (so your new x1..x2n-1 will consist your old x1..xn plus your old y1..yn-1. Proof of the third result comes from the fact that f(x)=1 iff x=1/2 and the continuity and monotonicity of g(x) in each sub-interval. Proof of the fourth result should also be fairly elementary.






          share|cite|improve this answer












          It should be fairly simple to prove informally using an induction-like argument. If you have a function g(x) that has the following properties:




          • continuous

          • n minimal values of zero at x1, x2, x3...xn

          • n-1 maximal values of 1 at y1, y2, y3,...yn-1, where xk < yk < xk+1

          • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


          then



          applying your f to that function results in another function that has the following properties:




          • continuous

          • 2n-1 minimal values of zero at new x1, x2, x3...x2n-1

          • 2n maximal values of 1 at y1, y2, y3,...y2n, where xk < yk < xk+1

          • monotonic in each of the intervals xk < x < yk, and yk < xk+1 < yk+1


          P{roof of ther first result is elementary. Proof of the second result is simply because your f(x) produces zeros at x=0 and x=1 (so your new x1..x2n-1 will consist your old x1..xn plus your old y1..yn-1. Proof of the third result comes from the fact that f(x)=1 iff x=1/2 and the continuity and monotonicity of g(x) in each sub-interval. Proof of the fourth result should also be fairly elementary.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 25 at 22:02









          Penguino

          82459




          82459






















              up vote
              0
              down vote













              From this question, for $sin^2{frac{alpha}{2}} in [0,1]$



              $$f^{circ n}left(color{red}{sin^2{frac{alpha}{2}}}right)=color{blue}{sin^2{left(2^{n-1}alpharight)}}$$
              and from
              $$color{blue}{sin^2{left(2^{n-1}alpharight)}}=0 Rightarrow
              2^{n-1}alpha=kpi Rightarrow
              alpha=frac{kpi}{2^{n-1}},kinmathbb{Z}$$

              But
              $$color{red}{sin^2{frac{alpha}{2}}}=sin^2{frac{kpi}{2^n}} tag{1}$$
              and
              $$sin^2{frac{(2^n-k)pi}{2^n}}=
              sin^2{left(pi-frac{kpi}{2^n}right)}=
              sin^2{frac{kpi}{2^n}}$$

              Thus, for $kin left{0,1,...,2^{n-1}right}$ we have $2^{n-1}+1$ different values for $(1)$ and the same number of zero's for $f^{circ n}left(xright)$.






              share|cite|improve this answer



























                up vote
                0
                down vote













                From this question, for $sin^2{frac{alpha}{2}} in [0,1]$



                $$f^{circ n}left(color{red}{sin^2{frac{alpha}{2}}}right)=color{blue}{sin^2{left(2^{n-1}alpharight)}}$$
                and from
                $$color{blue}{sin^2{left(2^{n-1}alpharight)}}=0 Rightarrow
                2^{n-1}alpha=kpi Rightarrow
                alpha=frac{kpi}{2^{n-1}},kinmathbb{Z}$$

                But
                $$color{red}{sin^2{frac{alpha}{2}}}=sin^2{frac{kpi}{2^n}} tag{1}$$
                and
                $$sin^2{frac{(2^n-k)pi}{2^n}}=
                sin^2{left(pi-frac{kpi}{2^n}right)}=
                sin^2{frac{kpi}{2^n}}$$

                Thus, for $kin left{0,1,...,2^{n-1}right}$ we have $2^{n-1}+1$ different values for $(1)$ and the same number of zero's for $f^{circ n}left(xright)$.






                share|cite|improve this answer

























                  up vote
                  0
                  down vote










                  up vote
                  0
                  down vote









                  From this question, for $sin^2{frac{alpha}{2}} in [0,1]$



                  $$f^{circ n}left(color{red}{sin^2{frac{alpha}{2}}}right)=color{blue}{sin^2{left(2^{n-1}alpharight)}}$$
                  and from
                  $$color{blue}{sin^2{left(2^{n-1}alpharight)}}=0 Rightarrow
                  2^{n-1}alpha=kpi Rightarrow
                  alpha=frac{kpi}{2^{n-1}},kinmathbb{Z}$$

                  But
                  $$color{red}{sin^2{frac{alpha}{2}}}=sin^2{frac{kpi}{2^n}} tag{1}$$
                  and
                  $$sin^2{frac{(2^n-k)pi}{2^n}}=
                  sin^2{left(pi-frac{kpi}{2^n}right)}=
                  sin^2{frac{kpi}{2^n}}$$

                  Thus, for $kin left{0,1,...,2^{n-1}right}$ we have $2^{n-1}+1$ different values for $(1)$ and the same number of zero's for $f^{circ n}left(xright)$.






                  share|cite|improve this answer














                  From this question, for $sin^2{frac{alpha}{2}} in [0,1]$



                  $$f^{circ n}left(color{red}{sin^2{frac{alpha}{2}}}right)=color{blue}{sin^2{left(2^{n-1}alpharight)}}$$
                  and from
                  $$color{blue}{sin^2{left(2^{n-1}alpharight)}}=0 Rightarrow
                  2^{n-1}alpha=kpi Rightarrow
                  alpha=frac{kpi}{2^{n-1}},kinmathbb{Z}$$

                  But
                  $$color{red}{sin^2{frac{alpha}{2}}}=sin^2{frac{kpi}{2^n}} tag{1}$$
                  and
                  $$sin^2{frac{(2^n-k)pi}{2^n}}=
                  sin^2{left(pi-frac{kpi}{2^n}right)}=
                  sin^2{frac{kpi}{2^n}}$$

                  Thus, for $kin left{0,1,...,2^{n-1}right}$ we have $2^{n-1}+1$ different values for $(1)$ and the same number of zero's for $f^{circ n}left(xright)$.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Nov 26 at 0:10

























                  answered Nov 25 at 23:48









                  rtybase

                  10.2k21433




                  10.2k21433






























                      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%2f3013428%2fnumber-of-solutions-of-a-function-fx%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

                      Tonle Sap (See)

                      I get strange results when I access the Sqlitedatabase with Unity C# via XAMPP

                      Guatemaltekische Davis-Cup-Mannschaft