forked from 0xvashishth/CalcHub
-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
50 lines (50 loc) · 1.73 KB
/
index.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
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>Euclidean Algorithm Calculator</title>
<link href="style.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div class="container">
<h1>Euclidean Algorithm</h1>
<p>
The Euclidean algorithm is an efficient method for computing the
greatest common divisor (GCD) of two integers, the largest number that
divides them both without a remainder. <br />The LCM of two numbers can
be futher computed in Euclid's approach by using GCD of A and B by -
LCM(A, B) = (a * b) / GCD(A, B).
</p>
<form class="form-container">
<div class="inp-container">
<div class="values">
<label name="val1"> VALUE 1 </label>
<input type="number" class="num1" placeholder="num1" min="1" />
</div>
<div class="values">
<label name="val2"> VALUE 2 </label>
<input type="number" class="num2" placeholder="num2" min="1" />
</div>
</div>
<button type="submit" class="submit">CALCULATE</button>
</form>
<h2 class="gcd-final">
GCD(
<span class="n1"></span>
,
<span class="n2"></span>
) =  <span class="gcd"></span>
</h2>
<h2 class="lcm-final">
LCM(
<span class="n3"></span>
,
<span class="n4"></span>
) =  <span class="lcm"></span>
</h2>
</div>
<script type="text/javascript" src="app.js"></script>
</body>
</html>