prime numbers and expressing non-prime numbers Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Expressing a Non Negative Integer as Sums of Two SquaresAre all prime numbers finite?How can can you write a prime number as a product of prime numbers?Who generates the prime numbers for encryption?In Fermat's little theorem, if mod is not prime?Prime numbers like 113Non-unique prime factorisationWhy are all non-prime numbers divisible by a prime number?Generating Prime Numbers From Composite NumbersAlternate definition of prime numbers

How to bypass password on Windows XP account?

The logistics of corpse disposal

Single word antonym of "flightless"

How does the particle を relate to the verb 行く in the structure「A を + B に行く」?

How discoverable are IPv6 addresses and AAAA names by potential attackers?

How to call a function with default parameter through a pointer to function that is the return of another function?

How to deal with a team lead who never gives me credit?

How widely used is the term Treppenwitz? Is it something that most Germans know?

Why do people hide their license plates in the EU?

Overriding an object in memory with placement new

How to align text above triangle figure

Book where humans were engineered with genes from animal species to survive hostile planets

Fundamental Solution of the Pell Equation

Can a non-EU citizen traveling with me come with me through the EU passport line?

In predicate logic, does existential quantification (∃) include universal quantification (∀), i.e. can 'some' imply 'all'?

Why are there no cargo aircraft with "flying wing" design?

Bete Noir -- no dairy

Selecting the same column from Different rows Based on Different Criteria

List *all* the tuples!

Using et al. for a last / senior author rather than for a first author

prime numbers and expressing non-prime numbers

Seeking colloquialism for “just because”

Why did the rest of the Eastern Bloc not invade Yugoslavia?

Why aren't air breathing engines used as small first stages



prime numbers and expressing non-prime numbers



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Expressing a Non Negative Integer as Sums of Two SquaresAre all prime numbers finite?How can can you write a prime number as a product of prime numbers?Who generates the prime numbers for encryption?In Fermat's little theorem, if mod is not prime?Prime numbers like 113Non-unique prime factorisationWhy are all non-prime numbers divisible by a prime number?Generating Prime Numbers From Composite NumbersAlternate definition of prime numbers










2












$begingroup$


My textbook says if $b$ is a non-prime number then it can be expressed as a product of prime numbers. But if $1$ isn't prime how it can be expressed as a product of prime numbers?










share|cite|improve this question











$endgroup$







  • 5




    $begingroup$
    An empty product is still a product.
    $endgroup$
    – lulu
    4 hours ago






  • 1




    $begingroup$
    The standard modern day view is that the number 1 is neither prime nor composite.
    $endgroup$
    – Martin Hansen
    4 hours ago















2












$begingroup$


My textbook says if $b$ is a non-prime number then it can be expressed as a product of prime numbers. But if $1$ isn't prime how it can be expressed as a product of prime numbers?










share|cite|improve this question











$endgroup$







  • 5




    $begingroup$
    An empty product is still a product.
    $endgroup$
    – lulu
    4 hours ago






  • 1




    $begingroup$
    The standard modern day view is that the number 1 is neither prime nor composite.
    $endgroup$
    – Martin Hansen
    4 hours ago













2












2








2





$begingroup$


My textbook says if $b$ is a non-prime number then it can be expressed as a product of prime numbers. But if $1$ isn't prime how it can be expressed as a product of prime numbers?










share|cite|improve this question











$endgroup$




My textbook says if $b$ is a non-prime number then it can be expressed as a product of prime numbers. But if $1$ isn't prime how it can be expressed as a product of prime numbers?







number-theory elementary-number-theory prime-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 3 hours ago









Mr. Brooks

22211338




22211338










asked 4 hours ago









Ahmed M. ElsonbatyAhmed M. Elsonbaty

624




624







  • 5




    $begingroup$
    An empty product is still a product.
    $endgroup$
    – lulu
    4 hours ago






  • 1




    $begingroup$
    The standard modern day view is that the number 1 is neither prime nor composite.
    $endgroup$
    – Martin Hansen
    4 hours ago












  • 5




    $begingroup$
    An empty product is still a product.
    $endgroup$
    – lulu
    4 hours ago






  • 1




    $begingroup$
    The standard modern day view is that the number 1 is neither prime nor composite.
    $endgroup$
    – Martin Hansen
    4 hours ago







5




5




$begingroup$
An empty product is still a product.
$endgroup$
– lulu
4 hours ago




$begingroup$
An empty product is still a product.
$endgroup$
– lulu
4 hours ago




