-
Notifications
You must be signed in to change notification settings - Fork 36
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
67c7253
commit c5d6984
Showing
2 changed files
with
26 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
import Game.Levels.Hard.level_3 | ||
|
||
|
||
World "Hard" | ||
Level 3 | ||
Title "Twin Prime" | ||
|
||
LemmaTab "Hard" | ||
|
||
namespace MyNat | ||
|
||
Introduction | ||
" | ||
A twin prime is a pair of primes (2, 3), (41, 43) etc. that are 2 apart. The conjecture | ||
states that there are infinitley many such pairs. | ||
" | ||
|
||
LemmaDoc MyNat.Twin_Prime as "Twin_Prime" in "Hard" " | ||
`Twin_Prime` is the proof of disproof of the Twin Prime conjecture. | ||
" | ||
|
||
Statement Twin_Prime : | ||
(∀ M : ℕ), (∃ a b : ℕ), (a ≥ M) ∧ (b ≥ M) ∧ (a + 2 = b) ∧ (Prime a) ∧ (Prime b) := by sorry | ||
|