Ask Question
7 November, 01:28

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.

+3
Answers (1)
  1. 7 November, 03:04
    0
    When n = 2, n^2-1 = 4-1 = 3, which is a prime number.
Know the Answer?
Not Sure About the Answer?
Get 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 there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers