Using only 1s, make 29 with the minimum number of digits












1












$begingroup$


Operations permitted:




  • Standard operations: +, −, ×, ÷

  • Negation: −

  • Exponentiation of two numbers: x^y

  • Square root of a number: √

  • Factorial: !

  • Concatenation of the original digits: dd






mathematics calculation-puzzle formation-of-numbers







share|improve this question







New contributor




Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$

















    1












    $begingroup$


    Operations permitted:




    • Standard operations: +, −, ×, ÷

    • Negation: −

    • Exponentiation of two numbers: x^y

    • Square root of a number: √

    • Factorial: !

    • Concatenation of the original digits: dd






    mathematics calculation-puzzle formation-of-numbers







    share|improve this question







    New contributor




    Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      1












      1








      1





      $begingroup$


      Operations permitted:




      • Standard operations: +, −, ×, ÷

      • Negation: −

      • Exponentiation of two numbers: x^y

      • Square root of a number: √

      • Factorial: !

      • Concatenation of the original digits: dd






      mathematics calculation-puzzle formation-of-numbers







      share|improve this question







      New contributor




      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      Operations permitted:




      • Standard operations: +, −, ×, ÷

      • Negation: −

      • Exponentiation of two numbers: x^y

      • Square root of a number: √

      • Factorial: !

      • Concatenation of the original digits: dd






      mathematics calculation-puzzle formation-of-numbers




      mathematics calculation-puzzle formation-of-numbers






      share|improve this question







      New contributor




      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question







      New contributor




      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question






      New contributor




      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 1 hour ago









      Allan CaoAllan Cao

      1063




      1063




      New contributor




      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Allan Cao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          2 Answers
          2






          active

          oldest

          votes


















          4












          $begingroup$

          Here's a 7 digits solution:




          7 digits: (11-1)x(1+1+1)-1







          share|improve this answer









          $endgroup$













          • $begingroup$
            That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
            $endgroup$
            – Allan Cao
            45 mins ago










          • $begingroup$
            Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
            $endgroup$
            – Dr Xorile
            43 mins ago










          • $begingroup$
            The paper uses different rules.
            $endgroup$
            – Allan Cao
            32 mins ago



















          2












          $begingroup$

          Lowest I managed so far is 9 digits:




          (1 + 1 + 1 + 1)! + 1 + 1 + 1 + 1 + 1



          11*(1 + 1 + 1) - (1 + 1 + 1 + 1)




          Some other ways I came up with:




          (1 + 1)^(1 + 1 + 1 + 1 + 1) - 1 - 1 - 1 (10 digits)



          (1 + 1 + 1 + 1 + 1)!/(1 + 1 + 1 + 1) - 1 (10 digits)



          (1 + 1 + 1 + 1 + 1)^(1 + 1) + 1 + 1 + 1 + 1 (11 digits)



          11*(1 + 1) + 1 + 1 + 1 + 1 + 1 + 1 + 1 (11 digits)







          share|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: "559"
            };
            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: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            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
            });


            }
            });






            Allan Cao is a new contributor. Be nice, and check out our Code of Conduct.










            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80050%2fusing-only-1s-make-29-with-the-minimum-number-of-digits%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









            4












            $begingroup$

            Here's a 7 digits solution:




            7 digits: (11-1)x(1+1+1)-1







            share|improve this answer









            $endgroup$













            • $begingroup$
              That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
              $endgroup$
              – Allan Cao
              45 mins ago










            • $begingroup$
              Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
              $endgroup$
              – Dr Xorile
              43 mins ago










            • $begingroup$
              The paper uses different rules.
              $endgroup$
              – Allan Cao
              32 mins ago
















            4












            $begingroup$

            Here's a 7 digits solution:




            7 digits: (11-1)x(1+1+1)-1







            share|improve this answer









            $endgroup$













            • $begingroup$
              That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
              $endgroup$
              – Allan Cao
              45 mins ago










            • $begingroup$
              Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
              $endgroup$
              – Dr Xorile
              43 mins ago










            • $begingroup$
              The paper uses different rules.
              $endgroup$
              – Allan Cao
              32 mins ago














            4












            4








            4





            $begingroup$

            Here's a 7 digits solution:




            7 digits: (11-1)x(1+1+1)-1







            share|improve this answer









            $endgroup$



            Here's a 7 digits solution:




            7 digits: (11-1)x(1+1+1)-1








            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 56 mins ago









            Dr XorileDr Xorile

            12.9k22569




            12.9k22569












            • $begingroup$
              That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
              $endgroup$
              – Allan Cao
              45 mins ago










            • $begingroup$
              Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
              $endgroup$
              – Dr Xorile
              43 mins ago










            • $begingroup$
              The paper uses different rules.
              $endgroup$
              – Allan Cao
              32 mins ago


















            • $begingroup$
              That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
              $endgroup$
              – Allan Cao
              45 mins ago










            • $begingroup$
              Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
              $endgroup$
              – Dr Xorile
              43 mins ago










            • $begingroup$
              The paper uses different rules.
              $endgroup$
              – Allan Cao
              32 mins ago
















            $begingroup$
            That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
            $endgroup$
            – Allan Cao
            45 mins ago




            $begingroup$
            That is the minimum I achieved by referencing the Single Digit Representations of Natural Numbers paper. Hopefully 6 is possible.
            $endgroup$
            – Allan Cao
            45 mins ago












            $begingroup$
            Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
            $endgroup$
            – Dr Xorile
            43 mins ago




            $begingroup$
            Do you mean that allowing concatenations should reduce it from 7 to 6? Or are the constraints the same in the paper you cite as in the question above?
            $endgroup$
            – Dr Xorile
            43 mins ago












            $begingroup$
            The paper uses different rules.
            $endgroup$
            – Allan Cao
            32 mins ago




            $begingroup$
            The paper uses different rules.
            $endgroup$
            – Allan Cao
            32 mins ago











            2












            $begingroup$

            Lowest I managed so far is 9 digits:




            (1 + 1 + 1 + 1)! + 1 + 1 + 1 + 1 + 1



            11*(1 + 1 + 1) - (1 + 1 + 1 + 1)




            Some other ways I came up with:




            (1 + 1)^(1 + 1 + 1 + 1 + 1) - 1 - 1 - 1 (10 digits)



            (1 + 1 + 1 + 1 + 1)!/(1 + 1 + 1 + 1) - 1 (10 digits)



            (1 + 1 + 1 + 1 + 1)^(1 + 1) + 1 + 1 + 1 + 1 (11 digits)



            11*(1 + 1) + 1 + 1 + 1 + 1 + 1 + 1 + 1 (11 digits)







            share|improve this answer











            $endgroup$


















              2












              $begingroup$

              Lowest I managed so far is 9 digits:




              (1 + 1 + 1 + 1)! + 1 + 1 + 1 + 1 + 1



              11*(1 + 1 + 1) - (1 + 1 + 1 + 1)




              Some other ways I came up with:




              (1 + 1)^(1 + 1 + 1 + 1 + 1) - 1 - 1 - 1 (10 digits)



              (1 + 1 + 1 + 1 + 1)!/(1 + 1 + 1 + 1) - 1 (10 digits)



              (1 + 1 + 1 + 1 + 1)^(1 + 1) + 1 + 1 + 1 + 1 (11 digits)



              11*(1 + 1) + 1 + 1 + 1 + 1 + 1 + 1 + 1 (11 digits)







              share|improve this answer











              $endgroup$
















                2












                2








                2





                $begingroup$

                Lowest I managed so far is 9 digits:




                (1 + 1 + 1 + 1)! + 1 + 1 + 1 + 1 + 1



                11*(1 + 1 + 1) - (1 + 1 + 1 + 1)




                Some other ways I came up with:




                (1 + 1)^(1 + 1 + 1 + 1 + 1) - 1 - 1 - 1 (10 digits)



                (1 + 1 + 1 + 1 + 1)!/(1 + 1 + 1 + 1) - 1 (10 digits)



                (1 + 1 + 1 + 1 + 1)^(1 + 1) + 1 + 1 + 1 + 1 (11 digits)



                11*(1 + 1) + 1 + 1 + 1 + 1 + 1 + 1 + 1 (11 digits)







                share|improve this answer











                $endgroup$



                Lowest I managed so far is 9 digits:




                (1 + 1 + 1 + 1)! + 1 + 1 + 1 + 1 + 1



                11*(1 + 1 + 1) - (1 + 1 + 1 + 1)




                Some other ways I came up with:




                (1 + 1)^(1 + 1 + 1 + 1 + 1) - 1 - 1 - 1 (10 digits)



                (1 + 1 + 1 + 1 + 1)!/(1 + 1 + 1 + 1) - 1 (10 digits)



                (1 + 1 + 1 + 1 + 1)^(1 + 1) + 1 + 1 + 1 + 1 (11 digits)



                11*(1 + 1) + 1 + 1 + 1 + 1 + 1 + 1 + 1 (11 digits)








                share|improve this answer














                share|improve this answer



                share|improve this answer








                edited 57 mins ago

























                answered 1 hour ago









                simonzacksimonzack

                267110




                267110






















                    Allan Cao is a new contributor. Be nice, and check out our Code of Conduct.










                    draft saved

                    draft discarded


















                    Allan Cao is a new contributor. Be nice, and check out our Code of Conduct.













                    Allan Cao is a new contributor. Be nice, and check out our Code of Conduct.












                    Allan Cao is a new contributor. Be nice, and check out our Code of Conduct.
















                    Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f80050%2fusing-only-1s-make-29-with-the-minimum-number-of-digits%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

                    Сан-Квентин

                    Image
                    Сан-Квентин Местоположение Сан-Квентин, Калифорния Координаты 37°56′13″ с. ш. 122°29′20″ з. д. H G Я O L Текущий статус Действует Режим безопасности минимальный и максимальный Количество мест 3 302 Открытие Июнь 1852 Находится в ведомстве California Department of Corrections and Rehabilitation Начальник Mike Martel, начальник  Сан-Квентин на Викискладе Сан-Квентин (англ.  San Quentin ) — тюрьма, располагающаяся на 432 акрах (около 1,7 км²), на мысе Сан-Квентин, в округе Марин, штат Калифорния, США. Тюрьма штата Калифорния Сан-Квентин была открыта в июле 1852 года и является старейшей в штате. Она была построена заключёнными, которые проживали в течение строительства на тюремном судне Вабан. В Сан-Квентине отбывали наказание и мужчины, и женщины до 1934 года, когда построили женскую тюрьму в Техачапи и туда перевели всех заключённых женщин. В Сан-Квентине приводятся в исполнение смертные казни, для этого имеется газовая камера, но
                    Read more

                    Алькесар

                    Image
                    Муниципалитет Алькесар Alquézar Герб 42°10′16″ с. ш. 0°01′27″ в. д. H G Я O L Страна Испания   Испания Автономное сообщество Арагон Провинция Уэска Комарка Сомонтано-де-Барбастро Алькальд Хосе Марияно Альтемир Ласкорс (ИСРП) История и география Площадь 32,36 км² Высота НУМ 660 м Часовой пояс UTC+1, летом UTC+2 Население Население 313 человек ( 2010 ) Плотность 9,92 чел./км² Этнохороним alquezarano/-a Цифровые идентификаторы Телефонный код +34 974 Почтовые индексы 22112 Автомобильный код HU alquezar.org   (исп.) Показать/скрыть карты Алькесар Алькесар Алькесар  Аудио, фото и видео на Викискладе Алькесар (исп.  Alquézar ) — муниципалитет в Испании, входит в провинцию Уэска, в составе автономного сообщества Арагон. Муниципалитет находится в составе района (комарки) Сомонтано-де-Барбастро. Занимает площадь 32,36 км². Население — 321 челове
                    Read more

                    Josef Freinademetz

                    Image
                    San Ujöp (Giuseppe/Josef) Freinademetz Josef Freinademetz in abiti cinesi   Religioso e missionario   Nascita 15 aprile 1852 Morte 28 gennaio 1908 Venerato da Chiesa cattolica Beatificazione 1975 Canonizzazione 5 ottobre 2003 Ricorrenza 28 gennaio Manuale Ujöp Freinademetz noto anche come Giuseppe o Josef Freinademetz (Oies, 15 aprile 1852 – Taikia, 28 gennaio 1908) è stato un presbitero austriaco, membro della Società del Verbo Divino, fu missionario in Cina; è venerato come santo dalla Chiesa cattolica. .mw-parser-output .citazione-table{margin-bottom:.5em;font-size:95%}.mw-parser-output .citazione-table td{padding:0 1.2em 0 2.4em}.mw-parser-output .citazione-lang{vertical-align:top}.mw-parser-output .citazione-lang td{width:50%}.mw-parser-output .citazione-lang td:first-child{padding:0 0 0 2.4em}.mw-parser-output .citazione-lang td:nth-child(2){padding:0 1.2em} «Io amo la Cina e i cinesi; voglio morire in mezzo a loro, e tra loro
                    Read more