Answer:
5
Explanation:
. We are given: 5, 25
The methods to find the GCF of 5 and 25 are explained below.
Using Euclid's Algorithm
Prime Factorization Method
Long Division Method
As per the Euclidean Algorithm, GCF(X, Y) = GCF(Y, X mod Y)
where X > Y and mod is the modulo operator.
Here X = 25 and Y = 5
GCF(25, 5) = GCF(5, 25 mod 5) = GCF(5, 0)
GCF(5, 0) = 5 (∵ GCF(X, 0) = |X|, where X ≠ 0)
Therefore, the value of GCF of 5 and 25 is 5.