Prove that if n is composite, then n has a prime divisor p satisfying p ≤ √n.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.4: Prime Factors And Greatest Common Divisor
Problem 5E: Prove that if p and q are distinct primes, then there exist integers m and n such that pm+qn=1.
icon
Related questions
Question

[Mathematical Cryptography] How do you solve this question?

Prove that if n is composite, then n has a prime divisor p satisfying p ≤√√n.
Transcribed Image Text:Prove that if n is composite, then n has a prime divisor p satisfying p ≤√√n.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer