Is it a Cyclops number? “Nobody” knows!Sum of Binary SubstringsIs this a Smith number?Is this number...

What can I do if someone tampers with my SSH public key?

Does the US political system, in principle, allow for a no-party system?

Where is the fallacy here?

Where do you go through passport control when transiting through another Schengen airport on your way out of the Schengen area?

Why would the IRS ask for birth certificates or even audit a small tax return?

Computing the volume of a simplex-like object with constraints

School performs periodic password audits. Is my password compromised?

What is the purpose of a disclaimer like "this is not legal advice"?

Can a Mimic (container form) actually hold loot?

Why do we call complex numbers “numbers” but we don’t consider 2 vectors numbers?

Do natural melee weapons (from racial traits) trigger Improved Divine Smite?

Is this nominative case or accusative case?

What is better: yes / no radio, or simple checkbox?

An Undercover Army

Dukha vs legitimate need

Affine transformation of circular arc in 3D

“I had a flat in the centre of town, but I didn’t like living there, so …”

Can a Mexican citizen living in US under DACA drive to Canada?

PTiJ: How should animals pray?

Should we avoid writing fiction about historical events without extensive research?

Professor forcing me to attend a conference

What is a term for a function that when called repeatedly, has the same effect as calling once?

How to make sure I'm assertive enough in contact with subordinates?

What is Tony Stark injecting into himself in Iron Man 3?



Is it a Cyclops number? “Nobody” knows!


Sum of Binary SubstringsIs this a Smith number?Is this number triangular?Test if two numbers are equalIs this number a repdigit?Am I divisible by double the sum of my digits?Is the number binary-heavy?Is it a whole number?Binary SubstringsDiluted Integer Sums













1












$begingroup$


Task:



Given an integer input, figure out whether or not it is a Cyclops Number.



What is a Cyclops number, you may ask? Well, it's a number whose binary representation only has one 0 in the center!



Test Cases:



Input | Output

--------------

1     | falsy

5     | truthy

12    | falsy    

27    | truthy

85    | falsy

101   | falsy

119   | truthy


Input: An integer or equivalent types. (int, long, decimal, etc.)
Output:




  • Truthy or falsy (e.g. true or false, 0 or 1)..


Challenge Rules:




  • Input that is less than 0 is assumed to be falsy.


  • If the length of the binary representation of the number is even, then the number cannot be a Cyclops number.



General Rules:




  • This is code-golf, so the shortest answers in bytes wins!.


  • Default loopholes are forbidden.


  • Standard rules apply for your answer with default I/O rules.




This is my first Programming Puzzles & Code Golf challenge, so any feedback on how I should improve would be much appreciated!






code-golf number decision-problem binary







share|improve this question









New contributor




Tau 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$
    You've essentially made two separate challenges, one a decision problem and one about outputting the next number of a sequence. This will not do what you want, which is invite more answers, but instead put off users who now need to consider three options about what to program before posting. I'd recommend removing the option, and in the future you can try posting to our sandbox first where hopefully you will get helpful feedback before posting. Good luck!
    $endgroup$
    – FryAmTheEggman
    2 hours ago










  • $begingroup$
    @SriotchilismO'Zaic thanks for the feedback! I have edited the post.
    $endgroup$
    – Tau
    1 hour ago






  • 1




    $begingroup$
    I'd also recommend removing the hard coding restriction. By default solutions would need to handle all cyclops numbers in theory, and there are clearly infinitely many of them, so they couldn't all be hardcoded.
    $endgroup$
    – FryAmTheEggman
    1 hour ago






  • 1




    $begingroup$
    Note: This is A129868
    $endgroup$
    – tsh
    1 hour ago






  • 2




    $begingroup$
    Should 119 be true?
    $endgroup$
    – Quintec
    1 hour ago
















1












$begingroup$


Task:



Given an integer input, figure out whether or not it is a Cyclops Number.



What is a Cyclops number, you may ask? Well, it's a number whose binary representation only has one 0 in the center!



Test Cases:



Input | Output

--------------

1     | falsy

5     | truthy

12    | falsy    

27    | truthy

85    | falsy

101   | falsy

