Recent content by Terry1

  1. T

    MHB Can GCD of m and n be forced to equal 1 for given equations and conditions?

    Hi PaulRS, Thanks for your reply. I did forget to mention that I am only dealing with integers, but I think that is clear from the post. Maybe I should have put it in the Number Theory sub-forum. I'm not sure if you understood my question correctly as I'm not putting forward a hypothesis...
  2. T

    MHB Can GCD of m and n be forced to equal 1 for given equations and conditions?

    Hi, I have 2 equations... m = x + y + 1 n = x - y where x > y > 0 I have 2 requirements of the above m and n must be of opposite parity (which they are) and I also require GCD(m, n) = 1, i.e. coprime. Is there a way of selecting x and y so this condition is met? For example, if I let x =...
  3. T

    MHB Can someone give a simple explanation of quadratic residues?

    Thanks kaliprasad. Let's see if I have understood correctly... From what you explained would I be right in saying {0, 1, 3, 4, 9, 10, 12} are quadratic residues MOD 13 and {0, 1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18} are quadratic residues MOD 23? Many thanks, Terry
  4. T

    MHB Can someone give a simple explanation of quadratic residues?

    Hi, This is not coursework, just private study. Ok, I understand that q is a quadratic residue MOD n if x^2 = q MOD n What I don't understand is how to figure this out? I read a paper that states "8 is a quadratic residue mod 17, since 5^2 = 8 MOD 17", fair enough. It then goes on to state...
Back
Top