description.md in trackler-2.1.0.25

- old
+ new

@@ -1,5 +1,6 @@
-Use the Sieve of Eratosthenes to find all the primes from 2 up to a given number.
+Use the Sieve of Eratosthenes to find all the primes from 2 up to a given
+number.
 
 The Sieve of Eratosthenes is a simple, ancient algorithm for finding all
 prime numbers up to any given limit. It does so by iteratively marking as
 composite (i.e. not prime) the multiples of each prime,
 starting with the multiples of 2.