Am I not good enough for you?












3












$begingroup$


Background:



The current Perfect Numbers challenge is rather flawed and complicated, since it asks you to output in a complex format involving the factors of the number. This is a purely decision-problem repost of the challenge.



Challenge



Given a positive integer through any standard input format, output whether it is not perfect.



A perfect number is a number that is equal to the sum of all its proper divisors (its positive divisors less than itself). For example, $6$ is a perfect number, since its divisors are $1,2,3$, which sum up to $6$, while $12$ is not a perfect number since its divisors ( $1,2,3,4,6$ ) sum up to $16$, not $12$.



Test Cases:



Imperfect:

1,12,13,18,20,1000,33550335



Perfect:

6,28,496,8128,33550336,8589869056


Rules




  • Your program doesn't have to complete the larger test cases, if there's memory or time constraints, but it should be theoretically able to if it were given more memory/time.

  • Output can be two distinct and consistent values through any allowed output format. If it isn't immediately obvious what represents Truthy/Falsey, please make sure to specify in your answer.


    • This means your values don't have to be literally Truthy/Falsey. Your Truthy output may evaluate to false in your language and vice-versa.








code-golf number decision-problem number-theory factoring







share|improve this question











$endgroup$












  • $begingroup$
    Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
    $endgroup$
    – Esolanging Fruit
    1 hour ago










  • $begingroup$
    @EsolangingFruit Yes, though the actual output values don't really matter, so you can output true for perfect numbers if you wish
    $endgroup$
    – Jo King
    59 mins ago










  • $begingroup$
    Fair enough, but wording the challenge as "output whether it is not perfect" makes the test cases slightly confusing if you interpret "truthy" as meaning "values corresponding to true".
    $endgroup$
    – Esolanging Fruit
    58 mins ago










  • $begingroup$
    @EsolangingFruit Good point. I've renamed the test cases to Imperfect/Perfect to make it clearer
    $endgroup$
    – Jo King
    56 mins ago
















3












$begingroup$


Background:



The current Perfect Numbers challenge is rather flawed and complicated, since it asks you to output in a complex format involving the factors of the number. This is a purely decision-problem repost of the challenge.



Challenge



Given a positive integer through any standard input format, output whether it is not perfect.



A perfect number is a number that is equal to the sum of all its proper divisors (its positive divisors less than itself). For example, $6$ is a perfect number, since its divisors are $1,2,3$, which sum up to $6$, while $12$ is not a perfect number since its divisors ( $1,2,3,4,6$ ) sum up to $16$, not $12$.



Test Cases:



Imperfect:

1,12,13,18,20,1000,33550335



Perfect:

6,28,496,8128,33550336,8589869056


Rules




  • Your program doesn't have to complete the larger test cases, if there's memory or time constraints, but it should be theoretically able to if it were given more memory/time.

  • Output can be two distinct and consistent values through any allowed output format. If it isn't immediately obvious what represents Truthy/Falsey, please make sure to specify in your answer.


    • This means your values don't have to be literally Truthy/Falsey. Your Truthy output may evaluate to false in your language and vice-versa.








code-golf number decision-problem number-theory factoring







share|improve this question











$endgroup$












  • $begingroup$
    Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
    $endgroup$
    – Esolanging Fruit
    1 hour ago










  • $begingroup$
    @EsolangingFruit Yes, though the actual output values don't really matter, so you can output true for perfect numbers if you wish
    $endgroup$
    – Jo King
    59 mins ago










  • $begingroup$
    Fair enough, but wording the challenge as "output whether it is not perfect" makes the test cases slightly confusing if you interpret "truthy" as meaning "values corresponding to true".
    $endgroup$
    – Esolanging Fruit
    58 mins ago










  • $begingroup$
    @EsolangingFruit Good point. I've renamed the test cases to Imperfect/Perfect to make it clearer
    $endgroup$
    – Jo King
    56 mins ago














3












3








3





$begingroup$


Background:



The current Perfect Numbers challenge is rather flawed and complicated, since it asks you to output in a complex format involving the factors of the number. This is a purely decision-problem repost of the challenge.



Challenge



Given a positive integer through any standard input format, output whether it is not perfect.



A perfect number is a number that is equal to the sum of all its proper divisors (its positive divisors less than itself). For example, $6$ is a perfect number, since its divisors are $1,2,3$, which sum up to $6$, while $12$ is not a perfect number since its divisors ( $1,2,3,4,6$ ) sum up to $16$, not $12$.



Test Cases:



Imperfect:

1,12,13,18,20,1000,33550335



Perfect:

6,28,496,8128,33550336,8589869056


Rules




  • Your program doesn't have to complete the larger test cases, if there's memory or time constraints, but it should be theoretically able to if it were given more memory/time.

  • Output can be two distinct and consistent values through any allowed output format. If it isn't immediately obvious what represents Truthy/Falsey, please make sure to specify in your answer.


    • This means your values don't have to be literally Truthy/Falsey. Your Truthy output may evaluate to false in your language and vice-versa.








code-golf number decision-problem number-theory factoring







share|improve this question











$endgroup$




Background:



The current Perfect Numbers challenge is rather flawed and complicated, since it asks you to output in a complex format involving the factors of the number. This is a purely decision-problem repost of the challenge.



Challenge



Given a positive integer through any standard input format, output whether it is not perfect.



A perfect number is a number that is equal to the sum of all its proper divisors (its positive divisors less than itself). For example, $6$ is a perfect number, since its divisors are $1,2,3$, which sum up to $6$, while $12$ is not a perfect number since its divisors ( $1,2,3,4,6$ ) sum up to $16$, not $12$.



Test Cases:



Imperfect:

1,12,13,18,20,1000,33550335



Perfect:

6,28,496,8128,33550336,8589869056


Rules




  • Your program doesn't have to complete the larger test cases, if there's memory or time constraints, but it should be theoretically able to if it were given more memory/time.

  • Output can be two distinct and consistent values through any allowed output format. If it isn't immediately obvious what represents Truthy/Falsey, please make sure to specify in your answer.


    • This means your values don't have to be literally Truthy/Falsey. Your Truthy output may evaluate to false in your language and vice-versa.








code-golf number decision-problem number-theory factoring




code-golf number decision-problem number-theory factoring






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 57 mins ago







Jo King

















asked 1 hour ago









Jo KingJo King

24.6k357126




24.6k357126












  • $begingroup$
    Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
    $endgroup$
    – Esolanging Fruit
    1 hour ago










  • $begingroup$
    @EsolangingFruit Yes, though the actual output values don't really matter, so you can output true for perfect numbers if you wish
    $endgroup$
    – Jo King
    59 mins ago










  • $begingroup$
    Fair enough, but wording the challenge as "output whether it is not perfect" makes the test cases slightly confusing if you interpret "truthy" as meaning "values corresponding to true".
    $endgroup$
    – Esolanging Fruit
    58 mins ago










  • $begingroup$
    @EsolangingFruit Good point. I've renamed the test cases to Imperfect/Perfect to make it clearer
    $endgroup$
    – Jo King
    56 mins ago


















  • $begingroup$
    Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
    $endgroup$
    – Esolanging Fruit
    1 hour ago










  • $begingroup$
    @EsolangingFruit Yes, though the actual output values don't really matter, so you can output true for perfect numbers if you wish
    $endgroup$
    – Jo King
    59 mins ago










  • $begingroup$
    Fair enough, but wording the challenge as "output whether it is not perfect" makes the test cases slightly confusing if you interpret "truthy" as meaning "values corresponding to true".
    $endgroup$
    – Esolanging Fruit
    58 mins ago










  • $begingroup$
    @EsolangingFruit Good point. I've renamed the test cases to Imperfect/Perfect to make it clearer
    $endgroup$
    – Jo King
    56 mins ago
















