What is the proof for divisibility of prime numbers?

  • Thread starter Thread starter andrew34765
  • Start date Start date
  • Tags Tags
    Divisibility Prime
Click For Summary
SUMMARY

The proof for the divisibility of prime numbers states that if a prime number P divides the product ab, then either a or b must also be divisible by P. This conclusion is derived from the fundamental properties of prime numbers, specifically that a prime cannot be expressed as a product of two different integers. The proof utilizes the concept of the greatest common divisor (gcd) and the properties of integer factorization, demonstrating that if P divides ab, it must be a factor of either a or b.

PREREQUISITES
  • Understanding of prime numbers and their properties
  • Knowledge of integer factorization
  • Familiarity with the concept of greatest common divisor (gcd)
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the properties of prime numbers in number theory
  • Learn about the Euclidean algorithm for calculating gcd
  • Explore integer factorization techniques and their applications
  • Investigate formal proofs in mathematics, particularly in number theory
USEFUL FOR

Mathematics students, educators, and anyone interested in number theory or proofs involving prime numbers will benefit from this discussion.

andrew34765
Messages
1
Reaction score
0

Homework Statement



a, b, P, and any other numbers introduced are members of the integer set.

If P is known to be a prime number, and ab can be divided by P, then prove that either a or b can be divided by P.

Homework Equations



All properties of real numbers. Need not be explicitly mentioned in the proof.

The Attempt at a Solution



ab=p*c such that the complete factorization of ab results in p multiplied by the complete factorization of c.

I don't know what to do from here.
 
Physics news on Phys.org
Assume that p does not divide b (if it does then we are done). Then gcd(p,b)=1 and so there exist integers x and y such that xp + yb = 1. Multiply through by a to get the equation xpa + yba = a
 
Multiplication does not introduce new factors to the product, it is just the addition of all pre-existing factors. Hence, if a*b can be divided by P, then the factor which enables this must be located in either a or b.

You probably want something a little more formal than that blurb though.

k

Edit: I re-read this and I don't think I was too clear, so I'll try to elaborate a little:
If you have a number X consisting of the factors a and b so that X = a * b, and a number Y consisting of the factors a and c so that Y = a * c, then the multiplication of X and Y is the same as putting all the factors together.

XY = aabc

When you perform this process of putting all the factors together, you are not creating any new factors, just combining those you already have. For the original question, this means that if ab is divisible by P, then the factors which makes ab divisible by P must be in either a or b, no new factor occur in the multiplication of the two.

Or, perhaps easier:

P is a prime. ab is divisible by P, and so ab must contain P as a factor. But P is prime, so P cannot be the product of two different integers (one part in a and one part in b), because that violates the definition of a prime number. So a or b must already contain P before the multiplication.
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
5
Views
3K
  • · Replies 32 ·
2
Replies
32
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
1
Views
2K