Let $p$ be prime, and $n < p$. Then $ntimes i$ “hits” every residue class for $0 < i < p$. (Searching for clean proof)

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












Intuitively, I'm trying to show that the first $p-1$ multiples of n give every possible remainder after division by p. Or equivalently,



$$ T = ; i in mathbbZ, ; 1 leq i < p $$



$$S = a ; $$



are equal.



Showing $T subseteq S$ is straightforward, but my proof for $ S subseteq T$ is two handwritten pages long and (even by my standards) convoluted.



This has the feel of well-known theorem, but I can't find it anywhere. Could someone either provide or link to a short/clean proof for the above?




elementary-number-theory




share|cite|improve this question





















  • This is a similar question to the one that I asked here
    – Bill Wallis
    2 days ago















up vote
1
down vote

favorite












Intuitively, I'm trying to show that the first $p-1$ multiples of n give every possible remainder after division by p. Or equivalently,



$$ T = ; i in mathbbZ, ; 1 leq i < p $$



$$S = a ; $$



are equal.



Showing $T subseteq S$ is straightforward, but my proof for $ S subseteq T$ is two handwritten pages long and (even by my standards) convoluted.



This has the feel of well-known theorem, but I can't find it anywhere. Could someone either provide or link to a short/clean proof for the above?




elementary-number-theory




share|cite|improve this question





















  • This is a similar question to the one that I asked here
    – Bill Wallis
    2 days ago













up vote
1
down vote

favorite









up vote
1
down vote

favorite











Intuitively, I'm trying to show that the first $p-1$ multiples of n give every possible remainder after division by p. Or equivalently,



$$ T = ; i in mathbbZ, ; 1 leq i < p $$



$$S = a ; $$



are equal.



Showing $T subseteq S$ is straightforward, but my proof for $ S subseteq T$ is two handwritten pages long and (even by my standards) convoluted.



This has the feel of well-known theorem, but I can't find it anywhere. Could someone either provide or link to a short/clean proof for the above?




elementary-number-theory




share|cite|improve this question













Intuitively, I'm trying to show that the first $p-1$ multiples of n give every possible remainder after division by p. Or equivalently,



$$ T = ; i in mathbbZ, ; 1 leq i < p $$



$$S = a ; $$



are equal.



Showing $T subseteq S$ is straightforward, but my proof for $ S subseteq T$ is two handwritten pages long and (even by my standards) convoluted.



This has the feel of well-known theorem, but I can't find it anywhere. Could someone either provide or link to a short/clean proof for the above?





elementary-number-theory





share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited 2 days ago









pointguard0

520315




520315









asked 2 days ago









Noah Caplinger

84




84











  • This is a similar question to the one that I asked here
    – Bill Wallis
    2 days ago

















  • This is a similar question to the one that I asked here
    – Bill Wallis
    2 days ago
















This is a similar question to the one that I asked here
– Bill Wallis
2 days ago





This is a similar question to the one that I asked here
– Bill Wallis
2 days ago











2 Answers
2






active

oldest

votes

















up vote
1
down vote



accepted










Suppose that two numbers fell into the same bin: $acdot nequiv bcdot npmod p$. Then $(acdot n-bcdot n)equiv 0bmod p$, so there's some number $c$ with $(a-b)cdot n=ccdot p$. Now, can you finish up from here? (This is where it's essential that $p$ is prime.)



Once you know that no two numbers fall into the same bin, then the rest is just an application of the pigeonhole principle: there are $p$ distinct equivalence classes of $acdot nbmod p$ for $0leq alt p$, and there are $p$ distinct representatives $langle brangle$ of those equivalence classes with $0leq blt p$, so the former must cover all the latter.






share|cite|improve this answer





















  • Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
    – Noah Caplinger
    2 days ago










  • Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
    – Steven Stadnicki
    2 days ago











  • So why is it essential that p is prime?
    – Noah Caplinger
    2 days ago










  • Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
    – Steven Stadnicki
    2 days ago










  • Thanks for the help!
    – Noah Caplinger
    2 days ago

















up vote
0
down vote













This follows from the fact that $n$ is invertible in the ring $mathbbZ_p$ so you can solve the equation



$$ni = y$$



as



