Irreducible fatorization of $X^n-1$ in both the ring of polynomials with complex coefficients and real...











up vote
1
down vote

favorite












Let $f(x) = x^n-1$ be a polynomial in $Bbb R[x]$. Factorize $f(x)$ as a product of irreducible polynomials in $Bbb C[x]$ and show that if $n$ is even, $f(x)$ has two reals roots and if $n$ is odd, $f(x)$ has one real root.





Can someone help me? I know that a polynomium of degree $n$ has exactly $n$ complex roots and that I need to factorize it as a product of $n$ degree $1$ polynomials with $x-a_i$ where $a_i$ is the $i$'th root. But how do I determine the complex roots? And do I have to use the fact that complex roots always come in pairs with its complex conjugated?
I know that if $n $is even the are two real roots $1$ and $-1$ and if $n$ is odd the only root is $1$ with multiplicity of $2$.










share|cite|improve this question
























  • This should help : en.wikipedia.org/wiki/Root_of_unity .
    – LeoDucas
    Nov 25 at 17:28










  • I edited your post to properly $LaTeX$ify it. Remember to surround your $LaTeX$ with "$" signs; thus $ x^n - 1 $ yields $x^n - 1$ etc. Cheers!
    – Robert Lewis
    Nov 25 at 17:40















up vote
1
down vote

favorite












Let $f(x) = x^n-1$ be a polynomial in $Bbb R[x]$. Factorize $f(x)$ as a product of irreducible polynomials in $Bbb C[x]$ and show that if $n$ is even, $f(x)$ has two reals roots and if $n$ is odd, $f(x)$ has one real root.





Can someone help me? I know that a polynomium of degree $n$ has exactly $n$ complex roots and that I need to factorize it as a product of $n$ degree $1$ polynomials with $x-a_i$ where $a_i$ is the $i$'th root. But how do I determine the complex roots? And do I have to use the fact that complex roots always come in pairs with its complex conjugated?
I know that if $n $is even the are two real roots $1$ and $-1$ and if $n$ is odd the only root is $1$ with multiplicity of $2$.










share|cite|improve this question
























  • This should help : en.wikipedia.org/wiki/Root_of_unity .
    – LeoDucas
    Nov 25 at 17:28










  • I edited your post to properly $LaTeX$ify it. Remember to surround your $LaTeX$ with "$" signs; thus $ x^n - 1 $ yields $x^n - 1$ etc. Cheers!
    – Robert Lewis
    Nov 25 at 17:40













up vote
1
down vote

favorite









up vote
1
down vote

favorite











Let $f(x) = x^n-1$ be a polynomial in $Bbb R[x]$. Factorize $f(x)$ as a product of irreducible polynomials in $Bbb C[x]$ and show that if $n$ is even, $f(x)$ has two reals roots and if $n$ is odd, $f(x)$ has one real root.





Can someone help me? I know that a polynomium of degree $n$ has exactly $n$ complex roots and that I need to factorize it as a product of $n$ degree $1$ polynomials with $x-a_i$ where $a_i$ is the $i$'th root. But how do I determine the complex roots? And do I have to use the fact that complex roots always come in pairs with its complex conjugated?
I know that if $n $is even the are two real roots $1$ and $-1$ and if $n$ is odd the only root is $1$ with multiplicity of $2$.










share|cite|improve this question















Let $f(x) = x^n-1$ be a polynomial in $Bbb R[x]$. Factorize $f(x)$ as a product of irreducible polynomials in $Bbb C[x]$ and show that if $n$ is even, $f(x)$ has two reals roots and if $n$ is odd, $f(x)$ has one real root.





Can someone help me? I know that a polynomium of degree $n$ has exactly $n$ complex roots and that I need to factorize it as a product of $n$ degree $1$ polynomials with $x-a_i$ where $a_i$ is the $i$'th root. But how do I determine the complex roots? And do I have to use the fact that complex roots always come in pairs with its complex conjugated?
I know that if $n $is even the are two real roots $1$ and $-1$ and if $n$ is odd the only root is $1$ with multiplicity of $2$.







polynomials complex-numbers factoring irreducible-polynomials






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 25 at 17:37









Robert Lewis

42.7k22862




42.7k22862










asked Nov 25 at 17:16









CruZ

416




416












  • This should help : en.wikipedia.org/wiki/Root_of_unity .
    – LeoDucas
    Nov 25 at 17:28










  • I edited your post to properly $LaTeX$ify it. Remember to surround your $LaTeX$ with "$" signs; thus $ x^n - 1 $ yields $x^n - 1$ etc. Cheers!
    – Robert Lewis
    Nov 25 at 17:40


















  • This should help : en.wikipedia.org/wiki/Root_of_unity .
    – LeoDucas
    Nov 25 at 17:28










  • I edited your post to properly $LaTeX$ify it. Remember to surround your $LaTeX$ with "$" signs; thus $ x^n - 1 $ yields $x^n - 1$ etc. Cheers!
    – Robert Lewis
    Nov 25 at 17:40
















This should help : en.wikipedia.org/wiki/Root_of_unity .
– LeoDucas
Nov 25 at 17:28




This should help : en.wikipedia.org/wiki/Root_of_unity .
– LeoDucas
Nov 25 at 17:28












I edited your post to properly $LaTeX$ify it. Remember to surround your $LaTeX$ with "$" signs; thus $ x^n - 1 $ yields $x^n - 1$ etc. Cheers!
– Robert Lewis
Nov 25 at 17:40




I edited your post to properly $LaTeX$ify it. Remember to surround your $LaTeX$ with "$" signs; thus $ x^n - 1 $ yields $x^n - 1$ etc. Cheers!
– Robert Lewis
Nov 25 at 17:40










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Hint:



The complex roots are the $n$-th roots of unity, which you determine with the exponential form of complex numbers: they have modulus $1$ and their argument must satisfy
$$bigl(mathrm e^{itheta}bigr)^n=mathrm e^{intheta}=1=mathrm e^{icdot0}iff nthetaequiv 0mod 2piiffthetaequiv 0modfrac{2pi}n,$$
taking into account that the complex exponential function has period $2ipi$.



Can you proceed and show there are $n$ roots of unity and determine which pairs are conjugate?






share|cite|improve this answer





















    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.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',
    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%2f3013107%2firreducible-fatorization-of-xn-1-in-both-the-ring-of-polynomials-with-complex%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    0
    down vote













    Hint:



    The complex roots are the $n$-th roots of unity, which you determine with the exponential form of complex numbers: they have modulus $1$ and their argument must satisfy
    $$bigl(mathrm e^{itheta}bigr)^n=mathrm e^{intheta}=1=mathrm e^{icdot0}iff nthetaequiv 0mod 2piiffthetaequiv 0modfrac{2pi}n,$$
    taking into account that the complex exponential function has period $2ipi$.



    Can you proceed and show there are $n$ roots of unity and determine which pairs are conjugate?






    share|cite|improve this answer

























      up vote
      0
      down vote













      Hint:



      The complex roots are the $n$-th roots of unity, which you determine with the exponential form of complex numbers: they have modulus $1$ and their argument must satisfy
      $$bigl(mathrm e^{itheta}bigr)^n=mathrm e^{intheta}=1=mathrm e^{icdot0}iff nthetaequiv 0mod 2piiffthetaequiv 0modfrac{2pi}n,$$
      taking into account that the complex exponential function has period $2ipi$.



      Can you proceed and show there are $n$ roots of unity and determine which pairs are conjugate?






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        Hint:



        The complex roots are the $n$-th roots of unity, which you determine with the exponential form of complex numbers: they have modulus $1$ and their argument must satisfy
        $$bigl(mathrm e^{itheta}bigr)^n=mathrm e^{intheta}=1=mathrm e^{icdot0}iff nthetaequiv 0mod 2piiffthetaequiv 0modfrac{2pi}n,$$
        taking into account that the complex exponential function has period $2ipi$.



        Can you proceed and show there are $n$ roots of unity and determine which pairs are conjugate?






        share|cite|improve this answer












        Hint:



        The complex roots are the $n$-th roots of unity, which you determine with the exponential form of complex numbers: they have modulus $1$ and their argument must satisfy
        $$bigl(mathrm e^{itheta}bigr)^n=mathrm e^{intheta}=1=mathrm e^{icdot0}iff nthetaequiv 0mod 2piiffthetaequiv 0modfrac{2pi}n,$$
        taking into account that the complex exponential function has period $2ipi$.



        Can you proceed and show there are $n$ roots of unity and determine which pairs are conjugate?







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 25 at 17:38









        Bernard

        117k637109




        117k637109






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3013107%2firreducible-fatorization-of-xn-1-in-both-the-ring-of-polynomials-with-complex%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

            To store a contact into the json file from server.js file using a class in NodeJS

            Redirect URL with Chrome Remote Debugging Android Devices

            Dieringhausen