Posted inNumber Theory prove that 97 is prime Posted by By SK Math Expert July 1, 2021Posted 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… This Question has been answered. Please Login or Register to See The Answer Post navigation Previous Post coprime (definition and examples)Next Postprove that 37 is prime