Question : Prove that 97 is prime. Solution : To prove 97 is prime. We know that if n>1 is composite then n has a prime divisor p that satisfies \[p\le\sqrt{n}\] Since 100 is composite so all the prime divisors…
Posted inNumber Theory
Question : Prove that 97 is prime. Solution : To prove 97 is prime. We know that if n>1 is composite then n has a prime divisor p that satisfies \[p\le\sqrt{n}\] Since 100 is composite so all the prime divisors…