Question
Find two consecutive positive integers such that the sum of their squares is 365.
Solution — Step by Step
Let the two consecutive positive integers be and . We always choose the smaller one as — this keeps the algebra clean.
Sum of squares equals 365:
Expand :
Subtract 365 from both sides:
Divide the entire equation by 2 — this is the step most students skip, making the numbers unnecessarily large:
We need two numbers that multiply to and add to . Think of factor pairs of 182: , , , .
Since , the split is and :
So or .
The question asks for positive integers, so is rejected.
Therefore , and the two consecutive integers are 13 and 14.
Verification: ✓
Why This Works
When we say “consecutive integers”, we’re looking at numbers that differ by exactly 1 — like 4 and 5, or 99 and 100. Representing them as and captures this relationship algebraically.
The quadratic we get, , will always have one positive and one negative root when the constant term is negative. The negative root is a valid mathematical solution, but it’s physically meaningless here since we need positive integers. Rejecting it isn’t arbitrary — it’s enforcing the condition stated in the problem.
Dividing by 2 early is a power move. Smaller coefficients mean smaller numbers to factorise, which reduces errors in the middle-school arithmetic where most marks slip away.
Alternative Method — Quadratic Formula
If factorisation doesn’t click immediately, use the formula directly on .
Here , , :
is worth recognising. appears often in CBSE quadratic problems. Memorising perfect squares up to 30 saves roughly 45 seconds per problem in board exams.
Taking the positive root: .
Same answer, different route.
Common Mistake
Forgetting to divide by 2 before factorising. Students often try to factorise directly, hunting for factors of (that’s ). This is harder and error-prone. Always simplify by dividing out any common factor across all three terms first — here, dividing by 2 converts the problem from “factors of 728” to “factors of 182”, which is far more manageable.