1




1




$begingroup$
The standard modern day view is that the number 1 is neither prime nor composite.
$endgroup$
– Martin Hansen
4 hours ago




$begingroup$
The standard modern day view is that the number 1 is neither prime nor composite.
$endgroup$
– Martin Hansen
4 hours ago










3 Answers
3






active

oldest

votes


















1












$begingroup$

"In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1 either is a prime number itself or can be represented as the product of prime numbers and that, moreover, this representation is unique, up to (except for) the order of the factors."



Your error lies in stating the fundamental theorem of arithmetic incorrectly.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
    $endgroup$
    – Mr. Brooks
    3 hours ago










  • $begingroup$
    I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
    $endgroup$
    – Peter Foreman
    3 hours ago






  • 1




    $begingroup$
    There is no problem at all if you treat this website as a competition for points.
    $endgroup$
    – Mr. Brooks
    3 hours ago


















2












$begingroup$

This is mainly just an extended comment on Peter Foreman's answer. The (relatively difficult) uniqueness aspect of the Fundamental Theorem of Arithmetic is not needed for the OP's question, just the (easier) existence aspect.



What's missing from the OP's textbook is the qualifier in the correct assertion that every non-prime number greater than $1$ can be expressed as a product of primes. This is the existence aspect of FTA, and it can be proved by strong induction: If $ngt1$ is not a prime, then $n=ab$ for some pair of integers with $1lt a,b$. Both $a$ and $b$ must be less than $n$ (otherwise their product would be more than $n$), so we can assume, by strong induction, that each of them can be written as a product of primes, hence so can their product, which is $n$.



Remark: "Strong" induction means that you don't just assume an assertion is true for $n-1$ and then prove it for $n$, you assume it's true for all positive integers $klt n$. In this case the assertion is "if $kgt1$ and $k$ is non-prime, then $k$ can be written as a product of primes." Note that the base case, $k=1$, is vacuously true, because $1$ is not greater than $1$.






share|cite|improve this answer









