lgallet/epicours
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2023-09-25 23:36:18

Browse Source
This commit is contained in:
Louis Gallet
2023-09-25 23:36:18 +02:00
parent f1a9359db3
commit 00b4bc09a5
2 changed files with 21 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
.obsidian/workspace.json vendored
View File

@ -4,19 +4,15 @@
"type": "split",
"children": [
{
"id": "d1d0fb84c1c51d46",
"id": "778bfeed44403054",
"type": "tabs",
"children": [
{
"id": "2eaee722b622a4ab",
"id": "76bf6a235cb7a78d",
"type": "leaf",
"state": {
"type": "markdown",
"state": {
"file": "Algo/Séminaire/Exercices seminaire.md",
"mode": "source",
"source": false
}
"type": "empty",
"state": {}
}
}
]
@ -85,7 +81,6 @@
"state": {
"type": "backlink",
"state": {
"file": "Algo/Séminaire/Exercices seminaire.md",
"collapseAll": false,
"extraContext": false,
"sortOrder": "alphabetical",
@ -102,7 +97,6 @@
"state": {
"type": "outgoing-link",
"state": {
"file": "Algo/Séminaire/Exercices seminaire.md",
"linksCollapsed": false,
"unlinkedCollapsed": true
}
@ -124,9 +118,7 @@
"type": "leaf",
"state": {
"type": "outline",
"state": {
"file": "Algo/Séminaire/Exercices seminaire.md"
}
"state": {}
}
},
{
@ -156,13 +148,14 @@
"command-palette:Open command palette": false
}
},
"active": "2eaee722b622a4ab",
"active": "c473a791e2b34194",
"lastOpenFiles": [
"English",
"Algo/Séminaire/Exercices seminaire.md",
"Methodologie/Gestion.md",
"README.md",
"Algo/Séminaire/Remediation.md",
"COM-ADMR/Séjour international EPITA.md",
"Algo/Séminaire/Exercices seminaire.md",
"Algo/Séminaire/Chapter 5 - Recursivity.md",
"COM-ADMR",
"Methodologie",

14
Algo/Séminaire/Exercices seminaire.md
View File

@ -461,6 +461,18 @@ let prime n =
check n (k + 1)
in pr n 2;;
(* V2 *)
let prime n =
if n < 1 then
invalid_args "n should not be inferior to zero"
else if x = 2 then true
else
let rec pr n k =
if n = k then
true
else if n mod k = 0 then
false
else
check n (k + 1)
in (n = 2) || (n mod 2 = 1 and check n 3)
```