Multiple of prime p + multiple of (integer<p) = 1 proof?

  • Context: Graduate 
  • Thread starter Thread starter Jolb
  • Start date Start date
  • Tags Tags
    Multiple Prime Proof
Click For Summary
SUMMARY

The discussion focuses on proving the existence of integers a and b such that 1 = ax + bp, where p is a prime number and x is a positive integer less than p. It is established that since any integer less than p is relatively prime to p, there exists a solution for the equation. The proof hinges on the properties of prime numbers and the concept of linear combinations in number theory.

PREREQUISITES
  • Understanding of prime numbers and their properties
  • Familiarity with linear combinations in number theory
  • Knowledge of the concept of relative primality
  • Basic skills in algebraic manipulation
NEXT STEPS
  • Study the properties of prime numbers in number theory
  • Learn about the Extended Euclidean Algorithm for finding integer solutions
  • Explore the concept of linear Diophantine equations
  • Investigate applications of relative primality in cryptography
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in proofs involving prime numbers and integer solutions.

Jolb
Messages
417
Reaction score
29
Let p be a prime number and x be some positive integer less than p.

How do I prove that there exist integers a and b such that
1 = ax + bp
 
Physics news on Phys.org
Hint: compare what you have with what you need.
 
Since any term less than p is relatively prime to p, and thus has a solution of 1; it is easy to choose a desireable case.
 
Last edited:

Similar threads

Replies
48
Views
6K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 12 ·
Replies
12
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K