## Blogs about: Greatest Common Divisor

#### Project Euler Problem#12 solution in C++

: The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle num … more →

#### Decided to put some coding on the blog itself

: Was reading through this blog and found  a nice quote “a program a day keeps skill degradation … more →

#### C++ - Fraction Class — 2 comments

: Daily Program for 5/1/2013: Today we will continue looking at C++ classes and operator overloading w … more →

#### Should we teach Euclid's Algorithm in the Secondary Curriculum?

: I can’t speak for every Mathematics graduate, or any graduate for that matter, but there … more →

#### 18. Common Factors, Greatest Common Factor. — 2 comments

: Common factors are factors two or more numbers have in common. Common factors of 28 and 36 are 1, 2, … more →

#### C - Least Common Multiple

: Daily Program for 4/7/2013: Let’s expand our knowledge base of fourth grade mathematics throug … more →

#### C - Greatest Common Divisor

: Daily Program for 4/6/2013: For today’s program, let’s implement a greatest common divis … more →

#### Calculate the gcd of more than two numbers

: You can use this python script. Download it and run it inside python interpretor or in terminal. Fol … more →

Tags: Algorithms, Python, GCD

: IMG_3416 (Photo credit: BjørnS) Fractions are everybody’s friends, or at least they can be.  T … more →

#### Lecture 1. Overview of the course

: CLAIM: This lecture note is based on design and analysis of algorithms presented by NPTEL, although … more →

#### RSA Keys - Lack Randomness

: A team of cryptographic experts has analysed more than 10 million public keys and discovered serious … more →

#### greatest common divisor

: The Greatest Common Divisor or gcd is the largest common factor between two numbers. In what follows … more →

#### "The first algorithm" — 1 comment

: Image via Wikipedia Euclid’s method of finding the highest common factor (or greatest common d … more →

#### Another example of a computer...

: Calculation of greatest common divisors is a quite complex problem for a digital computer, but not f … more →

#### Project Euler 005

: Problem: 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without … more →

#### UFDs (Pt. I) — 5 comments

: Point of Post: In this post we discuss the most general “nice integral domain”, unique f … more →

#### PIDs (Pt. II) — 2 comments

: Point of Post: This is a continuation of this post. We now would like to discuss the notion of great … more →

#### Mathematical primer, part 4

: After yesterday’s diversion on algebraic structures, we’re almost ready to move onto division. Subtr … more →

#### Compute the greatest common divisor of two ideals in ZZ[sqrt(-5)]

: Compute the greatest common divisor of the ideals and in . Recall that . Since , this ideal contains … more →

All →