{% extends 'main_index.html' %}
{% block MDesc %}
GCD/greatest common divisor of two numbers.We calculate these by choosing greatest common divisor of two number.But we
can calculate these using EUCLEDAN
approach.
{% endblock %}
{% block MKW %}GCD calculator,gcd evaluator,gcd calculator of two numbers{% endblock %}
{% block Mr %}
25/12/2020
{% endblock %}
{% block MAut %}
Amar khamkar
{% endblock %}
{% block title %}GCD calculator
{% endblock %}
{% block body %}
<style>

</style>
<div class="container text-light">

  <div class="row ">

    <div class="col-md-7 my-4 " style="background-color:rgb(30,30,30);
    box-shadow:13px 4px 19px 7px rgb(19 17 17);">
      <div class="my-4 ">
        <h1 class="text-center ">GCD calculator</h1>
        <hr class='bg-dark'>
        <h3 class="my-4 text-center">What is GCD?</h3>
        <p class="text-monospace my-4">GCD/greatest common divisor of two numbers,We calculate these by choosing
          greatest common divisor of two
          number In mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is
          the largest positive integer that
          divides each of the integers. For two integers x, y, the greatest common divisor of x and y is denoted
          gcd(x,y).</p>
          <hr class="bg-dark">
          <div class="my-2"  style="border:3px solid #2b2929;border-radius: 10px;">
          <form class="container">
         
          <div class="form-group my-4" >
            <label for="">Enter 1st number</label>
            <input type="number" style="color: white;
            background-color: #191717;
            border: 3px solid black;
            border-radius: 15px;" class="form-control" placeholder="1st no" id="FirstNo" required>
            
          </div>
          <div class="form-group">
            <label for="">Enter 2nd number</label>
            <input type="number" style="color: white;
            background-color: #191717;
            border: 3px solid black;
            border-radius: 15px;" class="form-control" placeholder="2nd no" id="SecondNo" required>
          </div>
          
          <button type="submit" class=" btn btn-outline-secondary text-light cal">Calculate</button>
        </form>
        <p class="text-center my-3 mb-3" id="ans"></p>
        
      </div>
        <h3 class="my-3 ">How to calculate GCD?</h3>
        <p class="text-monospace my-4"> We can calculate these using EUCLEDAN
          approach.The Euclid's algorithm (or Euclidean Algorithm) is a method for efficiently finding the greatest
          common divisor (GCD) of
          two numbers. The Euclidean algorithm is one of the oldest algorithms in common use.
          The GCD of two integers X and Y is the largest integer that divides both of X and Y (without leaving a
          remainder). Greatest Common
          Divisor is, also, known as greatest common factor (gcf), highest common factor (hcf), greatest common measure
          (gcm) and highest common divisor. </p>
       

       

      </div>
    </div>
    <div class="col-md-4 my-4 ">
    
      <div class="col p-4 d-flex flex-column position-static "  style="background-color:rgb(30,30,30);
      box-shadow:13px 4px 19px 7px rgb(19 17 17);">
      <h4 class="mb-2 ">Calculators</h3>
        {% for link in link_string1 %}
        <li class="my-2"><a href="{{link.0}}">{{link.1}}</a></li>
        {% endfor %}
        </div>
        <div class="col my-3 p-4 d-flex flex-column position-static "  style="background-color:rgb(30,30,30);
    box-shadow:13px 4px 19px 7px rgb(19 17 17);">
    <h4 class="my-2">Converters</h3>
    {% for link in link_string2 %}
    <li class="my-2"><a href="{{link.0}}">{{link.1}}</a></li>
     {% endfor %}
        
            
          </div>
          </div>
          
       
        </div>
  </div>
</div>
  {% endblock %}
  {% block JS %}
  <script>

    $('.cal').click(function (e) {
      var n1 = document.getElementById('FirstNo').value;
      var n2 = document.getElementById('SecondNo').value;
      var hcf;
      if ((n1 == "") || (n2 == "") || (n1 == "" && n2 == "")) {
        document.getElementById('ans').innerHTML = "Enter input";
      }
      else {
        for (let i = 1; i <= n1 && i <= n2; i++) {

          // check if is factor of both integers
          if (n1 % i == 0 && n2 % i == 0) {
            hcf = i;
          }
        }
        document.getElementById('ans').innerHTML = "GCD of " + n1 + " & " + n2 + " is  " + '<h4 class="text-danger" >' + hcf + '</b>';
      }
      e.preventDefault();
    });
  </script>
  {% endblock %}