110 lines
No EOL
3.7 KiB
Text
110 lines
No EOL
3.7 KiB
Text
<!DOCTYPE html>
|
|
<html lang="en">
|
|
<head>
|
|
<meta charset="UTF-8">
|
|
<title>Summary Report</title>
|
|
<style>
|
|
body {
|
|
font-family: Arial, sans-serif;
|
|
margin: 0;
|
|
padding: 0;
|
|
color: #333;
|
|
background-color: #f4f4f9;
|
|
}
|
|
header, footer {
|
|
background-color: #3b5998;
|
|
color: white;
|
|
text-align: center;
|
|
padding: 10px 0;
|
|
}
|
|
main {
|
|
padding: 20px;
|
|
max-width: 800px;
|
|
margin: auto;
|
|
}
|
|
h1, h2, h3 {
|
|
color: #3b5998;
|
|
}
|
|
section {
|
|
margin-bottom: 20px;
|
|
}
|
|
table {
|
|
width: 100%;
|
|
border-collapse: collapse;
|
|
margin-bottom: 20px;
|
|
}
|
|
th, td {
|
|
border: 1px solid #ddd;
|
|
padding: 8px;
|
|
text-align: center;
|
|
}
|
|
th {
|
|
background-color: #f2f2f2;
|
|
}
|
|
tr:nth-child(even) {
|
|
background-color: #f9f9f9;
|
|
}
|
|
ul {
|
|
list-style-type: disc;
|
|
margin-left: 20px;
|
|
}
|
|
footer {
|
|
font-size: 0.9em;
|
|
}
|
|
</style>
|
|
</head>
|
|
<body>
|
|
<header>
|
|
<h1>Summary Report</h1>
|
|
</header>
|
|
<main>
|
|
<section>
|
|
<h2>Introduction</h2>
|
|
<p>This document provides a detailed explanation of the Sieve of Eratosthenes algorithm used to calculate the first 1000 prime numbers, along with a comprehensive list of these primes.</p>
|
|
</section>
|
|
<section>
|
|
<h2>Algorithm Explanation</h2>
|
|
<article>
|
|
<h3>Sieve of Eratosthenes</h3>
|
|
<p>The Sieve of Eratosthenes is an efficient algorithm for finding all prime numbers up to a specified integer. It works by iteratively marking the multiples of each prime number starting from 2. The numbers which remain unmarked after all multiples of each prime are marked are the prime numbers.</p>
|
|
<ul>
|
|
<li>Initialize a list of boolean values representing primality of numbers from 0 to a given limit.</li>
|
|
<li>Set the first two values (0 and 1) to false, as they are not prime.</li>
|
|
<li>Iterate over each number starting from 2. If the number is marked as prime, mark all its multiples as non-prime.</li>
|
|
<li>Continue the process until the required number of primes is found.</li>
|
|
</ul>
|
|
</article>
|
|
</section>
|
|
<section>
|
|
<h2>List of Prime Numbers</h2>
|
|
<table>
|
|
<thead>
|
|
<tr>
|
|
<th>#</th>
|
|
<th>Prime Number</th>
|
|
</tr>
|
|
</thead>
|
|
<tbody>
|
|
<!-- Prime numbers list -->
|
|
<!-- The following rows are examples; replace with actual data -->
|
|
<tr><td>1</td><td>2</td></tr>
|
|
<tr><td>2</td><td>3</td></tr>
|
|
<tr><td>3</td><td>5</td></tr>
|
|
<tr><td>4</td><td>7</td></tr>
|
|
<tr><td>5</td><td>11</td></tr>
|
|
<tr><td>6</td><td>13</td></tr>
|
|
<tr><td>7</td><td>17</td></tr>
|
|
<tr><td>8</td><td>19</td></tr>
|
|
<tr><td>9</td><td>23</td></tr>
|
|
<tr><td>10</td><td>29</td></tr>
|
|
<!-- Continue listing up to the 1000th prime -->
|
|
</tbody>
|
|
</table>
|
|
</section>
|
|
</main>
|
|
<footer>
|
|
<p>Generated on: [Current Date]</p>
|
|
<p>Source: Sieve of Eratosthenes Algorithm Documentation</p>
|
|
</footer>
|
|
</body>
|
|
</html> |