$$i = n^-1y$$






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: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2871759%2flet-p-be-prime-and-n-p-then-n-times-i-hits-every-residue-class-for%23new-answer', 'question_page');

    );

    Post as a guest

















    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote



    accepted










    Suppose that two numbers fell into the same bin: $acdot nequiv bcdot npmod p$. Then $(acdot n-bcdot n)equiv 0bmod p$, so there's some number $c$ with $(a-b)cdot n=ccdot p$. Now, can you finish up from here? (This is where it's essential that $p$ is prime.)



    Once you know that no two numbers fall into the same bin, then the rest is just an application of the pigeonhole principle: there are $p$ distinct equivalence classes of $acdot nbmod p$ for $0leq alt p$, and there are $p$ distinct representatives $langle brangle$ of those equivalence classes with $0leq blt p$, so the former must cover all the latter.






    share|cite|improve this answer





















    • Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
      – Noah Caplinger
      2 days ago










    • Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
      – Steven Stadnicki
      2 days ago











    • So why is it essential that p is prime?
      – Noah Caplinger
      2 days ago










    • Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
      – Steven Stadnicki
      2 days ago










    • Thanks for the help!
      – Noah Caplinger
      2 days ago














    up vote
    1
    down vote



    accepted










    Suppose that two numbers fell into the same bin: $acdot nequiv bcdot npmod p$. Then $(acdot n-bcdot n)equiv 0bmod p$, so there's some number $c$ with $(a-b)cdot n=ccdot p$. Now, can you finish up from here? (This is where it's essential that $p$ is prime.)



    Once you know that no two numbers fall into the same bin, then the rest is just an application of the pigeonhole principle: there are $p$ distinct equivalence classes of $acdot nbmod p$ for $0leq alt p$, and there are $p$ distinct representatives $langle brangle$ of those equivalence classes with $0leq blt p$, so the former must cover all the latter.






    share|cite|improve this answer





















    • Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
      – Noah Caplinger
      2 days ago










    • Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
      – Steven Stadnicki
      2 days ago











    • So why is it essential that p is prime?
      – Noah Caplinger
      2 days ago










    • Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
      – Steven Stadnicki
      2 days ago










    • Thanks for the help!
      – Noah Caplinger
      2 days ago












    up vote
    1
    down vote



    accepted







    up vote
    1
    down vote



    accepted






    Suppose that two numbers fell into the same bin: $acdot nequiv bcdot npmod p$. Then $(acdot n-bcdot n)equiv 0bmod p$, so there's some number $c$ with $(a-b)cdot n=ccdot p$. Now, can you finish up from here? (This is where it's essential that $p$ is prime.)



    Once you know that no two numbers fall into the same bin, then the rest is just an application of the pigeonhole principle: there are $p$ distinct equivalence classes of $acdot nbmod p$ for $0leq alt p$, and there are $p$ distinct representatives $langle brangle$ of those equivalence classes with $0leq blt p$, so the former must cover all the latter.






    share|cite|improve this answer













    Suppose that two numbers fell into the same bin: $acdot nequiv bcdot npmod p$. Then $(acdot n-bcdot n)equiv 0bmod p$, so there's some number $c$ with $(a-b)cdot n=ccdot p$. Now, can you finish up from here? (This is where it's essential that $p$ is prime.)



    Once you know that no two numbers fall into the same bin, then the rest is just an application of the pigeonhole principle: there are $p$ distinct equivalence classes of $acdot nbmod p$ for $0leq alt p$, and there are $p$ distinct representatives $langle brangle$ of those equivalence classes with $0leq blt p$, so the former must cover all the latter.







    share|cite|improve this answer













    share|cite|improve this answer



    share|cite|improve this answer











    answered 2 days ago









    Steven Stadnicki

    40.1k765119




    40.1k765119











    • Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
      – Noah Caplinger
      2 days ago










    • Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
      – Steven Stadnicki
      2 days ago











    • So why is it essential that p is prime?
      – Noah Caplinger
      2 days ago










    • Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
      – Steven Stadnicki
      2 days ago










    • Thanks for the help!
      – Noah Caplinger
      2 days ago
















    • Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
      – Noah Caplinger
      2 days ago










    • Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
      – Steven Stadnicki
      2 days ago











    • So why is it essential that p is prime?
      – Noah Caplinger
      2 days ago










    • Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
      – Steven Stadnicki
      2 days ago










    • Thanks for the help!
      – Noah Caplinger
      2 days ago















    Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
    – Noah Caplinger
    2 days ago




    Just so I'm understanding fully: p divides c*p, so p also divides (a-b)*n. But n does not divide p (p is prime), so p divides (a-b), meaning a = b mod p. Is this correct?
    – Noah Caplinger
    2 days ago












    Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
    – Steven Stadnicki
    2 days ago





    Pretty close - $p$ divides $(a-b)cdot n$, so either $p|(a-b)$ or $p|n$, and the latter is impossible since $nlt p$.
    – Steven Stadnicki
    2 days ago













    So why is it essential that p is prime?
    – Noah Caplinger
    2 days ago




    So why is it essential that p is prime?
    – Noah Caplinger
    2 days ago












    Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
    – Steven Stadnicki
    2 days ago




    Because $a|bcdot c$ doesn't necessarily imply $a|b$ or $a|c$ if $a$ isn't a prime; consider, e.g., $4|6cdot10$.
    – Steven Stadnicki
    2 days ago












    Thanks for the help!
    – Noah Caplinger
    2 days ago




    Thanks for the help!
    – Noah Caplinger
    2 days ago










    up vote
    0
    down vote













    This follows from the fact that $n$ is invertible in the ring $mathbbZ_p$ so you can solve the equation



    $$ni = y$$



    as



    $$i = n^-1y$$






    share|cite|improve this answer

























      up vote
      0
      down vote













      This follows from the fact that $n$ is invertible in the ring $mathbbZ_p$ so you can solve the equation



      $$ni = y$$



      as



      $$i = n^-1y$$






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        This follows from the fact that $n$ is invertible in the ring $mathbbZ_p$ so you can solve the equation



        $$ni = y$$



        as



        $$i = n^-1y$$






        share|cite|improve this answer













        This follows from the fact that $n$ is invertible in the ring $mathbbZ_p$ so you can solve the equation



        $$ni = y$$



        as



        $$i = n^-1y$$







        share|cite|improve this answer













        share|cite|improve this answer



        share|cite|improve this answer











        answered 2 days ago









        ploosu2

        3,982922




        3,982922






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2871759%2flet-p-be-prime-and-n-p-then-n-times-i-hits-every-residue-class-for%23new-answer', 'question_page');

            );

            Post as a guest
































































            Comments

            Post a Comment

            Popular posts from this blog

            What is the equation of a 3D cone with generalised tilt?

            Image
            Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite What is the equation of a 3D cone with generalized tilt? I've noticed that in most equations given to represent a cone, there is no parameter which defines the tilt of the cone in 3D space and that most of them have their point at the origin $(0,0,0)$ - I was wondering if anyone could give me a more generalized cone equation for a cone in any position in 3D space 3d share | cite | improve this question edited Jul 25 '16 at 0:05 ervx 9,425 3 13 36 asked Jul 24 '16 at 15:38 Charlene 11 2 2 Welcome to Math.SE! Could you please explain a few things to help people give an answer useful to you: 1. What do you mean by "generalized tilt"? 2. Are you asking about a right circular cone? Does the angle at the vertex matter? 3. What form of answer (implicit, parametric...?) are you looking for? 4. If this is homework, what tools do you have available, an...
            Read more

            Relationship between determinant of matrix and determinant of adjoint?

            Image
            Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite We are studying adjoints in class, and I was curious if there is a relationship between the determinant of matrix A, and the determinant of the adjoint of matrix A? I assume there would be a relationship because finding the adjoint requires creating a cofactor matrix and then transposing it. linear-algebra determinant adjoint-operators share | cite | improve this question asked Nov 17 '17 at 17:32 CluelessCoder 32 5 For a square matrix $A$ of order $n$, we have $A(operatornameadj A)=(operatornameadj A)A=|A|I_n$ where $I_n$ is the identity matrix of order $n$. This should tell you about the determinant of the adjoint in terms of that of $A$ (use multiplicative property and other elementary properties of determinants). – Prasun Biswas Nov 17 '17 at 17:35 1 @CluelessCoder: see here: math.stackexchange.com/questions/516127/…...
            Read more

            Color the edges and diagonals of a regular polygon

            Image
            Clash Royale CLAN TAG #URR8PPP up vote 5 down vote favorite 1 Here is the problem: For what $n$ is it possible to color the edges and diagonals of an $n$-side regular polygon with $dfracbinomn23$ colors, such that you use every color exactly three times and for every color the three segments (edges or diagonals) with that color form a triangle? Trivially $nequiv 0 text or 1 pmod3$. I can also prove that if the statement is true for $k$ than it is true for $3k$ as well. How to finish? Please help! Thanks combinatorial-geometry share | cite | improve this question edited Aug 6 at 21:57 alcana 118 4 asked Aug 6 at 21:15 Leo Gardner 356 11 Even assuming "polyhpn" in the title is a typo for polygon , it is unclear what you mean by "the edges and sides". Aren't the side of a regular polygon the same as the edges? A regular $n$-sided polygon has $n$ edges. – hardmath Aug 6 at 21:20 3 $n$ ne...
            Read more