119   | truthy


Input: An integer or equivalent types. (int, long, decimal, etc.)
Output:




  • Truthy or falsy (e.g. true or false, 0 or 1)..


Challenge Rules:




  • Input that is less than 0 is assumed to be falsy.


  • If the length of the binary representation of the number is even, then the number cannot be a Cyclops number.



General Rules:




  • This is code-golf, so the shortest answers in bytes wins!.


  • Default loopholes are forbidden.


  • Standard rules apply for your answer with default I/O rules.




This is my first Programming Puzzles & Code Golf challenge, so any feedback on how I should improve would be much appreciated!






code-golf number decision-problem binary







share|improve this question









New contributor




Tau 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$
    You've essentially made two separate challenges, one a decision problem and one about outputting the next number of a sequence. This will not do what you want, which is invite more answers, but instead put off users who now need to consider three options about what to program before posting. I'd recommend removing the option, and in the future you can try posting to our sandbox first where hopefully you will get helpful feedback before posting. Good luck!
    $endgroup$
    – FryAmTheEggman
    2 hours ago










  • $begingroup$
    @SriotchilismO'Zaic thanks for the feedback! I have edited the post.
    $endgroup$
    – Tau
    1 hour ago






  • 1




    $begingroup$
    I'd also recommend removing the hard coding restriction. By default solutions would need to handle all cyclops numbers in theory, and there are clearly infinitely many of them, so they couldn't all be hardcoded.
    $endgroup$
    – FryAmTheEggman
    1 hour ago






  • 1




    $begingroup$
    Note: This is A129868
    $endgroup$
    – tsh
    1 hour ago






  • 2




    $begingroup$
    Should 119 be true?
    $endgroup$
    – Quintec
    1 hour ago














1












1








1





$begingroup$


Task:



Given an integer input, figure out whether or not it is a Cyclops Number.



What is a Cyclops number, you may ask? Well, it's a number whose binary representation only has one 0 in the center!



Test Cases:



Input | Output

--------------

1     | falsy

5     | truthy

12    | falsy    

27    | truthy

85    | falsy

101   | falsy

119   | truthy


Input: An integer or equivalent types. (int, long, decimal, etc.)
Output:




  • Truthy or falsy (e.g. true or false, 0 or 1)..


Challenge Rules:




  • Input that is less than 0 is assumed to be falsy.


  • If the length of the binary representation of the number is even, then the number cannot be a Cyclops number.



General Rules:




  • This is code-golf, so the shortest answers in bytes wins!.


  • Default loopholes are forbidden.


  • Standard rules apply for your answer with default I/O rules.




This is my first Programming Puzzles & Code Golf challenge, so any feedback on how I should improve would be much appreciated!






code-golf number decision-problem binary







share|improve this question









New contributor




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







$endgroup$




Task:



Given an integer input, figure out whether or not it is a Cyclops Number.



What is a Cyclops number, you may ask? Well, it's a number whose binary representation only has one 0 in the center!



Test Cases:



Input | Output

--------------

1     | falsy

5     | truthy

12    | falsy    

27    | truthy

85    | falsy

101   | falsy

119   | truthy


Input: An integer or equivalent types. (int, long, decimal, etc.)
Output:




  • Truthy or falsy (e.g. true or false, 0 or 1)..


Challenge Rules:




  • Input that is less than 0 is assumed to be falsy.


  • If the length of the binary representation of the number is even, then the number cannot be a Cyclops number.



General Rules:




  • This is code-golf, so the shortest answers in bytes wins!.


  • Default loopholes are forbidden.


  • Standard rules apply for your answer with default I/O rules.




This is my first Programming Puzzles & Code Golf challenge, so any feedback on how I should improve would be much appreciated!






code-golf number decision-problem binary




code-golf number decision-problem binary






share|improve this question









New contributor




Tau 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




Tau 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








edited 1 hour ago







Tau













New contributor




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









asked 2 hours ago









TauTau

1165




1165




New contributor




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





