OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Ciro Santilli
(
@cirosantilli,
36
)
Greatest common divisor
(GCD)
Home
Mathematics
Area of mathematics
Number theory
Prime number
0
Like
0 By others
on same topic
0 Discussions
Updated
2025-04-24
+
Created
1970-01-01
See my version
The "
greatest common divisor
" of two
integers
x
and
y
, denoted
gdc
(
x
,
y
)
is the largest
natural number
that divides both of the
integers
.
For example,
gdc
(
8
,
12
)
is
4
, because:
4
divides both
8
and 12
and this is not the case for any
number
larger than
4
. E.
g
.:
5
divides neither one
6
divides 12
7
divides neither
8
divides only
8
and so on.
Table of contents
Greatest common divisor algorithm
Greatest common divisor
Euclidean algorithm
Greatest common divisor
Extended Euclidean algorithm
Euclidean algorithm
Coprime
Greatest common divisor
Euler's totient function
Coprime
Totient summatory function
Euler's totient function
Greatest common divisor algorithm
0
0
0
Greatest common divisor
Euclidean algorithm
0
1
0
Greatest common divisor
Extended Euclidean algorithm
0
0
0
Euclidean algorithm
Coprime
0
0
0
Greatest common divisor
Two
numbers
such that the
greatest common divisor
is
1
.
Euler's totient function
(
φ
(
n
)
, varphi)
0
1
0
Coprime
TODO
wtf is
a
"totient"? Where else is that
word
used besides in this
concept
?
Totient summatory function
(
Φ
(
n
)
, uppercase phi)
0
1
0
Euler's totient function
Ancestors
(5)
Prime number
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(3)
Coprime
PROMYS Europe 2024 problem set
/
Set 2
/
Q1
PROMYS Europe 2024 problem set
/
Set 2
/
Q2
View article source
Discussion
(0)
Subscribe (1)
+
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
+
Create my own version