javascript_project_euler/index.html at master · muberko/javascript_project_euler · GitHub

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
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>Project Euler Questions</title>
</head>
<style type="text/css">
	h1 {
		font-family:Verdana, Geneva, sans-serif;
		text-align: center;
	}

	.Q{
		border:1px;
		border-style:solid;
		margin-top:5px;
	}

	.Q p{
		padding: 4px;
	}

	.Q form{
		float: left;
	}

</style>
<body>
	<h1> Project Euler </h1>
    <div class="Q">
    	<p>If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. <br/><br/> Find the sum of all the multiples of 3 or 5 below 1000</p>

        <input type="text" name="Q1" id="Q1_input" value="1000" />

        <button type="text" form="Question1" value="Submit" id="Q1Button">Submit</button>

	</div>
    <div class="Q">
    	<p>Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10<br/> terms will be: <br/><br/><span style="text-align:center;">1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</span> <br/><br/> By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-<br/>valued terms.</p>
        <input type="text" name="Q2" id="Q2_input" value = "4000000" />

        <button type= "text" form="Question2" id="Q2Button">Submit</button>

	</div>
    <div class="Q">
    	<p>The prime factors of 13195 are 5, 7, 13 and 29 <br/><br/> What is the largest prime factor of the number 600851475143?</p>

        <input type="text" name="Q3" id="Q3_input" value="600851475143" />

        <button type="text" form="Question3" value="Submit" id="Q3Button">Submit</button>

	</div>
    <div class="Q">
    	<p>A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. <br/><br/> Find the largest palindrome made from the product of two 3-digit numbers.</p>

        <input type="text" name="Q4" id="Q4_input" value="" />

        <button type="text" form="Question4" value="Submit" id="Q4Button">Submit</button>

	</div>
    <div class="Q">
    	<p>2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. <br/><br/>What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?</p>

        <input type="text" name="Q5" id="Q5_input" value="" />

        <button type="text" form="Question5" value="Submit" id="Q5Button">Submit</button>

	</div>
     <script src="scripts/myscript.js"></script>
</body>
</html>