Finding the Highest Common Factor of 36 and 90: A Step‑by‑Step Guide
When two numbers share a common factor, that factor is a divisor of both numbers. On top of that, the highest common factor (HCF), also called the greatest common divisor (GCD), is the largest such divisor. In everyday math, knowing how to find the HCF of numbers like 36 and 90 is useful for simplifying fractions, solving word problems, or understanding number theory. This guide walks you through the process, explains why it works, and offers quick tricks to speed up the calculation.
What Is the Highest Common Factor?
The highest common factor of two integers is the greatest integer that divides both numbers without leaving a remainder. To give you an idea, the HCF of 12 and 18 is 6, because 6 divides both 12 (12 ÷ 6 = 2) and 18 (18 ÷ 6 = 3), and no larger integer shares that property Worth knowing..
Finding the HCF is essential in:
- Simplifying fractions (e.g., 36/90 = 2/5 after dividing numerator and denominator by 18).
- Solving problems that involve ratios or common multiples.
- Working with algebraic expressions that require factorization.
Methods to Find the HCF
There are several reliable techniques to calculate the HCF of two numbers. Below are the most common approaches, each illustrated with 36 and 90 Worth keeping that in mind. But it adds up..
1. Prime Factorization
Step 1: Factor each number into primes.
- 36 = 2 × 2 × 3 × 3 = 2² × 3²
- 90 = 2 × 3 × 3 × 5 = 2 × 3² × 5
Step 2: Identify common prime factors, using the lowest power of each that appears in both factorizations.
- Common primes: 2¹ (since 36 has 2² but 90 has only 2¹) and 3² (both have at least 3²).
- Multiply them: 2¹ × 3² = 2 × 9 = 18.
Result: HCF(36, 90) = 18 No workaround needed..
Why it works: Prime factorization breaks each number into its basic building blocks. The shared blocks that appear in both numbers, taken with the lowest multiplicity, form the largest number that divides both Took long enough..
2. Euclidean Algorithm (Division Method)
The Euclidean algorithm is a fast, recursive method that relies on repeated division It's one of those things that adds up..
Procedure:
- Divide the larger number by the smaller one and keep the remainder.
- Replace the larger number with the smaller one, and the smaller number with the remainder.
- Repeat until the remainder is 0. The last non‑zero remainder is the HCF.
Applying to 36 and 90:
| Step | Dividend | Divisor | Quotient | Remainder |
|---|---|---|---|---|
| 1 | 90 | 36 | 2 | 18 |
| 2 | 36 | 18 | 2 | 0 |
The remainder has reached 0. The last non‑zero remainder is 18.
Result: HCF(36, 90) = 18.
Why it works: This method is grounded in the fact that the set of common divisors of two numbers is unchanged if we replace the larger number with its remainder when divided by the smaller number. It converges quickly because remainders shrink rapidly The details matter here..
3. Listing Common Divisors
A straightforward, though less efficient, way is to list all divisors of each number and find the greatest common one.
- Divisors of 36: 1, 2, 3, 4, 6, 9, 12, 18, 36
- Divisors of 90: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90
Common divisors: 1, 2, 3, 6, 9, 18.
Highest: 18.
Why it works: By definition, the HCF is the largest number that appears in both lists of divisors.
Quick Check: Does 18 Really Divide Both Numbers?
- 36 ÷ 18 = 2 (no remainder)
- 90 ÷ 18 = 5 (no remainder)
Since both divisions are exact, 18 is indeed a common factor. No larger number can divide both because 18 is the product of all shared prime factors.
Why Knowing the HCF Is Useful
-
Simplifying Fractions
- 36/90 → divide numerator and denominator by 18 → 2/5.
- The resulting fraction is in its simplest form.
-
Solving Ratio Problems
- If two groups share a ratio of 36:90, simplifying to 2:5 helps interpret the relationship more clearly.
-
Finding Least Common Multiples (LCM)
- The formula LCM(a, b) = (a × b) / HCF(a, b).
- For 36 and 90: LCM = (36 × 90) / 18 = 180.
-
Algebraic Simplification
- When factoring polynomials or simplifying expressions, recognizing common factors reduces complexity.
Frequently Asked Questions
Q1: Can the HCF be negative?
A1: The HCF is conventionally defined as a positive integer, because divisibility is considered in the positive sense. If you include negative numbers, the HCF remains positive; the negative counterpart is simply the negative of the HCF Small thing, real impact..
Q2: What if one number is zero?
A2: By convention, the HCF of any non‑zero integer n and 0 is |n|. Since every number divides 0, the greatest common divisor is the absolute value of the non‑zero number.
Q3: How does the Euclidean algorithm scale for large numbers?
A3: It remains efficient even for very large integers because each step reduces the size of the numbers dramatically. On modern computers, the algorithm runs in logarithmic time relative to the number of digits.
Q4: Is there a visual way to understand HCF?
A4: Think of each number as a set of prime “building blocks.” The HCF is the biggest block that both sets share. Visualizing the blocks overlapping helps internalize the concept.
Practice Problems
-
Find the HCF of 48 and 180.
Solution: Prime factors: 48 = 2³ × 3; 180 = 2² × 3² × 5. Common: 2² × 3 = 12.
Answer: 12 Turns out it matters.. -
Compute the LCM of 36 and 90 using the HCF.
Solution: LCM = (36 × 90) / 18 = 180.
Answer: 180 Small thing, real impact.. -
Simplify the fraction 144/198.
Solution: HCF(144, 198) = 18. 144 ÷ 18 = 8; 198 ÷ 18 = 11.
Answer: 8/11.
Conclusion
Determining the highest common factor of 36 and 90—or any pair of integers—relies on fundamental number‑theoretic principles. Whether you choose prime factorization, the Euclidean algorithm, or a simple listing of divisors, the result is the same: 18. Plus, mastering these techniques not only sharpens your arithmetic skills but also equips you with tools for simplifying fractions, solving ratio problems, and exploring deeper mathematical concepts. Keep practicing with different numbers, and the process will become second nature Turns out it matters..
Understanding the relationship between fractions and their simplified forms is a cornerstone of mathematical proficiency. In this context, reducing a fraction to its simplest representation ensures clarity and precision, especially when working with ratios or proportions. On top of that, the process highlights the importance of prime factorization and the greatest common divisor, reinforcing how foundational concepts interlink. By mastering these skills, learners can tackle more complex problems with confidence. Still, the next time you encounter a fraction, remember that simplifying it correctly opens the door to deeper insights and accurate solutions. This seamless integration of theory and practice not only strengthens your problem‑solving abilities but also builds a solid foundation for advanced studies. Conclusion: Embrace the process of simplification, and you’ll find clarity in every calculation Still holds up..
Equipped with a reliable method for finding the HCF, you can extend the same logic to polynomials, where the Euclidean algorithm works almost identically. On top of that, this bridges elementary arithmetic to algebraic structures, revealing that divisibility and factorization are universal themes across number systems. Beyond that, the efficiency of the algorithm underpins modern cryptographic protocols, where large primes and their residues secure digital communication. By seeing these connections, the act of simplifying a fraction becomes more than routine calculation—it becomes a window into how structure governs complexity.
In practice, maintaining this perspective helps avoid errors when scaling problems upward or across disciplines. Checking intermediate steps, verifying parity and digit sums, and confirming that quotients remain integers all reinforce accuracy without sacrificing speed. Over time, these habits cultivate a mindset that values both rigor and adaptability, allowing you to move fluidly between concrete computation and abstract reasoning.
Conclusion: Treat every exercise not as an isolated task but as a chance to refine a durable toolkit—one that serves you from basic fractions to sophisticated proofs—so that clarity in calculation naturally leads to insight in every mathematical endeavor.
