-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProblem10.1.html
225 lines (205 loc) · 7.92 KB
/
Problem10.1.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
<html>
<head>
<title>
Project Euler, Problem 10: Summation of Primes (Primality Test)
</title>
<link rel="stylesheet" type="text/css" href="eulerStyle.css" />
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
</head>
<body>
<header>
<svg height="5rem" width="90vw">
<a href="https://dkallen78.github.io/Project-Euler-Files/projectEulerIndex.html">
<text id="euler" x="50%" y="50%" text-anchor="middle" dominant-baseline="middle">
Project Euler
</text>
</a>
</svg>
<br />
<svg height="4rem" width="90vw">
<a href="https://projecteuler.net/problem=10">
<text id="problemID" x="50%" y="50%" text-anchor="middle" dominant-baseline="middle">
Problem 10: Sumation of Primes
</text>
</a>
</svg>
</header>
<nav>
<svg height="3rem" width="75vw">
<a href="https://dkallen78.github.io/Project-Euler-Files/Problem10.html">
<text x="0%" y="50%" text-anchor="start" dominant-baseline="middle">
Problem 10 (Primality Test)
</text>
</a>
<a href="https://dkallen78.github.io/Project-Euler-Files/Problem11.html">
<text x="100%" y="50%" text-anchor="end" dominant-baseline="middle">
Problem 11
</text>
</a>
</svg>
</nav>
<main>
<p>
The sum of the primes below 10 is
<math>
<mn>2</mn>
<mo>+</mo>
<mn>3</mn>
<mo>+</mo>
<mn>5</mn>
<mo>+</mo>
<mn>7</mn>
<mo>=</mo>
<mn>17</mn>
</math>.
<br /><br />
Find the sum of all the primes below two million.
</p>
<button id="problem"onclick="projectEulerProblem10()">
Sum Primes
</button>
<br />
<summary id="notes">
<div>Runtime: <span id="totalTime">0</span></div>
<div>Average: <span id="avgTime">0</span> Runs: <span id="runs">0</span></div>
<div>SD: <span id="stdDev">0</span> ms</div>
<div class="red">Max: <span id="max">0</span></div>
<div class="green">Min: <span id="min">1000</span></div>
<p>
I used a seive of Eratosthenes to generate an array of primes up to 2,000,000.
<br /><br />
Then I added up all of the numbers in my array. This was much faster than
primality testing.
</p>
</summary>
</main>
</body>
<script>
let population = [];
function projectEulerProblem10() {
function display(totalTime, solution) {
//----------------------------------------------------//
//Displays the information to the window after the //
// program has run //
//float-> totalTime: time it took to run the program //
//----------------------------------------------------//
function getAvg(totalTime) {
//----------------------------------------------------//
//Calculates the average time to run the program //
//float-> totalTime: time it took to run the program //
//----------------------------------------------------//
let oldAvg = parseFloat(document.getElementById("avgTime").innerHTML, 10);
let oldIter = Number(document.getElementById("runs").innerHTML);
let newIter = oldIter + 1;
document.getElementById("runs").innerHTML = newIter;
let avgTime = ((oldAvg * oldIter) + totalTime) / newIter;
return avgTime.toFixed(3);
}
function getSD(average, population) {
//----------------------------------------------------//
//Calculates standard deviation of the runtimes //
//float-> average: average program runtime //
//array-> population: an array of runtimes //
//----------------------------------------------------//
average = Number(average);
let sum = 0;
for (let i = 0; i < population.length; i++) {
sum += (population[i] - average) ** 2;
}
sum /= population.length;
return Math.sqrt(sum).toFixed(3);;
}
population.push(totalTime);
//
//Display the solution
document.getElementById("problem").innerHTML = solution;
//
//Display the runtime
document.getElementById("totalTime").innerHTML = totalTime.toFixed(3) + " ms";
let average = getAvg(totalTime);
//
//Display the average
document.getElementById("avgTime").innerHTML = average + " ms";
//
//Display the standard deviation
document.getElementById("stdDev").innerHTML = getSD(average, population);
//
//Display the highest runtime
let max = parseFloat(document.getElementById("max").innerHTML, 10);
if (totalTime > max) {
document.getElementById("max").innerHTML = totalTime.toFixed(3) + " ms";
}
//
//Display the lowest runtime
let min = parseFloat(document.getElementById("min").innerHTML, 10);
if (totalTime < min) {
let minString = "";
if (totalTime === 0) {
minString = "< 0.020";
} else {
minString = totalTime.toFixed(3);
}
document.getElementById("min").innerHTML = minString + " ms";
}
//
//Display the explanatory notes
document.getElementById("notes").style.display = "block";
let summary = document.querySelector("summary").scrollHeight;
setTimeout(function() {
document.querySelector("summary").style.height = summary + "px";
}, 1);
}
const startTime = performance.now();
let limit = 2000000;
let primeNumbers = makePrimeArray(limit);
let sum = sumArray(primeNumbers);
const endTime = performance.now();
const totalTime = parseFloat((endTime - startTime).toFixed(3), 10);
display(totalTime, sum);
/*var endTime = new Date();
var totalTime = endTime - startTime;
document.getElementById("totalTime").innerHTML = totalTime + " ms";
document.getElementById("notes").style.display = "block";
document.getElementById("problem").innerHTML = sumArray(primeNumbers);*/
}
//
//Adds up all the numbers in an array
function sumArray(array) {
let sum = 0;
for (let i = 0; i < array.length; i++) {
sum += array[i];
}
return sum;
}
//
//This is my Seive of Eratosthenes. Input the limit
//to your list of primes and it will generate the list
function makePrimeArray(maxPrime) {
let primeNumberArray = [];
rootPrimeLimit = Math.floor(Math.sqrt(maxPrime));
primeNumberArray.length = (maxPrime + 1);
primeNumberArray.fill(true);
primeNumberArray[0] = false;
primeNumberArray[1] = false;
console.log(primeNumberArray);
for (let i = 2; i < rootPrimeLimit + 1; i++) {
if (primeNumberArray[i] === true) {
for (let j = 0; ((i * i) + (j * i)) < maxPrime + 1; j++) {
let k = ((i * i) + (j * i));
primeNumberArray[k] = false;
}
}
}
var finalPrimes = [];
for (let k = 0; k < primeNumberArray.length + 1; k++) {
if (primeNumberArray[k] === true) {
finalPrimes.push(k);
}
}
return finalPrimes;
}
</script>
</html>