Fixes in html files and manifest from 2000

2000/bellard/README.md

@@ -20,7 +20,7 @@ its output is very specific, the internal FFT has a wide variety of uses.
 Can you modify this code to produce primes such as `23523*2^70000-1`,
 `48594^65536+1` or `6917!-1`?
 
-NOTE: as bigger primes are found as time goes by this program no longer prints
+**NOTE**: as bigger primes are found as time goes by this program no longer prints
 the biggest prime once noted by the author below.
 
 
@@ -32,7 +32,7 @@ Fourier Transform to compute this number in a reasonable amount
 of time (the usual method would take ages !).
 
 The program uses >= 64 bit `long long` type. It should run on any
-system with a gcc compiler.
+system with a `gcc` compiler.
 
 
 <!--

2000/bellard/index.html

@@ -416,7 +416,7 @@ Location: <a href="../../location.html#FR">FR</a> - <em>French Republic</em> (<e
 its output is very specific, the internal FFT has a wide variety of uses.</p>
 <p>Can you modify this code to produce primes such as <code>23523*2^70000-1</code>,
 <code>48594^65536+1</code> or <code>6917!-1</code>?</p>
-<p>NOTE: as bigger primes are found as time goes by this program no longer prints
+<p><strong>NOTE</strong>: as bigger primes are found as time goes by this program no longer prints
 the biggest prime once noted by the author below.</p>
 <h2 id="authors-comments">Author’s comments:</h2>
 <p>This program prints the biggest known prime number (<code>2^6972593-1</code>)
@@ -424,7 +424,7 @@ in base 10. It requires a few minutes. It uses a Modular Fast
 Fourier Transform to compute this number in a reasonable amount
 of time (the usual method would take ages !).</p>
 <p>The program uses &gt;= 64 bit <code>long long</code> type. It should run on any
-system with a gcc compiler.</p>
+system with a <code>gcc</code> compiler.</p>
 <!--
 
     Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.