00:01
All right, guys, so in this problem, we want to disprove a statement.
00:08
So we have the statement, you know, n squared minus n plus three is prime for all n.
00:25
All right.
00:26
So i'm going to disprove.
00:27
To disprove something, the easiest way to do it is find a counter example.
00:38
All right.
00:42
There we go all right so if we want to find a counter example we just got to put a number in for n and then the answer has to be um not prime so if we do a late let's try n equals zero so zero squared minus zero plus three equals three that's prime so we try n equals one one squared minus one plus 3, that equals 3 again, prime.
01:16
Well, maybe it's true.
01:18
N equals 2.
01:20
2 squared minus 2 plus 3.
01:24
That equals 5.
01:25
That is also prime.
01:29
But then we finally get to n equals 3...
