Recurrence relation for the sequence $sqrt{n}, sqrt{sqrt{n}}, sqrt{sqrt{sqrt{sqrt{n}}}}cdots$












0












$begingroup$


To generate a sequence ($A$) like: $n^{frac{1}{2}}, n^{frac{1}{2^2}}, n^{frac{1}{2^3}}, n^{frac{1}{2^4}}, n^{frac{1}{2^5}}, cdots, n^{frac{1}{2^k}}$ we can define a recursive function like:



$$
f(n) =
begin{cases}
1 & text{if $n=2$}\
fleft(sqrt{n}right) & text{otherwise}
end{cases}
$$



For simplicity, we can assume that every $2^i{th}$ root of $n$ is a perfect square of some integral power of $2$, so that any $n^{frac{1}{2^i}}$ gives an integral power of $2$ and we are able to reach $n=2$ eventually (after $log_{_2}(log_{_2}(n))$ steps to be precise).



I was wondering what would be the similar recursive function for a sequence ($B$) like: $n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}} cdots$



$Bequiv n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}}cdotsequiv n^{frac{1}{2^{2^0}}}, n^{frac{1}{2^{2^1}}}, n^{frac{1}{2^{2^2}}}, n^{frac{1}{2^{2^3}}}, n^{frac{1}{2^{2^4}}}cdots $ converges in $log_{_2}(log_{_2}(log_{_2}(n))$ steps.



To visualize, the sequences are:



$A equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{n}}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}tocdots$



and



$B equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}}}}tocdots$






recurrence-relations recursion







