center sieve image

jakobkogler · jakobkogler · commit 711f294a030d · 2022-02-06T18:10:26.000+01:00
diff --git a/src/algebra/sieve-of-eratosthenes.md b/src/algebra/sieve-of-eratosthenes.md
@@ -13,7 +13,7 @@ And we continue this procedure until we processed all numbers in the row.
 
 In the following image you can see a visualization of the algorithm for computing all prime numbers in the range $[1; 16]$. It can be seen, that quite often we mark numbers as composite multiple times.
 
-![Sieve of Eratosthenes](sieve_eratosthenes.png)
+<center>![Sieve of Eratosthenes](sieve_eratosthenes.png)</center>
 
 The idea behind is this:
 A number is prime, if none of the smaller prime numbers divides it.
