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

Why can't we use freedom of speech and expression to incite people to rebel against government in India?

Paper published similar to PhD thesis

Short story about an infectious indestructible metal bar?

How do you make a gun that shoots melee weapons and/or swords?

Are there other characters in the Star Wars universe who had damaged bodies and needed to wear an outfit like Darth Vader?

I can't die. Who am I?

A bug in Excel? Conditional formatting for marking duplicates also highlights unique value

Has a sovereign Communist government ever run, and conceded loss, on a fair election?

Integrating function with /; in its definition

ESPP--any reason not to go all in?

Error in TransformedField

Create chunks from an array

Is it a Cyclops number? "Nobody" knows!

Is there a way to find out the age of climbing ropes?

Named nets not connected in Eagle board design

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

Are small insurances worth it

Under what conditions would I NOT add my Proficiency Bonus to a Spell Attack Roll (or Saving Throw DC)?

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

Why aren't there more gauls like Obelix?

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

Replacing tantalum capacitor with ceramic capacitor for Op Amps

Rationale to prefer local variables over instance variables?

Is "cogitate" an appropriate word for this?



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
    1 hour 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
    58 mins 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
    1 hour 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
    58 mins 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 54 mins 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 1 hour 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
    1 hour 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
    58 mins 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
    1 hour 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
    58 mins 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
1 hour 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
1 hour 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
58 mins ago




$begingroup$
Should 119 be true?
$endgroup$
– Quintec
58 mins 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
    28 mins 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
    54 mins ago










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










  • $begingroup$
    Update: found shorter way :)
    $endgroup$
    – Quintec
    44 mins 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
        28 mins 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
        28 mins 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 47 mins ago

























      answered 1 hour ago









      QuintecQuintec

      1,9781726




      1,9781726












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




















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


















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






      $begingroup$
      found an even shorter way, based on your solution :)
      $endgroup$
      – Embodiment of Ignorance
      28 mins 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
        54 mins ago










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










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        44 mins 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
        54 mins ago










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










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        44 mins 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 28 mins ago

























      answered 56 mins ago









      Embodiment of IgnoranceEmbodiment of Ignorance

      1,516123




      1,516123












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










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










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        44 mins ago


















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










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










      • $begingroup$
        Update: found shorter way :)
        $endgroup$
        – Quintec
        44 mins ago
















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




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












      $begingroup$
      @Quintec Regex is awesome :)
      $endgroup$
      – Embodiment of Ignorance
      53 mins ago




      $begingroup$
      @Quintec Regex is awesome :)
      $endgroup$
      – Embodiment of Ignorance
      53 mins ago












      $begingroup$
      Update: found shorter way :)
      $endgroup$
      – Quintec
      44 mins ago




      $begingroup$
      Update: found shorter way :)
      $endgroup$
      – Quintec
      44 mins 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 49 mins 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 15 mins ago

























                  answered 47 mins 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

                      As a Security Precaution, the user account has been locked The Next CEO of Stack OverflowMS...

                      Image
                      Could a dragon use its wings to swim? Is it a bad idea to plug the other end of ESD strap to wall ground? How can I prove that a state of equilibrium is unstable? Compilation of a 2d array and a 1d array pgfplots: How to draw a tangent graph below two others? How dangerous is XSS Gauss' Posthumous Publications? How to implement Comparable so it is consistent with identity-equality What does this strange code stamp on my passport mean? "Eavesdropping" vs "Listen in on" Which acid/base does a strong base/acid react when added to a buffer solution?
                      Read more

                      Список ссавців Італії Природоохоронні статуси | Список |...

                      Image
                      Списки ссавцівФауна ІталіїСписки:ІталіяСсавці Італії ІталіїМСОПХижіCetartiodactylaРукокриліКомахоїдніЗайцеподібніГризуниМСОП ссавці Італії ? Італія Біорегіон Біогеографічний екорегіон Голарктика Екозона Палеарктика Біом субтропічний ліс, альпійські луки, прісні води, континентальний шельф, континентальний схил Місцевість Континент Європа Країна Італія Територія Середземне море Фауна більшого обсягу За географією фауна Європи За систематикою ссавці, фауна Італії За екологією суходільна фауна, морська фауна За біогеографією теріофауна Європи Геологічний вік сучасність Особливості Видовий обсяг 121 Чужорідні види Genetta genetta, Ondatra zibethicus, Oryctolagus cuniculus, Rattus norvegicus, Rattus rattus, Sciurus carolinensis, Tamias sibiricus Список ссавців Італії містить перелік видів, записаних на території Італії (південна Європа) згідно з
                      Read more

                      Українські прізвища Зміст Історичні відомості |...

                      Image
                      АдигськіАбхазькіАзербайджанські [en] Албанські [en] АлтайськіАмериканські [en] Афроамериканські [en] АнглійськіАрабськіБашкирськіБілоруські [en] прізвищаБолгарські [en] БоснійськіБурятськіВельські [en] ВепськіВ'єтнамські [en] Вірменські [en] Гавайські [en] ГолландськіГрецькіГрузинськіДанськіЕстонськіЄврейські [en] Юдейські [en] Ефіопія/Еритрея [en] Зімбабвійські [en] Індіанські [en] ІндійськіІндонезійські [en] Ірландські [en] ІсландськіІспанські і португальськіІталійськіКалмицькі [en] КарельськіКазахськіКамбоджійські [en] Канадські [en] КіргизькіКитайські [en] КоміКорейськіЛатиськіЛитовські [en] Лаоські [en] МарійськіМакедонські [en] Малазійські [en] Монгольські [en] МордовськіНімецькіНорвезькіОсетинськіПерські [en] ПольськіПрибалтійськіПортугальськіРосійськіпрізвищаРумунськіСербськіСкандинавськіСлов'янськіСахаСловацькі [en] Сомалійські [en] ТайванськіТайські [en] Татарські [en] ТибетськіТувинськіТурецькі [en] УгорськіУдмуртськіУкраїнськіпрізвищаФіджійські [en] ФінськіФранцузьк
                      Read more