Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. The Lounge
  3. Math Puzzle

Math Puzzle

Scheduled Pinned Locked Moved The Lounge
question
30 Posts 13 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • J Joaquin M Lopez Munoz

    0 is simple, so is 1. For the rest: n=-log2[log2(sqrt(sqrt(...n times...(2)...))))] Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

    J Offline
    J Offline
    Jorgen Sigvardsson
    wrote on last edited by
    #17

    You have a degree in mathematics, don't you? :) -- I am on fire. Do you need a light?

    J 1 Reply Last reply
    0
    • J Joaquin M Lopez Munoz

      0 is simple, so is 1. For the rest: n=-log2[log2(sqrt(sqrt(...n times...(2)...))))] Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

      C Offline
      C Offline
      carrie
      wrote on last edited by
      #18

      haha, absolute genius :)

      1 Reply Last reply
      0
      • J Joaquin M Lopez Munoz

        0 is simple, so is 1. For the rest: n=-log2[log2(sqrt(sqrt(...n times...(2)...))))] Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

        R Offline
        R Offline
        Ryan Binns
        wrote on last edited by
        #19

        Well done :)

        Ryan

        "Punctuality is only a virtue for those who aren't smart enough to think of good excuses for being late" John Nichol "Point Of Impact"

        1 Reply Last reply
        0
        • J Joaquin M Lopez Munoz

          0 is simple, so is 1. For the rest: n=-log2[log2(sqrt(sqrt(...n times...(2)...))))] Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

          B Offline
          B Offline
          Brad Jennings
          wrote on last edited by
          #20

          Genius!:) Brad Jennings "You're mom is nice. Mind if I go out with her?" - Jörgen Sigvardsson

          1 Reply Last reply
          0
          • J Joaquin M Lopez Munoz

            0 is simple, so is 1. For the rest: n=-log2[log2(sqrt(sqrt(...n times...(2)...))))] Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

            S Offline
            S Offline
            Shree
            wrote on last edited by
            #21

            That's it!!

            W 1 Reply Last reply
            0
            • J Jorgen Sigvardsson

              You have a degree in mathematics, don't you? :) -- I am on fire. Do you need a light?

              J Offline
              J Offline
              Joaquin M Lopez Munoz
              wrote on last edited by
              #22

              No I don't :) I'm a electrical engineer, but used to be fond of these kind of quizzes when I was younger. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

              J 1 Reply Last reply
              0
              • J Joaquin M Lopez Munoz

                No I don't :) I'm a electrical engineer, but used to be fond of these kind of quizzes when I was younger. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

                J Offline
                J Offline
                Jorgen Sigvardsson
                wrote on last edited by
                #23

                Have you read Gödel Escher Bach - The Eternal Golden Braid? Your solution reminded me a lot of the authors (Hofstadter) representation of the natural numbers. He defined it by an axiom 0 (zero) and an operation S (successor). Your log/sqrt solution for simulating S gave me a flashback.. :) -- I am on fire. Do you need a light?

                J 1 Reply Last reply
                0
                • S Shree

                  How can you write any positive integer using only three 2s and any mathematical operations?

                  W Offline
                  W Offline
                  Wesner Moise
                  wrote on last edited by
                  #24

                  The answer would involve some constructed function f(x) that increases x by 1. Then, applying f(x) to itself would allow all the positive numbers be generated. IE, f(2) = 3, and f(f(2)) = 4, and f^n(2) = 2+n-1. Since 2 is the only number we are allow, f(2) is really the only possibility, unless you want to consider f(22) or f(222) or f(2/2) or etc, but then we wastes our valuable 2s. Some functions f(x) that satisfy, are: f(x) = -(~x) --> bitwise negation followed by arithmetic negation f(x) = combination of logs and sqrts of a prior post so, my solution, the first f(x), can obtain, for example, 5 which is -~-~-~2. Thanks, Wes

                  S R W 3 Replies Last reply
                  0
                  • S Shree

                    That's it!!

                    W Offline
                    W Offline
                    Wesner Moise
                    wrote on last edited by
                    #25

                    my answer -~-~...-~2 is simpler and requires only one 2.

                    1 Reply Last reply
                    0
                    • W Wesner Moise

                      The answer would involve some constructed function f(x) that increases x by 1. Then, applying f(x) to itself would allow all the positive numbers be generated. IE, f(2) = 3, and f(f(2)) = 4, and f^n(2) = 2+n-1. Since 2 is the only number we are allow, f(2) is really the only possibility, unless you want to consider f(22) or f(222) or f(2/2) or etc, but then we wastes our valuable 2s. Some functions f(x) that satisfy, are: f(x) = -(~x) --> bitwise negation followed by arithmetic negation f(x) = combination of logs and sqrts of a prior post so, my solution, the first f(x), can obtain, for example, 5 which is -~-~-~2. Thanks, Wes

                      S Offline
                      S Offline
                      Shree
                      wrote on last edited by
                      #26

                      Great!!

                      1 Reply Last reply
                      0
                      • W Wesner Moise

                        The answer would involve some constructed function f(x) that increases x by 1. Then, applying f(x) to itself would allow all the positive numbers be generated. IE, f(2) = 3, and f(f(2)) = 4, and f^n(2) = 2+n-1. Since 2 is the only number we are allow, f(2) is really the only possibility, unless you want to consider f(22) or f(222) or f(2/2) or etc, but then we wastes our valuable 2s. Some functions f(x) that satisfy, are: f(x) = -(~x) --> bitwise negation followed by arithmetic negation f(x) = combination of logs and sqrts of a prior post so, my solution, the first f(x), can obtain, for example, 5 which is -~-~-~2. Thanks, Wes

                        R Offline
                        R Offline
                        Ryan Binns
                        wrote on last edited by
                        #27

                        Brilliant! Well done :)

                        Ryan

                        "Punctuality is only a virtue for those who aren't smart enough to think of good excuses for being late" John Nichol "Point Of Impact"

                        1 Reply Last reply
                        0
                        • W Wesner Moise

                          The answer would involve some constructed function f(x) that increases x by 1. Then, applying f(x) to itself would allow all the positive numbers be generated. IE, f(2) = 3, and f(f(2)) = 4, and f^n(2) = 2+n-1. Since 2 is the only number we are allow, f(2) is really the only possibility, unless you want to consider f(22) or f(222) or f(2/2) or etc, but then we wastes our valuable 2s. Some functions f(x) that satisfy, are: f(x) = -(~x) --> bitwise negation followed by arithmetic negation f(x) = combination of logs and sqrts of a prior post so, my solution, the first f(x), can obtain, for example, 5 which is -~-~-~2. Thanks, Wes

                          W Offline
                          W Offline
                          Wesner Moise
                          wrote on last edited by
                          #28

                          Regarding, my answer, -~-~-~ ... -~2, it is can be done with log n operations by appropriate using replacing some of the inner operations with the sqr or factorial functions. Thanks, Wes

                          1 Reply Last reply
                          0
                          • J Jorgen Sigvardsson

                            Have you read Gödel Escher Bach - The Eternal Golden Braid? Your solution reminded me a lot of the authors (Hofstadter) representation of the natural numbers. He defined it by an axiom 0 (zero) and an operation S (successor). Your log/sqrt solution for simulating S gave me a flashback.. :) -- I am on fire. Do you need a light?

                            J Offline
                            J Offline
                            Joaquin M Lopez Munoz
                            wrote on last edited by
                            #29

                            Yes, that was a nice book. If you like this sort of stuff, a lighter, but equally fun book on logic matters is What is the Name of this Book? by Raymond Smullyan. It has some Gödelian discussions in the last chapters. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

                            1 Reply Last reply
                            0
                            • R Ryan Binns

                              Atlantys wrote: The largest number I can do is: 4194304 (2^22) Really?! What about 222! = approx 1.12*10426

                              Ryan

                              "Punctuality is only a virtue for those who aren't smart enough to think of good excuses for being late" John Nichol "Point Of Impact"

                              A Offline
                              A Offline
                              Atlantys
                              wrote on last edited by
                              #30

                              Doh! I was trying to use an operator that causes the system to grow large very quickly. Hence ^. I complete forget about !. Dammit! I suppose that's what staying up late does to the brain. Of course... you can then do ((222!)!), etc. :~ :~ I prefer to wear gloves when using it, but that's merely a matter of personal hygiene [Roger Wright on VB] Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the Universe trying to produce bigger and better idiots. So far, the Universe is winning. [Rich Cook]

                              1 Reply Last reply
                              0
                              Reply
                              • Reply as topic
                              Log in to reply
                              • Oldest to Newest
                              • Newest to Oldest
                              • Most Votes


                              • Login

                              • Don't have an account? Register

                              • Login or register to search.
                              • First post
                                Last post
                              0
                              • Categories
                              • Recent
                              • Tags
                              • Popular
                              • World
                              • Users
                              • Groups