# K is a square modulo m?

1. Feb 3, 2013

### stgermaine

k is a square modulo m?!?!

\:1. The problem statement, all variables and given/known data
This is a portion of the problem. I have to prove that A holds if and only if k is a square modulo m.

I have no idea what "k is a square modulo m" means.

2. Relevant equations

3. The attempt at a solution
I've looked it up online and found some PDF's on cryptography.l
My best guess is that "k is a square modulo m" means $x^{2} \equiv k \: (mod\:m)$ has a solution x.

Is that right?

2. Feb 3, 2013

### Dick

Re: k is a square modulo m?!?!

Yes, that's what it means.