Ask Question
22 October, 12:56

Prove that there exists a unique prime number of the form n2 - 1, where n is an integer that is greater than or equal to 2.

+5
Answers (1)
  1. 22 October, 13:24
    0
    When n = 2, n^2-1 = 4-1 = 3, which is a prime number.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Prove that there exists a unique prime number of the form n2 - 1, where n is an integer that is greater than or equal to 2. ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers