Am I not good enough for you?Am I perfect (number)?Count how many numbers are divisible by perfect numbers in...

Difference on montgomery curve equation between EFD and RFC7748

Are tamper resistant receptacles really safer?

Was Luke Skywalker the leader of the Rebel forces on Hoth?

NASA's RS-25 Engines shut down time

When a wind turbine does not produce enough electricity how does the power company compensate for the loss?

Does this video of collapsing warehouse shelves show a real incident?

PTIJ: Should I kill my computer after installing software?

Why does the negative sign arise in this thermodynamic relation?

How did Alan Turing break the enigma code using the hint given by the lady in the bar?

Are babies of evil humanoid species inherently evil?

Are all players supposed to be able to see each others' character sheets?

Good for you! in Russian

What wound would be of little consequence to a biped but terrible for a quadruped?

What does "the touch of the purple" mean?

Why doesn't this Google Translate ad use the word "Translation" instead of "Translate"?

Accountant/ lawyer will not return my call

How can I ensure my trip to the UK will not have to be cancelled because of Brexit?

Makefile strange variable substitution

Conservation of Mass and Energy

Do f-stop and exposure time perfectly cancel?

Is "history" a male-biased word ("his+story")?

UART pins to unpowered MCU?

meaning and function of 幸 in "则幸分我一杯羹"

Intuition behind counterexample of Euler's sum of powers conjecture



Am I not good enough for you?


Am I perfect (number)?Count how many numbers are divisible by perfect numbers in a given rangeGenerate all 4-perfect numbersAm I perfect (number)?Is this number a factorial?Sum my Fibonaccified divisors!Do two numbers contain unique factorials?It's Hip to be SquareDo I have a prime twin?Determine SuperabundanceAm I a Pillai prime?













2












$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
    44 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
    42 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
    41 mins ago










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
















2












$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
    44 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
    42 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
    41 mins ago










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














2












2








2





$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 40 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
    44 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
    42 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
    41 mins ago










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


















  • $begingroup$
    Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
    $endgroup$
    – Esolanging Fruit
    44 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
    42 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
    41 mins ago










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
















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




$begingroup$
Wait, so truthy is for values that aren't perfect, and falsey is for values that are?
$endgroup$
– Esolanging Fruit
44 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
42 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
42 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
41 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
41 mins ago












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




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










4 Answers
4






active

oldest

votes


















2












$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
      24 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
      3 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
        37 mins 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

























      4 Answers
      4






      active

      oldest

      votes








      4 Answers
      4






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $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$


        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












          2








          2





          $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 42 mins ago

























          answered 47 mins ago









          Luis felipe De jesus MunozLuis felipe De jesus Munoz

          5,59821670




          5,59821670























              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
                24 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
                3 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
                24 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
                3 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 28 mins ago









              GiuseppeGiuseppe

              16.8k31052




              16.8k31052












              • $begingroup$
                What do the 2 !s in a row get you?
                $endgroup$
                – CT Hall
                24 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
                3 mins ago




















              • $begingroup$
                What do the 2 !s in a row get you?
                $endgroup$
                – CT Hall
                24 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
                3 mins ago


















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




              $begingroup$
              What do the 2 !s in a row get you?
              $endgroup$
              – CT Hall
              24 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
              3 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
              3 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 42 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
                        37 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
                        37 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 38 mins ago

























                      answered 46 mins ago









                      zeveezevee

                      22016




                      22016












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


















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
















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




                      $begingroup$
                      thanks! Added that in
                      $endgroup$
                      – zevee
                      37 mins 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

                      What is the “three and three hundred thousand syndrome”?Who wrote the book Arena?What five creatures were...

                      Image
                      What happens when the centripetal force is equal and opposite to the centrifugal force? Why is "la Gestapo" feminine? Nested Dynamic SOQL Query How are passwords stolen from companies if they only store hashes? Exposing a company lying about themselves in a tightly knit industry: Is my career at risk on the long run? Can "few" be used as a subject? If so, what is the rule? Why are there no stars visible in cislunar space? categorizing a variable turns it from insignificant to significant Do I need an EFI partition for each 18.04 ubuntu I have on my HD? What are the consequences of changing the number of hours in ...
                      Read more

                      Gersau Kjelder | Navigasjonsmeny46°59′0″N 8°31′0″E46°59′0″N...

                      Image
                      Tidlegare republikkarSkipingar i 1433Kommunar i SchwyzDistrikt i SchwyzNedleggingar i 1798Stader ved Vierwaldstättersee kommunekantonenSchwyzSveitskm²VierwaldstätterseeLauerz Gersau Kommunevåpenet til Gersau Plassering Styresmakter Land   Sveits Kanton kantonen Schwyz Distrikt Gersau Språk tysk Geografi Flatevidd  - kommune 23,70 km² Innbyggjarar  - kommune (desember 2010)    - folketettleik 2 094   88,4 /km² Koordinatar 46°59′0″N 8°31′0″E  Koordinatar: 46°59′0″N 8°31′0″E  Høgd over havet 435 moh Diverse annan informasjon Postnummer 6442 Nettstad: www.gersau.ch Freistaat und Republik Gersau Fristaten og republikken Gersau By-republikk og alliert protektorat i Det gamle sveitsiske eidsforundet ←   ← 1433–1798 1814–1818 →   → Hovudstad Gersau Styreform Republikk Historisk periode Tidleg moderne tid  - Kjøpte fridom frå ...
                      Read more

                      Hestehale Innhaldsliste Hestehale på kvinner | Hestehale på menn | Galleri | Sjå òg |...

                      Image
                      Frisyrar frisyrehårhårstrikkhårklemmerøyrethesthovudverkeuropeisk motejobbtreningfletterparykkarungdomsopprørmotkulturmusikararmotorsykkelentusiastarpolitietpolitiskforretningverksemdfiskeflette Hestehale sett bakfrå. Hestehale på ein mannleg indianarleiar. Hestehale er ein frisyre der ein samlar det meste eller alt av langt hår [1] i bakhovudet med ein hårstrikk eller liknande. Avhengig av mote kan det òg vere vanleg å sette opp hestehalen med hårklemmer eller å ha hestehalen hengande på den eine sida av hovudet ved å samle håret ved øyret. Hestehale er ein vanleg frisyre for jenter og for gutar med langt hår. Han har fått namnet sitt etter likskapen med halen på ein hest. For stramme hestehaler kan føre til hårtap, [2] i nokre høve også hovudverk. [3] Innhaldsliste 1 Hestehale på kvinner 2 Hestehale på menn 3 Galleri 4 Sjå òg 5 Bakgrunnsstoff 6 Kjelder Hestehale på kvinner | Ungjente med hestehale som held håret unna ansiktet...
                      Read more