https://nottaro.github.io/littleroot/Articles/12-05-2023-spec-problems-i-could-solve-that-edward-couldnt/ #17
giscus
bot
Replies: 1 comment
-
|
Very cool |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
https://nottaro.github.io/littleroot/Articles/12-05-2023-spec-problems-i-could-solve-that-edward-couldnt/
go back$$\forall{n}\in \mathbb{N}; 2n^2-4n+31\in P$$ For this, we must show that there exists a natural number $n$ , such that $2n^2-4m+31$ is not a prime number, i.
Proof by Counterexample
https://nottaro.github.io/littleroot/Articles/12-05-2023-spec-problems-i-could-solve-that-edward-couldnt/
Beta Was this translation helpful? Give feedback.
All reactions