New contributor





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






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








  • 1




    $begingroup$
    You've essentially made two separate challenges, one a decision problem and one about outputting the next number of a sequence. This will not do what you want, which is invite more answers, but instead put off users who now need to consider three options about what to program before posting. I'd recommend removing the option, and in the future you can try posting to our sandbox first where hopefully you will get helpful feedback before posting. Good luck!
    $endgroup$
    – FryAmTheEggman
    2 hours ago










  • $begingroup$
    @SriotchilismO'Zaic thanks for the feedback! I have edited the post.
    $endgroup$
    – Tau
    1 hour ago






  • 1




    $begingroup$
    I'd also recommend removing the hard coding restriction. By default solutions would need to handle all cyclops numbers in theory, and there are clearly infinitely many of them, so they couldn't all be hardcoded.
    $endgroup$
    – FryAmTheEggman
    1 hour ago






  • 1




    $begingroup$
    Note: This is A129868
    $endgroup$
    – tsh
    1 hour ago






  • 2




    $begingroup$
    Should 119 be true?
    $endgroup$
    – Quintec
    1 hour ago














  • 1




    $begingroup$
    You've essentially made two separate challenges, one a decision problem and one about outputting the next number of a sequence. This will not do what you want, which is invite more answers, but instead put off users who now need to consider three options about what to program before posting. I'd recommend removing the option, and in the future you can try posting to our sandbox first where hopefully you will get helpful feedback before posting. Good luck!
    $endgroup$
    – FryAmTheEggman
    2 hours ago










  • $begingroup$
    @SriotchilismO'Zaic thanks for the feedback! I have edited the post.
    $endgroup$
    – Tau
    1 hour ago






  • 1




    $begingroup$
    I'd also recommend removing the hard coding restriction. By default solutions would need to handle all cyclops numbers in theory, and there are clearly infinitely many of them, so they couldn't all be hardcoded.
    $endgroup$
    – FryAmTheEggman
    1 hour ago






  • 1




    $begingroup$
    Note: This is A129868
    $endgroup$
    – tsh
    1 hour ago






  • 2




    $begingroup$
    Should 119 be true?
    $endgroup$
    – Quintec
    1 hour ago








1




1




$begingroup$
You've essentially made two separate challenges, one a decision problem and one about outputting the next number of a sequence. This will not do what you want, which is invite more answers, but instead put off users who now need to consider three options about what to program before posting. I'd recommend removing the option, and in the future you can try posting to our sandbox first where hopefully you will get helpful feedback before posting. Good luck!
$endgroup$
– FryAmTheEggman
2 hours ago




$begingroup$
You've essentially made two separate challenges, one a decision problem and one about outputting the next number of a sequence. This will not do what you want, which is invite more answers, but instead put off users who now need to consider three options about what to program before posting. I'd recommend removing the option, and in the future you can try posting to our sandbox first where hopefully you will get helpful feedback before posting. Good luck!
$endgroup$
– FryAmTheEggman
2 hours ago












$begingroup$
@SriotchilismO'Zaic thanks for the feedback! I have edited the post.
$endgroup$
– Tau
1 hour ago




$begingroup$
@SriotchilismO'Zaic thanks for the feedback! I have edited the post.
$endgroup$
– Tau
1 hour ago




1




1




$begingroup$
I'd also recommend removing the hard coding restriction. By default solutions would need to handle all cyclops numbers in theory, and there are clearly infinitely many of them, so they couldn't all be hardcoded.
$endgroup$
– FryAmTheEggman
1 hour ago




$begingroup$
I'd also recommend removing the hard coding restriction. By default solutions would need to handle all cyclops numbers in theory, and there are clearly infinitely many of them, so they couldn't all be hardcoded.
$endgroup$
– FryAmTheEggman
1 hour ago




1




1




$begingroup$
Note: This is A129868
$endgroup$
– tsh
1 hour ago




$begingroup$
Note: This is A129868
$endgroup$
– tsh
1 hour ago




2




2




$begingroup$
Should 119 be true?
$endgroup$
– Quintec
1 hour ago




$begingroup$
Should 119 be true?
$endgroup$
– Quintec
1 hour ago










4 Answers
4






active

oldest

votes


















2












$begingroup$


Japt, 25 19 10 bytes



¢èT ¶1©¢ês


That's more like it...



Checks if there is only one 0 in the binary representation and that the binary representation is a palindrome.



Try it online!






share|improve this answer











$endgroup$













  • $begingroup$
    found an even shorter way, based on your solution :)
    $endgroup$
    – Embodiment of Ignorance
    1 hour ago





















2












$begingroup$

Japt, 8 bytes



¤øT ©¢ês


Based off of Quintec's solution.



Try it Online!



Old regex-based solution, 15 bytes



¤f/^(1*)01$/ l


Returns 1 for true, 0 for false.



Try it Online!






share|improve this answer











$endgroup$













  • $begingroup$
    Well played, I should really learn regular expressions sometime. :) +1
    $endgroup$
    – Quintec
    1 hour ago










  • $begingroup$
    @Quintec Regex is awesome :)
    $endgroup$
    – Embodiment of Ignorance
    1 hour ago










  • $begingroup$
    Update: found shorter way :)
    $endgroup$
    – Quintec
    1 hour ago



















0












$begingroup$


Perl 6, 23 bytes





{.base(2)~~/^(1*)0$0$/}


Try it online!



Regex based solution






share|improve this answer









$endgroup$





















    0












    $begingroup$


    JavaScript (Node.js), 32 bytes





    f=(p,q)=>p&1?f(p/2,q+q|2):!(p^q)


    Try it online!



    31 bytes version





    f=(p,q)=>p&1?f(p>>1,q+q|2):p==q


    This one will report falsy for 0.





    JavaScript (Node.js), 35 bytes





    p=>p.toString(2).match(/^(1*)01$/)


    Try it online!






    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.ifUsing("editor", function () {
      StackExchange.using("externalEditor", function () {
      StackExchange.using("snippets", function () {
      StackExchange.snippets.init();
      });
      });
      }, "code-snippets");

      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "200"
      };
      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
      },
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });






      Tau 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%2fcodegolf.stackexchange.com%2fquestions%2f181128%2fis-it-a-cyclops-number-nobody-knows%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      4 Answers
      4






      active

      oldest

      votes








      4 Answers
      4






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$


      Japt, 25 19 10 bytes



      ¢èT ¶1©¢ês


      That's more like it...



      Checks if there is only one 0 in the binary representation and that the binary representation is a palindrome.



      Try it online!






      share|improve this answer











      $endgroup$













      • $begingroup$
        found an even shorter way, based on your solution :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago


















      2












      $begingroup$


      Japt, 25 19 10 bytes



      ¢èT ¶1©¢ês


      That's more like it...



      Checks if there is only one 0 in the binary representation and that the binary representation is a palindrome.



      Try it online!






      share|improve this answer











      $endgroup$













      • $begingroup$
        found an even shorter way, based on your solution :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago
















      2












      2








      2





      $begingroup$


      Japt, 25 19 10 bytes



      ¢èT ¶1©¢ês


      That's more like it...



      Checks if there is only one 0 in the binary representation and that the binary representation is a palindrome.



      Try it online!






      share|improve this answer











      $endgroup$




      Japt, 25 19 10 bytes



      ¢èT ¶1©¢ês


      That's more like it...



      Checks if there is only one 0 in the binary representation and that the binary representation is a palindrome.



      Try it online!







      share|improve this answer














      share|improve this answer



      share|improve this answer








      edited 1 hour ago

























      answered 1 hour ago









      QuintecQuintec

      1,9781726




      1,9781726












      • $begingroup$
        found an even shorter way, based on your solution :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago




















      • $begingroup$
        found an even shorter way, based on your solution :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago


















      $begingroup$
      found an even shorter way, based on your solution :)
      $endgroup$
      – Embodiment of Ignorance
      1 hour ago






      $begingroup$
      found an even shorter way, based on your solution :)
      $endgroup$
      – Embodiment of Ignorance
      1 hour ago













      2












      $begingroup$

      Japt, 8 bytes



      ¤øT ©¢ês


      Based off of Quintec's solution.



      Try it Online!



      Old regex-based solution, 15 bytes



      ¤f/^(1*)01$/ l


      Returns 1 for true, 0 for false.



      Try it Online!






      share|improve this answer











      $endgroup$













      • $begingroup$
        Well played, I should really learn regular expressions sometime. :) +1
        $endgroup$
        – Quintec
        1 hour ago










      • $begingroup$
        @Quintec Regex is awesome :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        1 hour ago
















      2












      $begingroup$

      Japt, 8 bytes



      ¤øT ©¢ês


      Based off of Quintec's solution.



      Try it Online!



      Old regex-based solution, 15 bytes



      ¤f/^(1*)01$/ l


      Returns 1 for true, 0 for false.



      Try it Online!






      share|improve this answer











      $endgroup$













      • $begingroup$
        Well played, I should really learn regular expressions sometime. :) +1
        $endgroup$
        – Quintec
        1 hour ago










      • $begingroup$
        @Quintec Regex is awesome :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        1 hour ago














      2












      2








      2





      $begingroup$

      Japt, 8 bytes



      ¤øT ©¢ês


      Based off of Quintec's solution.



      Try it Online!



      Old regex-based solution, 15 bytes



      ¤f/^(1*)01$/ l


      Returns 1 for true, 0 for false.



      Try it Online!






      share|improve this answer











      $endgroup$



      Japt, 8 bytes



      ¤øT ©¢ês


      Based off of Quintec's solution.



      Try it Online!



      Old regex-based solution, 15 bytes



      ¤f/^(1*)01$/ l


      Returns 1 for true, 0 for false.



      Try it Online!







      share|improve this answer














      share|improve this answer



      share|improve this answer








      edited 1 hour ago

























      answered 1 hour ago









      Embodiment of IgnoranceEmbodiment of Ignorance

      1,516123




      1,516123












      • $begingroup$
        Well played, I should really learn regular expressions sometime. :) +1
        $endgroup$
        – Quintec
        1 hour ago










      • $begingroup$
        @Quintec Regex is awesome :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        1 hour ago


















      • $begingroup$
        Well played, I should really learn regular expressions sometime. :) +1
        $endgroup$
        – Quintec
        1 hour ago










      • $begingroup$
        @Quintec Regex is awesome :)
        $endgroup$
        – Embodiment of Ignorance
        1 hour ago










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        1 hour ago
















      $begingroup$
      Well played, I should really learn regular expressions sometime. :) +1
      $endgroup$
      – Quintec
      1 hour ago




      $begingroup$
      Well played, I should really learn regular expressions sometime. :) +1
      $endgroup$
      – Quintec
      1 hour ago












      $begingroup$
      @Quintec Regex is awesome :)
      $endgroup$
      – Embodiment of Ignorance
      1 hour ago




      $begingroup$
      @Quintec Regex is awesome :)
      $endgroup$
      – Embodiment of Ignorance
      1 hour ago












      $begingroup$
      Update: found shorter way :)
      $endgroup$
      – Quintec
      1 hour ago




      $begingroup$
      Update: found shorter way :)
      $endgroup$
      – Quintec
      1 hour ago











      0












      $begingroup$


      Perl 6, 23 bytes





      {.base(2)~~/^(1*)0$0$/}


      Try it online!



      Regex based solution






      share|improve this answer









      $endgroup$


















        0












        $begingroup$


        Perl 6, 23 bytes





        {.base(2)~~/^(1*)0$0$/}


        Try it online!



        Regex based solution






        share|improve this answer









        $endgroup$
















          0












          0








          0





          $begingroup$


          Perl 6, 23 bytes





          {.base(2)~~/^(1*)0$0$/}


          Try it online!



          Regex based solution






          share|improve this answer









          $endgroup$




          Perl 6, 23 bytes





          {.base(2)~~/^(1*)0$0$/}


          Try it online!



          Regex based solution







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 1 hour ago









          Jo KingJo King

          24.4k357126




          24.4k357126























              0












              $begingroup$


              JavaScript (Node.js), 32 bytes





              f=(p,q)=>p&1?f(p/2,q+q|2):!(p^q)


              Try it online!



              31 bytes version





              f=(p,q)=>p&1?f(p>>1,q+q|2):p==q


              This one will report falsy for 0.





              JavaScript (Node.js), 35 bytes





              p=>p.toString(2).match(/^(1*)01$/)


              Try it online!






              share|improve this answer











              $endgroup$


















                0












                $begingroup$


                JavaScript (Node.js), 32 bytes





                f=(p,q)=>p&1?f(p/2,q+q|2):!(p^q)


                Try it online!



                31 bytes version





                f=(p,q)=>p&1?f(p>>1,q+q|2):p==q


                This one will report falsy for 0.





                JavaScript (Node.js), 35 bytes





                p=>p.toString(2).match(/^(1*)01$/)


                Try it online!






                share|improve this answer











                $endgroup$
















                  0












                  0








                  0





                  $begingroup$


                  JavaScript (Node.js), 32 bytes





                  f=(p,q)=>p&1?f(p/2,q+q|2):!(p^q)


                  Try it online!



                  31 bytes version





                  f=(p,q)=>p&1?f(p>>1,q+q|2):p==q


                  This one will report falsy for 0.





                  JavaScript (Node.js), 35 bytes





                  p=>p.toString(2).match(/^(1*)01$/)


                  Try it online!






                  share|improve this answer











                  $endgroup$




                  JavaScript (Node.js), 32 bytes





                  f=(p,q)=>p&1?f(p/2,q+q|2):!(p^q)


                  Try it online!



                  31 bytes version





                  f=(p,q)=>p&1?f(p>>1,q+q|2):p==q


                  This one will report falsy for 0.





                  JavaScript (Node.js), 35 bytes





                  p=>p.toString(2).match(/^(1*)01$/)


                  Try it online!







                  share|improve this answer














                  share|improve this answer



                  share|improve this answer








                  edited 49 mins ago

























                  answered 1 hour ago









                  tshtsh

                  9,32511652




                  9,32511652






















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










                      draft saved

                      draft discarded


















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













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












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
















                      If this is an answer to a challenge…




                      • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                      • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                        Explanations of your answer make it more interesting to read and are very much encouraged.


                      • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



                      More generally…




                      • …Please make sure to answer the question and provide sufficient detail.


                      • …Avoid asking for help, clarification or responding to other answers (use comments instead).





                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f181128%2fis-it-a-cyclops-number-nobody-knows%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

                      Why do type traits not work with types in namespace scope?What are POD types in C++?Why can templates only be...

                      Image
                      What does it mean to express a gate in Dirac notation? A Strange Latex Symbol How can Republicans who favour free markets, consistently express anger when they don't like the outcome of that choice? What happened to Captain America in Endgame? How to solve constants out of the internal energy equation? How can I place the product on a social media post better? Will tsunami waves travel forever if there was no land? Unexpected email from Yorkshire Bank What is the relationship between spectral sequences and obstruction theory? How can I practically buy stocks? Will a top journal at least re
                      Read more

                      Will tsunami waves travel forever if there was no land?Why do tsunami waves begin with the water flowing away...

                      Image
                      How much cash can I safely carry into the USA and avoid civil forfeiture? Is there really no use for MD5 anymore? Is contacting this expert in the field something acceptable or would it be discourteous? How to pronounce 'C++' in Spanish How to creep the reader out with what seems like a normal person? Critique of timeline aesthetic Sci fi novel series with instant travel between planets through gates. A river runs through the gates How did Captain America manage to do this? Are Boeing 737-800’s grounded? Error message with tabularx How to make a pipeline wait for end-of-file or stop af
                      Read more

                      Simple Scan not detecting my scanner (Brother DCP-7055W)Brother MFC-L2700DW printer can print, can't...

                      Image
                      Can someone publish a story that happened to you? Will tsunami waves travel forever if there was no land? What is the strongest case that can be made in favour of the UK regaining some control over fishing policy after Brexit? Controversial area of mathematics Packing rectangles: Does rotation ever help? Is there a way to get a compiler for the original B programming language? Using a Lyapunov function to classify stability and sketching a phase portrait Do I have an "anti-research" personality? Reducing vertical space in stackrel What does KSP mean? Pulling the rope with one hand is
                      Read more