
Shortcut Trick
Let the smaller number be y. The difference between the numbers is 3422, so x − y = 3422.
Applying the division rule: x = 4y + 290.
Substituting x gives: 3y + 290 = 3422 ⇒ 3y = 3132 ⇒ y = 1044.
The greater number x = 1044 + 3422 = 4466.
The HCF of 4466 and 4292 must be a factor of their difference (4466 − 4292 = 174).
Among the given options, only 58 divides 174 completely. Thus, HCF is 58.
∴ The correct answer is 58.

Alternate Method
Given:
Difference between the two positive numbers = 3422
When the greater number is divided by the smaller, Quotient = 4, Remainder = 290
Formula Used:
Dividend = (Divisor × Quotient) + Remainder
y y y y 290 Greater Number (x) y Smaller Number (y) Difference = 3y + 290 = 3422 HCF ( 4466 , 4292 ) = 58
Calculations:
⇒ Let the greater number be x and the smaller number be y.
⇒ x − y = 3422 --- (Equation 1)
⇒ x = 4y + 290 --- (Equation 2)
⇒ Substituting Equation (2) into Equation (1):
⇒ (4y + 290) − y = 3422
⇒ 3y + 290 = 3422
⇒ 3y = 3422 − 290
⇒ 3y = 3132
⇒ y = 1044
⇒ Finding the greater number (x):
⇒ x = 1044 + 3422 = 4466
⇒ Now, we must find the Highest Common Factor (HCF) of 4466 and 4292.
⇒ Using the difference method: Difference = 4466 − 4292 = 174
⇒ The HCF must be a factor of their difference (174).
⇒ We check the given options (148, 58, 116, 74) to see which one perfectly divides 174.
⇒ 174 ÷ 58 = 3. Only 58 is a perfect divisor of 174.
⇒ Therefore, the HCF is 58.
∴ The correct answer is 58.

Additional Information
Division Algorithm
For any given dividend and divisor, the relationship is firmly established as: Dividend = (Divisor × Quotient) + Remainder. The remainder must always be strictly less than the divisor.
HCF Difference Method
The Highest Common Factor (HCF) of two numbers is always a perfect divisor of the difference between those two numbers. If a > b, then HCF(a, b) will definitively divide perfectly into (a − b).
Prime Factorization for HCF
The HCF is the product of the lowest powers of shared prime factors. By identifying the factors of the difference (e.g., 174 = 2 × 3 × 29), we can quickly limit the potential candidates for the HCF without processing the primary large numbers individually.