What Does It Mean for k to Be a Square Modulo m?

  • Thread starter Thread starter stgermaine
  • Start date Start date
  • Tags Tags
    Square
Click For Summary
SUMMARY

The discussion centers on the mathematical concept of "k being a square modulo m." It is established that this means there exists an integer x such that the equation x² ≡ k (mod m) holds true. Participants confirm that understanding this definition is crucial for proving the related statement A. The conversation highlights the importance of modular arithmetic in cryptography and problem-solving.

PREREQUISITES
  • Understanding of modular arithmetic
  • Familiarity with quadratic residues
  • Basic knowledge of cryptography concepts
  • Ability to solve congruences
NEXT STEPS
  • Research the properties of quadratic residues in number theory
  • Learn about the Legendre symbol and its applications
  • Explore algorithms for solving modular equations
  • Study the role of modular arithmetic in cryptographic systems
USEFUL FOR

Students in mathematics or computer science, particularly those studying number theory, cryptography, or anyone needing to understand modular equations and their applications.

stgermaine
Messages
45
Reaction score
0
k is a square modulo m??

\:

Homework Statement


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.

Homework Equations


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?
 
Physics news on Phys.org


stgermaine said:
\:

Homework Statement


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.

Homework Equations





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?

Yes, that's what it means.
 

Similar threads

Solve the simultaneous congruence modulo equation
  • · Replies 3 ·
Replies
3
Views
3K
Number Theory (2) Homework: Find Integer Orders Modulo 19 & 17
  • · Replies 2 ·
Replies
2
Views
2K
Congruence and Primes: Proving the Order of an Integer Modulo a Prime
  • · Replies 4 ·
Replies
4
Views
2K
Chinese Remainder theorem for 2 congruences
  • · Replies 2 ·
Replies
2
Views
2K
What is the correct formula for the reduced Chi square?
  • · Replies 3 ·
Replies
3
Views
4K
Proving Least Positive Residue Using m-Cycle Permutations
  • · Replies 5 ·
Replies
5
Views
2K
Proving Dyadic Squares Interaction Rules
  • · Replies 1 ·
Replies
1
Views
2K
Congruence modulo m: Find Smallest Int Value
  • · Replies 1 ·
Replies
1
Views
5K
Help Taking the Limit as K goes to infinity
  • · Replies 14 ·
Replies
14
Views
3K
Is m the smallest order for an m-cycle in the symmetric group?
  • · Replies 3 ·
Replies
3
Views
1K