From 79cc8325c0b9a950ad6e264b561eaba8dd34af38 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Aur=C3=A9lien=20Buxant?=
 <aurelien.buxant@student.uclouvain.be>
Date: Wed, 6 May 2020 11:26:19 +0200
Subject: [PATCH] Update README.md

---
 README.md | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/README.md b/README.md
index a7dbba2..dad12dc 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,7 @@
-#README Groupe Q6
-# Par Giovanna Stefanelli, Lucas Bosmans, Aurélien Buxant et Yohan Burignat
-Programme: "fact"
+# README Group Q6
+# Authors Giovanna Stefanelli, Lucas Bosmans, Aurélien Buxant and Yohan Burignat
+
+Program: "fact"
 
 ## TABLE OF CONTENTS
 * [0. General Info]
@@ -148,8 +149,8 @@ As drawn in the scheme of the "Programme General Architecture" the programme
 	because the function "is_prime" is more cpu time demanding.
 -> bool is_prime(unsigned long nbr)
 	This function determines if a number is prime. To speed up the 
-	computation, the algorithm is based on the "Crible d'Ératosthène"
-	(see "https://fr.wikipedia.org/wiki/Nombre_premier")
+	computation, the algorithm is based on the "Sieve of Eratosthenes"
+	(see "https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes")
 -> bool is_div(unsigned long numbr, unsigned long i)
 	This function exploits the operator "%" (modulo) to determine if
 	a number has a divider.
-- 
GitLab