$begingroup$
Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
$endgroup$
– Esolanging Fruit
1 hour ago




$begingroup$
Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
$endgroup$
– Esolanging Fruit
1 hour ago












$begingroup$
@EsolangingFruit Yes, though the actual output values don't really matter, so you can output true for perfect numbers if you wish
$endgroup$
– Jo King
59 mins ago




$begingroup$
@EsolangingFruit Yes, though the actual output values don't really matter, so you can output true for perfect numbers if you wish
$endgroup$
– Jo King
59 mins ago












$begingroup$
Fair enough, but wording the challenge as "output whether it is not perfect" makes the test cases slightly confusing if you interpret "truthy" as meaning "values corresponding to true".
$endgroup$
– Esolanging Fruit
58 mins ago




$begingroup$
Fair enough, but wording the challenge as "output whether it is not perfect" makes the test cases slightly confusing if you interpret "truthy" as meaning "values corresponding to true".
$endgroup$
– Esolanging Fruit
58 mins ago












$begingroup$
@EsolangingFruit Good point. I've renamed the test cases to Imperfect/Perfect to make it clearer
$endgroup$
– Jo King
56 mins ago




$begingroup$
@EsolangingFruit Good point. I've renamed the test cases to Imperfect/Perfect to make it clearer
$endgroup$
– Jo King
56 mins ago










6 Answers
6






active

oldest

votes


















3












$begingroup$


Japt -!, 4 bytes



¥â¬x


For some reason ¦ doesnt work on tio so I need to use the -! flag and ¥ instead



Try it online!






share|improve this answer











$endgroup$





















    2












    $begingroup$


    R, 33 bytes





    !2*(n=scan())-sum(which(!n%%1:n))


    Try it online!



    Returns TRUE for perfect numbers ans FALSE for imperfect ones.






    share|improve this answer









    $endgroup$













    • $begingroup$
      What do the 2 !s in a row get you?
      $endgroup$
      – CT Hall
      41 mins ago










    • $begingroup$
      @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
      $endgroup$
      – Giuseppe
      20 mins ago





















    1












    $begingroup$


    CJam, 17 bytes



    ri_,(;{1$%!},:+=


    Try it online!






    share|improve this answer









    $endgroup$





















      1












      $begingroup$

      Javascript, 62



      n=>n==[...Array(n).keys()].filter(a=>n%a<1).reduce((a,b)=>a+b)


      Explanation (although it's pretty simple)



      n=> //return function that takes n
      
  n== //and returns if n is equal to
      
    [...Array(n).keys()] //an array [0..(n-1)]...
      
      .filter(a=>n%a<1) //where all of the elements that are not divisors of n are taken out...
      
      .reduce((a,b)=>a+b) //summed up


      Thanks to Jo King for the improvement!






      share|improve this answer











      $endgroup$













      • $begingroup$
        thanks! Added that in
        $endgroup$
        – zevee
        55 mins ago



















      0












      $begingroup$


      C# (Visual C# Interactive Compiler), 49 bytes





      n=>Enumerable.Range(1,n).Sum(x=>n%x<1?n/x:0)==n*2


      Try it online!





      share









      $endgroup$





















        0












        $begingroup$


        Python 3, 49 bytes





        lambda x:sum([i for i in range(1,x)if x%i==0])==x


        Brute force, sums the factors and checks for equality.



        Try it online!





        share









        $endgroup$













        • $begingroup$
          ==0 can be <1. I also don't think you need the in the sum function
          $endgroup$
          – Jo King
          15 secs ago











        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
        });


        }
        });














        draft saved

        draft discarded


















        StackExchange.ready(
        function () {
        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f181350%2fam-i-not-good-enough-for-you%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        6 Answers
        6






        active

        oldest

        votes








        6 Answers
        6






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        3












        $begingroup$


        Japt -!, 4 bytes



        ¥â¬x


        For some reason ¦ doesnt work on tio so I need to use the -! flag and ¥ instead



        Try it online!






        share|improve this answer











        $endgroup$


















          3












          $begingroup$


          Japt -!, 4 bytes



          ¥â¬x


          For some reason ¦ doesnt work on tio so I need to use the -! flag and ¥ instead



          Try it online!






          share|improve this answer











          $endgroup$
















            3












            3








            3





            $begingroup$


            Japt -!, 4 bytes



            ¥â¬x


            For some reason ¦ doesnt work on tio so I need to use the -! flag and ¥ instead



            Try it online!






            share|improve this answer











            $endgroup$




            Japt -!, 4 bytes



            ¥â¬x


            For some reason ¦ doesnt work on tio so I need to use the -! flag and ¥ instead



            Try it online!







            share|improve this answer














            share|improve this answer



            share|improve this answer








            edited 59 mins ago

























            answered 1 hour ago









            Luis felipe De jesus MunozLuis felipe De jesus Munoz

            5,60821670




            5,60821670























                2












                $begingroup$


                R, 33 bytes





                !2*(n=scan())-sum(which(!n%%1:n))


                Try it online!



                Returns TRUE for perfect numbers ans FALSE for imperfect ones.






                share|improve this answer









                $endgroup$













                • $begingroup$
                  What do the 2 !s in a row get you?
                  $endgroup$
                  – CT Hall
                  41 mins ago










                • $begingroup$
                  @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
                  $endgroup$
                  – Giuseppe
                  20 mins ago


















                2












                $begingroup$


                R, 33 bytes





                !2*(n=scan())-sum(which(!n%%1:n))


                Try it online!



                Returns TRUE for perfect numbers ans FALSE for imperfect ones.






                share|improve this answer









                $endgroup$













                • $begingroup$
                  What do the 2 !s in a row get you?
                  $endgroup$
                  – CT Hall
                  41 mins ago










                • $begingroup$
                  @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
                  $endgroup$
                  – Giuseppe
                  20 mins ago
















                2












                2








                2





                $begingroup$


                R, 33 bytes





                !2*(n=scan())-sum(which(!n%%1:n))


                Try it online!



                Returns TRUE for perfect numbers ans FALSE for imperfect ones.






                share|improve this answer









                $endgroup$




                R, 33 bytes





                !2*(n=scan())-sum(which(!n%%1:n))


                Try it online!



                Returns TRUE for perfect numbers ans FALSE for imperfect ones.







                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered 45 mins ago









                GiuseppeGiuseppe

                16.8k31052




                16.8k31052












                • $begingroup$
                  What do the 2 !s in a row get you?
                  $endgroup$
                  – CT Hall
                  41 mins ago










                • $begingroup$
                  @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
                  $endgroup$
                  – Giuseppe
                  20 mins ago




















                • $begingroup$
                  What do the 2 !s in a row get you?
                  $endgroup$
                  – CT Hall
                  41 mins ago










                • $begingroup$
                  @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
                  $endgroup$
                  – Giuseppe
                  20 mins ago


















                $begingroup$
                What do the 2 !s in a row get you?
                $endgroup$
                – CT Hall
                41 mins ago




                $begingroup$
                What do the 2 !s in a row get you?
                $endgroup$
                – CT Hall
                41 mins ago












                $begingroup$
                @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
                $endgroup$
                – Giuseppe
                20 mins ago






                $begingroup$
                @CTHall I misread the spec; they originally mapped 0 (perfect) to FALSE and nonzero to TRUE but I removed one of them to reverse the mapping. It's a useful golfing trick to cast from numeric to logical, often in conjunction with which or [.
                $endgroup$
                – Giuseppe
                20 mins ago













                1












                $begingroup$


                CJam, 17 bytes



                ri_,(;{1$%!},:+=


                Try it online!






                share|improve this answer









                $endgroup$


















                  1












                  $begingroup$


                  CJam, 17 bytes



                  ri_,(;{1$%!},:+=


                  Try it online!






                  share|improve this answer









                  $endgroup$
















                    1












                    1








                    1





                    $begingroup$


                    CJam, 17 bytes



                    ri_,(;{1$%!},:+=


                    Try it online!






                    share|improve this answer









                    $endgroup$




                    CJam, 17 bytes



                    ri_,(;{1$%!},:+=


                    Try it online!







                    share|improve this answer












                    share|improve this answer



                    share|improve this answer










                    answered 59 mins ago









                    Esolanging FruitEsolanging Fruit

                    8,50932674




                    8,50932674























                        1












                        $begingroup$

                        Javascript, 62



                        n=>n==[...Array(n).keys()].filter(a=>n%a<1).reduce((a,b)=>a+b)


                        Explanation (although it's pretty simple)



                        n=> //return function that takes n
                        
  n== //and returns if n is equal to
                        
    [...Array(n).keys()] //an array [0..(n-1)]...
                        
      .filter(a=>n%a<1) //where all of the elements that are not divisors of n are taken out...
                        
      .reduce((a,b)=>a+b) //summed up


                        Thanks to Jo King for the improvement!






                        share|improve this answer











                        $endgroup$













                        • $begingroup$
                          thanks! Added that in
                          $endgroup$
                          – zevee
                          55 mins ago
















                        1












                        $begingroup$

                        Javascript, 62



                        n=>n==[...Array(n).keys()].filter(a=>n%a<1).reduce((a,b)=>a+b)


                        Explanation (although it's pretty simple)



                        n=> //return function that takes n
                        
  n== //and returns if n is equal to
                        
    [...Array(n).keys()] //an array [0..(n-1)]...
                        
      .filter(a=>n%a<1) //where all of the elements that are not divisors of n are taken out...
                        
      .reduce((a,b)=>a+b) //summed up


                        Thanks to Jo King for the improvement!






                        share|improve this answer











                        $endgroup$













                        • $begingroup$
                          thanks! Added that in
                          $endgroup$
                          – zevee
                          55 mins ago














                        1












                        1








                        1





                        $begingroup$

                        Javascript, 62



                        n=>n==[...Array(n).keys()].filter(a=>n%a<1).reduce((a,b)=>a+b)


                        Explanation (although it's pretty simple)



                        n=> //return function that takes n
                        
  n== //and returns if n is equal to
                        
    [...Array(n).keys()] //an array [0..(n-1)]...
                        
      .filter(a=>n%a<1) //where all of the elements that are not divisors of n are taken out...
                        
      .reduce((a,b)=>a+b) //summed up


                        Thanks to Jo King for the improvement!






                        share|improve this answer











                        $endgroup$



                        Javascript, 62



                        n=>n==[...Array(n).keys()].filter(a=>n%a<1).reduce((a,b)=>a+b)


                        Explanation (although it's pretty simple)



                        n=> //return function that takes n
                        
  n== //and returns if n is equal to
                        
    [...Array(n).keys()] //an array [0..(n-1)]...
                        
      .filter(a=>n%a<1) //where all of the elements that are not divisors of n are taken out...
                        
      .reduce((a,b)=>a+b) //summed up


                        Thanks to Jo King for the improvement!







                        share|improve this answer














                        share|improve this answer



                        share|improve this answer








                        edited 55 mins ago

























                        answered 1 hour ago









                        zeveezevee

                        22016




                        22016












                        • $begingroup$
                          thanks! Added that in
                          $endgroup$
                          – zevee
                          55 mins ago


















                        • $begingroup$
                          thanks! Added that in
                          $endgroup$
                          – zevee
                          55 mins ago
















                        $begingroup$
                        thanks! Added that in
                        $endgroup$
                        – zevee
                        55 mins ago




                        $begingroup$
                        thanks! Added that in
                        $endgroup$
                        – zevee
                        55 mins ago











                        0












                        $begingroup$


                        C# (Visual C# Interactive Compiler), 49 bytes





                        n=>Enumerable.Range(1,n).Sum(x=>n%x<1?n/x:0)==n*2


                        Try it online!





                        share









                        $endgroup$


















                          0












                          $begingroup$


                          C# (Visual C# Interactive Compiler), 49 bytes





                          n=>Enumerable.Range(1,n).Sum(x=>n%x<1?n/x:0)==n*2


                          Try it online!





                          share









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$


                            C# (Visual C# Interactive Compiler), 49 bytes





                            n=>Enumerable.Range(1,n).Sum(x=>n%x<1?n/x:0)==n*2


                            Try it online!





                            share









                            $endgroup$




                            C# (Visual C# Interactive Compiler), 49 bytes





                            n=>Enumerable.Range(1,n).Sum(x=>n%x<1?n/x:0)==n*2


                            Try it online!






                            share











                            share


                            share










                            answered 4 mins ago









                            Embodiment of IgnoranceEmbodiment of Ignorance

                            1,578124




                            1,578124























                                0












                                $begingroup$


                                Python 3, 49 bytes





                                lambda x:sum([i for i in range(1,x)if x%i==0])==x


                                Brute force, sums the factors and checks for equality.



                                Try it online!





                                share









                                $endgroup$













                                • $begingroup$
                                  ==0 can be <1. I also don't think you need the in the sum function
                                  $endgroup$
                                  – Jo King
                                  15 secs ago
















                                0












                                $begingroup$


                                Python 3, 49 bytes





                                lambda x:sum([i for i in range(1,x)if x%i==0])==x


                                Brute force, sums the factors and checks for equality.



                                Try it online!





                                share









                                $endgroup$













                                • $begingroup$
                                  ==0 can be <1. I also don't think you need the in the sum function
                                  $endgroup$
                                  – Jo King
                                  15 secs ago














                                0












                                0








                                0





                                $begingroup$


                                Python 3, 49 bytes





                                lambda x:sum([i for i in range(1,x)if x%i==0])==x


                                Brute force, sums the factors and checks for equality.



                                Try it online!





                                share









                                $endgroup$




                                Python 3, 49 bytes





                                lambda x:sum([i for i in range(1,x)if x%i==0])==x


                                Brute force, sums the factors and checks for equality.



                                Try it online!






                                share











                                share


                                share










                                answered 54 secs ago









                                Neil A.Neil A.

                                1,268120




                                1,268120












                                • $begingroup$
                                  ==0 can be <1. I also don't think you need the in the sum function
                                  $endgroup$
                                  – Jo King
                                  15 secs ago


















                                • $begingroup$
                                  ==0 can be <1. I also don't think you need the in the sum function
                                  $endgroup$
                                  – Jo King
                                  15 secs ago
















                                $begingroup$
                                ==0 can be <1. I also don't think you need the in the sum function
                                $endgroup$
                                – Jo King
                                15 secs ago




                                $begingroup$
                                ==0 can be <1. I also don't think you need the in the sum function
                                $endgroup$
                                – Jo King
                                15 secs ago


















                                draft saved

                                draft discarded




















































                                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%2f181350%2fam-i-not-good-enough-for-you%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
                                この記事は検証可能な参考文献や出典が全く示されていないか、不十分です。 出典を追加して記事の信頼性向上にご協力ください。 （ 2019年1月 ） 「 サソリ 」のその他の用法については「サソリ (曖昧さ回避)」をご覧ください。 「 スコーピオン 」と「 スコルピオン 」はこの項目へ転送されています。その他の用法については「スコーピオン」をご覧ください。 サソリ目 生息年代: 430–0 Ma PreЄ Є O S D C P T J K Pg N シルル紀前期-現世 ダイオウサソリ（ Pandinus Imperator ） 分類 界 : 動物界 Animalia 門 : 節足動物門 Arthropoda 亜門 : 鋏角亜門 Chelicerata 綱 : クモガタ綱 Arachnida 目 : サソリ目 Scorpiones 学名 Scorpiones C. L. Koch, 1837 英名 Scorpion 上科 Pseudochactoidea キョクトウサソリ上科 Buthoidea Chaeriloidea Chactoidea Iuroidea Scorpionoidea サソリ （ サソリ類 、 蠍 、 蝎 、 scorpion ）は、鋏角亜門・クモガタ綱の サソリ目 （ Scorpiones ）に属する節足動物の総称である。体の前端に鋏型の触肢、後端に毒針を有する捕食者である。 1700種以上を含め、最古の化石記録は4億3千万年前のシルル紀まで遡る。有毒生物として広く知られるが、人間の命にかかわる毒を持つものはごく一部の種類に過ぎない。 目次 1 形態 1.1 前体 1.2 後体 1.2.1 中体 1.2.2 終体 2 雌雄 3 生態 3.1 天敵 3.2 生殖 4 分布 5 毒 6 蛍光現象 7 分類
                                Read more

                                広島県道265号伴広島線

                                Image
                                一般県道 広島県道265号伴広島線 路線延長 km 起点 広島県広島市安佐南区伴東7丁目 終点 広島県広島市中区榎町 接続する 主な道路 （記法） 広島県道38号広島豊平線 広島県道71号広島湯来線 山陽自動車道五日市IC 国道183号（ 国道261号重複） ■テンプレート（■ノート ■使い方） ■PJ道路 広島県道265号伴広島線 （ひろしまけんどう265ごう ともひろしません）は広島県広島市安佐南区から広島県広島市中区を結ぶ一般県道である。 目次 1 路線データ 2 通過する自治体 3 見どころ 4 接続道路 4.1 本線 4.2 旧道 5 別名 6 関連項目 路線データ 本線 起点：広島市安佐南区伴東7丁目・大原下橋南詰交差点（広島県道38号広島豊平線（本線・旧道）交点） 終点：広島市中区榎町・十日市交差点（国道183号（国道261号重用）交点） 総延長： 旧道 起点：広島市安佐南区伴東4丁目・新細坂交差点（広島県道38号広島豊平線交点） 終点：広島市安佐南区伴中央4丁目・寺組橋(南)交差点（広島県道265号伴広島線（本線）交点） 総延長： 通過する自治体 広島県 広島市（安佐南区、佐伯区、西区、中区） 見どころ 広島高速交通広島新交通1号線（アストラムライン） 広島広域公園 広島広域公園陸上競技場（広島ビッグアーチ） 己斐峠 己斐橋（太田川放水路） 天満橋（天満川） 接続道路 本線 広島県道38号広島豊平線（本線・旧道）（広島市安佐南区伴東7丁目・大原下橋南詰交差点〔起点〕） 広島県道71号広島湯来線（本線）（広島市安佐南区伴中央2丁目・伴交番入口交差点 - 広島市安佐南区伴中央4丁目・寺組橋(南)交差点間で重用） 広島県道71号広島湯来線（旧道）（広島県道265号伴広島線（旧道）重用）（広島市安佐南区伴中央4丁目・寺組橋(南)交差点） 広島県道71号広島湯来線（広島市安佐南区伴中央4丁目・寺組橋(南)交差点 - 広島市佐伯区五日市町石内・五月が丘(南)交差点間で重用）
                                Read more

                                Setup Asymptote in Texstudio

                                Image
                                0 Good time of the day! I am trying to compile the following file: documentclass[12pt]{article} usepackage[inline]{asymptote} begin{document} Here is a venn diagram produced with Asymptote, drawn to width 4cm: defA{A} defB{V{B}} begin{figure} begin{center} begin{asy} size(4cm,0); pen colour1=red; pen colour2=green; pair z0=(0,0); pair z1=(-1,0); pair z2=(1,0); real r=1.5; path c1=circle(z1,r); path c2=circle(z2,r); fill(c1,colour1); fill(c2,colour2); picture intersection=new picture; fill(intersection,c1,colour1+colour2); clip(intersection,c2); add(intersection); draw(c1); draw(c2); //draw("$A$",box,z1)
                                Read more