share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    To generate a sequence ($A$) like: $n^{frac{1}{2}}, n^{frac{1}{2^2}}, n^{frac{1}{2^3}}, n^{frac{1}{2^4}}, n^{frac{1}{2^5}}, cdots, n^{frac{1}{2^k}}$ we can define a recursive function like:



    $$
    f(n) =
    begin{cases}
    1 & text{if $n=2$}\
    fleft(sqrt{n}right) & text{otherwise}
    end{cases}
    $$



    For simplicity, we can assume that every $2^i{th}$ root of $n$ is a perfect square of some integral power of $2$, so that any $n^{frac{1}{2^i}}$ gives an integral power of $2$ and we are able to reach $n=2$ eventually (after $log_{_2}(log_{_2}(n))$ steps to be precise).



    I was wondering what would be the similar recursive function for a sequence ($B$) like: $n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}} cdots$



    $Bequiv n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}}cdotsequiv n^{frac{1}{2^{2^0}}}, n^{frac{1}{2^{2^1}}}, n^{frac{1}{2^{2^2}}}, n^{frac{1}{2^{2^3}}}, n^{frac{1}{2^{2^4}}}cdots $ converges in $log_{_2}(log_{_2}(log_{_2}(n))$ steps.



    To visualize, the sequences are:



    $A equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{n}}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}tocdots$



    and



    $B equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}}}}tocdots$






    recurrence-relations recursion







    share|cite|improve this question











    $endgroup$















      0












      0








      0


      2



      $begingroup$


      To generate a sequence ($A$) like: $n^{frac{1}{2}}, n^{frac{1}{2^2}}, n^{frac{1}{2^3}}, n^{frac{1}{2^4}}, n^{frac{1}{2^5}}, cdots, n^{frac{1}{2^k}}$ we can define a recursive function like:



      $$
      f(n) =
      begin{cases}
      1 & text{if $n=2$}\
      fleft(sqrt{n}right) & text{otherwise}
      end{cases}
      $$



      For simplicity, we can assume that every $2^i{th}$ root of $n$ is a perfect square of some integral power of $2$, so that any $n^{frac{1}{2^i}}$ gives an integral power of $2$ and we are able to reach $n=2$ eventually (after $log_{_2}(log_{_2}(n))$ steps to be precise).



      I was wondering what would be the similar recursive function for a sequence ($B$) like: $n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}} cdots$



      $Bequiv n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}}cdotsequiv n^{frac{1}{2^{2^0}}}, n^{frac{1}{2^{2^1}}}, n^{frac{1}{2^{2^2}}}, n^{frac{1}{2^{2^3}}}, n^{frac{1}{2^{2^4}}}cdots $ converges in $log_{_2}(log_{_2}(log_{_2}(n))$ steps.



      To visualize, the sequences are:



      $A equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{n}}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}tocdots$



      and



      $B equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}}}}tocdots$






      recurrence-relations recursion







      share|cite|improve this question











      $endgroup$




      To generate a sequence ($A$) like: $n^{frac{1}{2}}, n^{frac{1}{2^2}}, n^{frac{1}{2^3}}, n^{frac{1}{2^4}}, n^{frac{1}{2^5}}, cdots, n^{frac{1}{2^k}}$ we can define a recursive function like:



      $$
      f(n) =
      begin{cases}
      1 & text{if $n=2$}\
      fleft(sqrt{n}right) & text{otherwise}
      end{cases}
      $$



      For simplicity, we can assume that every $2^i{th}$ root of $n$ is a perfect square of some integral power of $2$, so that any $n^{frac{1}{2^i}}$ gives an integral power of $2$ and we are able to reach $n=2$ eventually (after $log_{_2}(log_{_2}(n))$ steps to be precise).



      I was wondering what would be the similar recursive function for a sequence ($B$) like: $n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}} cdots$



      $Bequiv n^{frac{1}{2}}, n^{frac{1}{4}}, n^{frac{1}{16}}, n^{frac{1}{256}}, n^{frac{1}{256^2}}cdotsequiv n^{frac{1}{2^{2^0}}}, n^{frac{1}{2^{2^1}}}, n^{frac{1}{2^{2^2}}}, n^{frac{1}{2^{2^3}}}, n^{frac{1}{2^{2^4}}}cdots $ converges in $log_{_2}(log_{_2}(log_{_2}(n))$ steps.



      To visualize, the sequences are:



      $A equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{n}}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}tocdots$



      and



      $B equiv sqrt{n}tosqrt{sqrt{n}}tosqrt{sqrt{sqrt{sqrt{n}}}}tosqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{sqrt{n}}}}}}}}tocdots$






      recurrence-relations recursion




      recurrence-relations recursion






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 2 '18 at 16:31







      dibyendu

















      asked Dec 2 '18 at 16:06









      dibyendudibyendu

      356318




      356318






















          2 Answers
          2






          active

          oldest

          votes


















          0












          $begingroup$

          I'm not sure your recurrence for $A$ is correct. I think what you are looking for is
          $f(k) =
          begin{cases}
          n & text{if }k = 0 \
          sqrt{f(k-1)} & text{if }k > 0
          end{cases}$



          Then $f(0) = n, f(1) = sqrt{n}, f(2) = sqrt{sqrt{n}}$ etc. $f(k) = n^{frac{1}{2^k}}$ as required.



          For sequence B, the general term is $f(k) = n^{frac{1}{2^{2^k}}}$. We could write a recurrence



          $f(k+1) = n^{frac{1}{2^{2^{k+1}}}} = n^{frac{1}{2^{left(2^k+2^kright)}}} = n^{frac{1}{left(2^{2^k}right)cdot left(2^{2^k}right)}} = left(n^{frac{1}{2^{2^k}}}right)^left(frac{1}{2^{2^k}}right) = f(k)^left(frac{1}{2^{2^k}}right)$.



          We can set the base case to be $f(0) = sqrt{n} = n^{frac{1}{2^{2^0}}}$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
            $endgroup$
            – dibyendu
            Dec 4 '18 at 22:30





















          0












          $begingroup$

          I've realised that there is no way we can achieve the recurrence (in terms of the input size $n$ alone) with just a single variable $n$, as we did in case of the sequence $A$ [with $f(n)=f(sqrt{n})$].



          For sequence $B$, we somehow need to keep tack of the iteration number $i$, like this:



          $$
          f(n)=f_1(n, 1)
          $$
          $$
          f_1left(n, iright) =
          begin{cases}
          f_1left(sqrt{n}, 2right) & text{if, $i=1$}\
          1 & text{if, $n=2$}\
          f_1left(sqrt[i]{n}, i^2right) & text{otherwise}
          end{cases}
          $$



          Any other thought/suggestion is appreciated.






          share|cite|improve this answer









          $endgroup$













            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',
            autoActivateHeartbeat: false,
            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%2f3022814%2frecurrence-relation-for-the-sequence-sqrtn-sqrt-sqrtn-sqrt-sqrt-sq%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









            0












            $begingroup$

            I'm not sure your recurrence for $A$ is correct. I think what you are looking for is
            $f(k) =
            begin{cases}
            n & text{if }k = 0 \
            sqrt{f(k-1)} & text{if }k > 0
            end{cases}$



            Then $f(0) = n, f(1) = sqrt{n}, f(2) = sqrt{sqrt{n}}$ etc. $f(k) = n^{frac{1}{2^k}}$ as required.



            For sequence B, the general term is $f(k) = n^{frac{1}{2^{2^k}}}$. We could write a recurrence



            $f(k+1) = n^{frac{1}{2^{2^{k+1}}}} = n^{frac{1}{2^{left(2^k+2^kright)}}} = n^{frac{1}{left(2^{2^k}right)cdot left(2^{2^k}right)}} = left(n^{frac{1}{2^{2^k}}}right)^left(frac{1}{2^{2^k}}right) = f(k)^left(frac{1}{2^{2^k}}right)$.



            We can set the base case to be $f(0) = sqrt{n} = n^{frac{1}{2^{2^0}}}$






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
              $endgroup$
              – dibyendu
              Dec 4 '18 at 22:30


















            0












            $begingroup$

            I'm not sure your recurrence for $A$ is correct. I think what you are looking for is
            $f(k) =
            begin{cases}
            n & text{if }k = 0 \
            sqrt{f(k-1)} & text{if }k > 0
            end{cases}$



            Then $f(0) = n, f(1) = sqrt{n}, f(2) = sqrt{sqrt{n}}$ etc. $f(k) = n^{frac{1}{2^k}}$ as required.



            For sequence B, the general term is $f(k) = n^{frac{1}{2^{2^k}}}$. We could write a recurrence



            $f(k+1) = n^{frac{1}{2^{2^{k+1}}}} = n^{frac{1}{2^{left(2^k+2^kright)}}} = n^{frac{1}{left(2^{2^k}right)cdot left(2^{2^k}right)}} = left(n^{frac{1}{2^{2^k}}}right)^left(frac{1}{2^{2^k}}right) = f(k)^left(frac{1}{2^{2^k}}right)$.



            We can set the base case to be $f(0) = sqrt{n} = n^{frac{1}{2^{2^0}}}$






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
              $endgroup$
              – dibyendu
              Dec 4 '18 at 22:30
















            0












            0








            0





            $begingroup$

            I'm not sure your recurrence for $A$ is correct. I think what you are looking for is
            $f(k) =
            begin{cases}
            n & text{if }k = 0 \
            sqrt{f(k-1)} & text{if }k > 0
            end{cases}$



            Then $f(0) = n, f(1) = sqrt{n}, f(2) = sqrt{sqrt{n}}$ etc. $f(k) = n^{frac{1}{2^k}}$ as required.



            For sequence B, the general term is $f(k) = n^{frac{1}{2^{2^k}}}$. We could write a recurrence



            $f(k+1) = n^{frac{1}{2^{2^{k+1}}}} = n^{frac{1}{2^{left(2^k+2^kright)}}} = n^{frac{1}{left(2^{2^k}right)cdot left(2^{2^k}right)}} = left(n^{frac{1}{2^{2^k}}}right)^left(frac{1}{2^{2^k}}right) = f(k)^left(frac{1}{2^{2^k}}right)$.



            We can set the base case to be $f(0) = sqrt{n} = n^{frac{1}{2^{2^0}}}$






            share|cite|improve this answer









            $endgroup$



            I'm not sure your recurrence for $A$ is correct. I think what you are looking for is
            $f(k) =
            begin{cases}
            n & text{if }k = 0 \
            sqrt{f(k-1)} & text{if }k > 0
            end{cases}$



            Then $f(0) = n, f(1) = sqrt{n}, f(2) = sqrt{sqrt{n}}$ etc. $f(k) = n^{frac{1}{2^k}}$ as required.



            For sequence B, the general term is $f(k) = n^{frac{1}{2^{2^k}}}$. We could write a recurrence



            $f(k+1) = n^{frac{1}{2^{2^{k+1}}}} = n^{frac{1}{2^{left(2^k+2^kright)}}} = n^{frac{1}{left(2^{2^k}right)cdot left(2^{2^k}right)}} = left(n^{frac{1}{2^{2^k}}}right)^left(frac{1}{2^{2^k}}right) = f(k)^left(frac{1}{2^{2^k}}right)$.



            We can set the base case to be $f(0) = sqrt{n} = n^{frac{1}{2^{2^0}}}$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 4 '18 at 2:49









            AkashnilAkashnil

            1




            1












            • $begingroup$
              I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
              $endgroup$
              – dibyendu
              Dec 4 '18 at 22:30




















            • $begingroup$
              I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
              $endgroup$
              – dibyendu
              Dec 4 '18 at 22:30


















            $begingroup$
            I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
            $endgroup$
            – dibyendu
            Dec 4 '18 at 22:30






            $begingroup$
            I guess both are correct. You've defined the recurrence in terms of the number of iterations ($k$) it takes the recurrence to converge, while I tried to define it in terms of the problem size or input size ($n$).
            $endgroup$
            – dibyendu
            Dec 4 '18 at 22:30













            0












            $begingroup$

            I've realised that there is no way we can achieve the recurrence (in terms of the input size $n$ alone) with just a single variable $n$, as we did in case of the sequence $A$ [with $f(n)=f(sqrt{n})$].



            For sequence $B$, we somehow need to keep tack of the iteration number $i$, like this:



            $$
            f(n)=f_1(n, 1)
            $$
            $$
            f_1left(n, iright) =
            begin{cases}
            f_1left(sqrt{n}, 2right) & text{if, $i=1$}\
            1 & text{if, $n=2$}\
            f_1left(sqrt[i]{n}, i^2right) & text{otherwise}
            end{cases}
            $$



            Any other thought/suggestion is appreciated.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              I've realised that there is no way we can achieve the recurrence (in terms of the input size $n$ alone) with just a single variable $n$, as we did in case of the sequence $A$ [with $f(n)=f(sqrt{n})$].



              For sequence $B$, we somehow need to keep tack of the iteration number $i$, like this:



              $$
              f(n)=f_1(n, 1)
              $$
              $$
              f_1left(n, iright) =
              begin{cases}
              f_1left(sqrt{n}, 2right) & text{if, $i=1$}\
              1 & text{if, $n=2$}\
              f_1left(sqrt[i]{n}, i^2right) & text{otherwise}
              end{cases}
              $$



              Any other thought/suggestion is appreciated.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                I've realised that there is no way we can achieve the recurrence (in terms of the input size $n$ alone) with just a single variable $n$, as we did in case of the sequence $A$ [with $f(n)=f(sqrt{n})$].



                For sequence $B$, we somehow need to keep tack of the iteration number $i$, like this:



                $$
                f(n)=f_1(n, 1)
                $$
                $$
                f_1left(n, iright) =
                begin{cases}
                f_1left(sqrt{n}, 2right) & text{if, $i=1$}\
                1 & text{if, $n=2$}\
                f_1left(sqrt[i]{n}, i^2right) & text{otherwise}
                end{cases}
                $$



                Any other thought/suggestion is appreciated.






                share|cite|improve this answer









                $endgroup$



                I've realised that there is no way we can achieve the recurrence (in terms of the input size $n$ alone) with just a single variable $n$, as we did in case of the sequence $A$ [with $f(n)=f(sqrt{n})$].



                For sequence $B$, we somehow need to keep tack of the iteration number $i$, like this:



                $$
                f(n)=f_1(n, 1)
                $$
                $$
                f_1left(n, iright) =
                begin{cases}
                f_1left(sqrt{n}, 2right) & text{if, $i=1$}\
                1 & text{if, $n=2$}\
                f_1left(sqrt[i]{n}, i^2right) & text{otherwise}
                end{cases}
                $$



                Any other thought/suggestion is appreciated.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 4 '18 at 22:54









                dibyendudibyendu

                356318




                356318






























                    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.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3022814%2frecurrence-relation-for-the-sequence-sqrtn-sqrt-sqrtn-sqrt-sqrt-sq%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

                    How to change which sound is reproduced for terminal bell?

                    Image
                    3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
                    Read more

                    Can I use Tabulator js library in my java Spring + Thymeleaf project?

                    Image
                    0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
                    Read more

                    Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

                    Image
                    up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx...
                    Read more