$endgroup$




















    1












    $begingroup$

    What is the sum of no numbers at all? Zero, of course, since it is the additive identity: $x + 0 = 0$, where $x neq 0$, or even if it is.



    Now, what is the product of no numbers at all? It can't be zero, since, maintaining the stipulation that $x neq 0$, we have $x times 0 = 0$, and we said $x neq 0$. The multiplicative identity is $1$, since $x times 1 = 1$.



    Hence, the product of no primes at all is $1$. The fundamental theorem of arithmetic is a subtlety that's unnecessary for answering your question.






    share|cite|improve this answer









    $endgroup$













      Your Answer








      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "69"
      ;
      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: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      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
      ,
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );













      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3190287%2fprime-numbers-and-expressing-non-prime-numbers%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      1












      $begingroup$

      "In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1 either is a prime number itself or can be represented as the product of prime numbers and that, moreover, this representation is unique, up to (except for) the order of the factors."



      Your error lies in stating the fundamental theorem of arithmetic incorrectly.






      share|cite|improve this answer









      $endgroup$












      • $begingroup$
        What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
        $endgroup$
        – Mr. Brooks
        3 hours ago










      • $begingroup$
        I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
        $endgroup$
        – Peter Foreman
        3 hours ago






      • 1




        $begingroup$
        There is no problem at all if you treat this website as a competition for points.
        $endgroup$
        – Mr. Brooks
        3 hours ago















      1












      $begingroup$

      "In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1 either is a prime number itself or can be represented as the product of prime numbers and that, moreover, this representation is unique, up to (except for) the order of the factors."



      Your error lies in stating the fundamental theorem of arithmetic incorrectly.






      share|cite|improve this answer









      $endgroup$












      • $begingroup$
        What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
        $endgroup$
        – Mr. Brooks
        3 hours ago










      • $begingroup$
        I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
        $endgroup$
        – Peter Foreman
        3 hours ago






      • 1




        $begingroup$
        There is no problem at all if you treat this website as a competition for points.
        $endgroup$
        – Mr. Brooks
        3 hours ago













      1












      1








      1





      $begingroup$

      "In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1 either is a prime number itself or can be represented as the product of prime numbers and that, moreover, this representation is unique, up to (except for) the order of the factors."



      Your error lies in stating the fundamental theorem of arithmetic incorrectly.






      share|cite|improve this answer









      $endgroup$



      "In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1 either is a prime number itself or can be represented as the product of prime numbers and that, moreover, this representation is unique, up to (except for) the order of the factors."



      Your error lies in stating the fundamental theorem of arithmetic incorrectly.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered 4 hours ago









      Peter ForemanPeter Foreman

      7,8931320




      7,8931320











      • $begingroup$
        What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
        $endgroup$
        – Mr. Brooks
        3 hours ago










      • $begingroup$
        I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
        $endgroup$
        – Peter Foreman
        3 hours ago






      • 1




        $begingroup$
        There is no problem at all if you treat this website as a competition for points.
        $endgroup$
        – Mr. Brooks
        3 hours ago
















      • $begingroup$
        What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
        $endgroup$
        – Mr. Brooks
        3 hours ago










      • $begingroup$
        I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
        $endgroup$
        – Peter Foreman
        3 hours ago






      • 1




        $begingroup$
        There is no problem at all if you treat this website as a competition for points.
        $endgroup$
        – Mr. Brooks
        3 hours ago















      $begingroup$
      What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
      $endgroup$
      – Mr. Brooks
      3 hours ago




      $begingroup$
      What about non-UFDs? 1 is still not prime in those, so FTA does not apply, and the asker didn't even bring up the FTA.
      $endgroup$
      – Mr. Brooks
      3 hours ago












      $begingroup$
      I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
      $endgroup$
      – Peter Foreman
      3 hours ago




      $begingroup$
      I assumed that their textbook meant the FTA and they accepted my answer, what is the problem?
      $endgroup$
      – Peter Foreman
      3 hours ago




      1




      1




      $begingroup$
      There is no problem at all if you treat this website as a competition for points.
      $endgroup$
      – Mr. Brooks
      3 hours ago




      $begingroup$
      There is no problem at all if you treat this website as a competition for points.
      $endgroup$
      – Mr. Brooks
      3 hours ago











      2












      $begingroup$

      This is mainly just an extended comment on Peter Foreman's answer. The (relatively difficult) uniqueness aspect of the Fundamental Theorem of Arithmetic is not needed for the OP's question, just the (easier) existence aspect.



      What's missing from the OP's textbook is the qualifier in the correct assertion that every non-prime number greater than $1$ can be expressed as a product of primes. This is the existence aspect of FTA, and it can be proved by strong induction: If $ngt1$ is not a prime, then $n=ab$ for some pair of integers with $1lt a,b$. Both $a$ and $b$ must be less than $n$ (otherwise their product would be more than $n$), so we can assume, by strong induction, that each of them can be written as a product of primes, hence so can their product, which is $n$.



      Remark: "Strong" induction means that you don't just assume an assertion is true for $n-1$ and then prove it for $n$, you assume it's true for all positive integers $klt n$. In this case the assertion is "if $kgt1$ and $k$ is non-prime, then $k$ can be written as a product of primes." Note that the base case, $k=1$, is vacuously true, because $1$ is not greater than $1$.






      share|cite|improve this answer









      $endgroup$

















        2












        $begingroup$

        This is mainly just an extended comment on Peter Foreman's answer. The (relatively difficult) uniqueness aspect of the Fundamental Theorem of Arithmetic is not needed for the OP's question, just the (easier) existence aspect.



        What's missing from the OP's textbook is the qualifier in the correct assertion that every non-prime number greater than $1$ can be expressed as a product of primes. This is the existence aspect of FTA, and it can be proved by strong induction: If $ngt1$ is not a prime, then $n=ab$ for some pair of integers with $1lt a,b$. Both $a$ and $b$ must be less than $n$ (otherwise their product would be more than $n$), so we can assume, by strong induction, that each of them can be written as a product of primes, hence so can their product, which is $n$.



        Remark: "Strong" induction means that you don't just assume an assertion is true for $n-1$ and then prove it for $n$, you assume it's true for all positive integers $klt n$. In this case the assertion is "if $kgt1$ and $k$ is non-prime, then $k$ can be written as a product of primes." Note that the base case, $k=1$, is vacuously true, because $1$ is not greater than $1$.






        share|cite|improve this answer









        $endgroup$















          2












          2








          2





          $begingroup$

          This is mainly just an extended comment on Peter Foreman's answer. The (relatively difficult) uniqueness aspect of the Fundamental Theorem of Arithmetic is not needed for the OP's question, just the (easier) existence aspect.



          What's missing from the OP's textbook is the qualifier in the correct assertion that every non-prime number greater than $1$ can be expressed as a product of primes. This is the existence aspect of FTA, and it can be proved by strong induction: If $ngt1$ is not a prime, then $n=ab$ for some pair of integers with $1lt a,b$. Both $a$ and $b$ must be less than $n$ (otherwise their product would be more than $n$), so we can assume, by strong induction, that each of them can be written as a product of primes, hence so can their product, which is $n$.



          Remark: "Strong" induction means that you don't just assume an assertion is true for $n-1$ and then prove it for $n$, you assume it's true for all positive integers $klt n$. In this case the assertion is "if $kgt1$ and $k$ is non-prime, then $k$ can be written as a product of primes." Note that the base case, $k=1$, is vacuously true, because $1$ is not greater than $1$.






          share|cite|improve this answer









          $endgroup$



          This is mainly just an extended comment on Peter Foreman's answer. The (relatively difficult) uniqueness aspect of the Fundamental Theorem of Arithmetic is not needed for the OP's question, just the (easier) existence aspect.



          What's missing from the OP's textbook is the qualifier in the correct assertion that every non-prime number greater than $1$ can be expressed as a product of primes. This is the existence aspect of FTA, and it can be proved by strong induction: If $ngt1$ is not a prime, then $n=ab$ for some pair of integers with $1lt a,b$. Both $a$ and $b$ must be less than $n$ (otherwise their product would be more than $n$), so we can assume, by strong induction, that each of them can be written as a product of primes, hence so can their product, which is $n$.



          Remark: "Strong" induction means that you don't just assume an assertion is true for $n-1$ and then prove it for $n$, you assume it's true for all positive integers $klt n$. In this case the assertion is "if $kgt1$ and $k$ is non-prime, then $k$ can be written as a product of primes." Note that the base case, $k=1$, is vacuously true, because $1$ is not greater than $1$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 3 hours ago









          Barry CipraBarry Cipra

          60.7k655129




          60.7k655129





















              1












              $begingroup$

              What is the sum of no numbers at all? Zero, of course, since it is the additive identity: $x + 0 = 0$, where $x neq 0$, or even if it is.



              Now, what is the product of no numbers at all? It can't be zero, since, maintaining the stipulation that $x neq 0$, we have $x times 0 = 0$, and we said $x neq 0$. The multiplicative identity is $1$, since $x times 1 = 1$.



              Hence, the product of no primes at all is $1$. The fundamental theorem of arithmetic is a subtlety that's unnecessary for answering your question.






              share|cite|improve this answer









              $endgroup$

















                1












                $begingroup$

                What is the sum of no numbers at all? Zero, of course, since it is the additive identity: $x + 0 = 0$, where $x neq 0$, or even if it is.



                Now, what is the product of no numbers at all? It can't be zero, since, maintaining the stipulation that $x neq 0$, we have $x times 0 = 0$, and we said $x neq 0$. The multiplicative identity is $1$, since $x times 1 = 1$.



                Hence, the product of no primes at all is $1$. The fundamental theorem of arithmetic is a subtlety that's unnecessary for answering your question.






                share|cite|improve this answer









                $endgroup$















                  1












                  1








                  1





                  $begingroup$

                  What is the sum of no numbers at all? Zero, of course, since it is the additive identity: $x + 0 = 0$, where $x neq 0$, or even if it is.



                  Now, what is the product of no numbers at all? It can't be zero, since, maintaining the stipulation that $x neq 0$, we have $x times 0 = 0$, and we said $x neq 0$. The multiplicative identity is $1$, since $x times 1 = 1$.



                  Hence, the product of no primes at all is $1$. The fundamental theorem of arithmetic is a subtlety that's unnecessary for answering your question.






                  share|cite|improve this answer









                  $endgroup$



                  What is the sum of no numbers at all? Zero, of course, since it is the additive identity: $x + 0 = 0$, where $x neq 0$, or even if it is.



                  Now, what is the product of no numbers at all? It can't be zero, since, maintaining the stipulation that $x neq 0$, we have $x times 0 = 0$, and we said $x neq 0$. The multiplicative identity is $1$, since $x times 1 = 1$.



                  Hence, the product of no primes at all is $1$. The fundamental theorem of arithmetic is a subtlety that's unnecessary for answering your question.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 3 hours ago









                  Mr. BrooksMr. Brooks

                  22211338




                  22211338



























                      draft saved

                      draft discarded
















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid


                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.

                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3190287%2fprime-numbers-and-expressing-non-prime-numbers%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

                      名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

                      Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

                      Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar