Finding Square Roots and Cube Roots: Quick Methods for Aptitude
Master the last-digit trick, Babylonian method, and prime factorisation for square and cube roots, with 10 worked placement examples.
Square and cube root questions appear in every placement aptitude test, and most of them reduce to one of five or six techniques once you know which to apply.
This article covers five methods for square roots and four for cube roots, with worked examples and a test-day decision guide.
Where These Questions Appear
Placement aptitude sections at TCS, Infosys, Wipro, and HCL typically include quantitative reasoning with three question formats that involve roots:
- Direct computation — “Find √3844” or “Find ∛314432”. The fastest methods here are the last-digit trick combined with estimate-and-bracket.
- Equation solving — “If (0.0169x)^0.5 = 1.3, find x”. These require recognising the root structure and squaring both sides.
- LCM-based perfect square — “Find the smallest perfect square divisible by 21, 36, and 66”. These require prime factorisation.
Knowing which type you’re looking at saves the first 10 seconds. The methods below are ordered from fastest to slowest. Use the simplest one that works.
Square Root Methods
Method 1: Perfect-Square Recognition
Memorise perfect squares from 1 to 30. This table covers the range most aptitude tests use:
| n | n² | n | n² | n | n² |
|---|---|---|---|---|---|
| 1 | 1 | 11 | 121 | 21 | 441 |
| 2 | 4 | 12 | 144 | 22 | 484 |
| 3 | 9 | 13 | 169 | 23 | 529 |
| 4 | 16 | 14 | 196 | 24 | 576 |
| 5 | 25 | 15 | 225 | 25 | 625 |
| 6 | 36 | 16 | 256 | 26 | 676 |
| 7 | 49 | 17 | 289 | 27 | 729 |
| 8 | 64 | 18 | 324 | 28 | 784 |
| 9 | 81 | 19 | 361 | 29 | 841 |
| 10 | 100 | 20 | 400 | 30 | 900 |
Direct look-up is faster than any algorithm. If the number isn’t in this table, move to Method 2.
Method 2: Last-Digit Trick
A perfect square’s last digit narrows its root to at most two candidates:
| Square ends in | Root ends in | Square ends in | Root ends in |
|---|---|---|---|
| 0 | 0 | 5 | 5 |
| 1 | 1 or 9 | 6 | 4 or 6 |
| 4 | 2 or 8 | 9 | 3 or 7 |
Numbers ending in 2, 3, 7, or 8 are not perfect squares. Use this to eliminate trap options instantly.
Method 3: Estimate-and-Bracket (Pair Trick for 4-5 Digit Numbers)
For a 4-digit perfect square:
- Step 1: Group digits in pairs from the right. For 2209: pairs are 22 and 09.
- Step 2: Find the largest integer n where n² is
<=the left pair. For 22: 4²=16 and 5²=25, so n=4. The root’s tens digit is 4. - Step 3: The last digit of the right pair (09 ends in 9) tells you the root ends in 3 or 7.
- Step 4: Try both: 43 or 47. Since 45²=2025 and 2209 > 2025, the answer is the larger candidate: 47.
Method 4: Vargamula (Vedic Two-Part Method)
The Vedic Vargamula approach for 4-digit numbers is essentially the pair trick stated differently:
- Separate the number into the last two digits and the rest. For 3844: “38” and “44”.
- Find n such that n²
<=38. That gives n=6 (6²=36, 7²=49). Tens digit = 6. - Last pair “44” ends in 4, so root ends in 2 or 8.
- Test: 62² = 3844 or 68²? Since 65²=4225 > 3844, the root must be 62.
Method 5: Long Division Method
For non-perfect squares where you need an approximate decimal answer, the long division method works reliably. Group digits in pairs from the decimal point outward, then build the root digit by digit. This is covered in NCERT Class 8 and described in detail at Wikipedia’s treatment of square root computation methods. For timed placement tests, this method is too slow for direct computation. Reserve it for the rare question that asks for a two-decimal approximation.
Method 6: Newton’s Iteration (Babylonian Method)
The Babylonian method, also called Newton’s iteration for square roots, converges quickly:
- Start with an initial guess x₀ (any integer close to the expected root).
- Each step: x_new = (x + n / x) / 2, where n is the number.
- Repeat until two consecutive values agree to the required precision.
For a placement test, two iterations are usually enough:
- To find √50: start with x=7 (since 7²=49).
- Step 1: x₁ = (7 + 50/7) / 2 = (7 + 7.14) / 2 = 7.07
- Step 2: x₂ = (7.07 + 50/7.07) / 2 ≈ 7.071
This is useful for non-perfect-square approximations, and it’s the same algorithm behind every scientific calculator’s root function.
Cube Root Methods
Method 1: Perfect-Cube Recognition (Table of Cubes 1 to 10)
| n | n³ |
|---|---|
| 1 | 1 |
| 2 | 8 |
| 3 | 27 |
| 4 | 64 |
| 5 | 125 |
| 6 | 216 |
| 7 | 343 |
| 8 | 512 |
| 9 | 729 |
| 10 | 1000 |
These ten values cover every 6-digit cube root question, since numbers between 1000 and 1000000 have roots between 10 and 100.
Method 2: Last-Digit Map for Cube Roots
Unlike square roots (where two last-digit candidates exist), cube roots have a unique last-digit mapping. Each last digit of the cube maps to exactly one last digit of the root, as detailed in Wikipedia’s cube root article:
| Cube ends in | Root ends in |
|---|---|
| 0 | 0 |
| 1 | 1 |
| 2 | 8 |
| 3 | 7 |
| 4 | 4 |
| 5 | 5 |
| 6 | 6 |
| 7 | 3 |
| 8 | 2 |
| 9 | 9 |
Note the pairs: digits 2 and 8 swap (2↔8); digits 3 and 7 swap (3↔7). All others are self-mapping. Getting the cube root last digit right is the single most error-prone step: the self-mapping digits (0, 1, 4, 5, 6, 9) feel natural, but the swapped pairs (2→8, 7→3, etc.) need deliberate memorisation.
Method 3: Estimate-and-Bracket for 6-Digit Cubes
For a 6-digit perfect cube, split the number after the third digit from the right:
- Take the first group (left of the split) and find the largest integer n where n³ is
<=that group. That gives the tens digit. - Use the last-digit map to get the units digit.
- Result: tens digit combined with units digit.
Method 4: Prime Factorisation
For numbers like 2197, factorising directly is sometimes faster than any trick:
- Divide repeatedly: 2197 / 13 = 169, 169 / 13 = 13, 13 / 13 = 1.
- 2197 = 13³, so ∛2197 = 13.
This method also handles LCM-based questions and fraction cubes efficiently.
Worked Examples
Square root examples
-
Example 1: √2209
- Last digit 9 → root ends in 3 or 7.
- 40² = 1600, 50² = 2500. Root is in the 40s.
- 45² = 2025. Since 2209 > 2025, the root is 47.
- Verify: 47² = (40+7)² = 1600 + 560 + 49 = 2209. ✓
-
Example 2: √3844
- Last digit 4 → root ends in 2 or 8.
- 60² = 3600, 70² = 4900. Root is in the 60s.
- 65² = 4225. Since 3844
<4225, root is 62. - Verify: 62² = (60+2)² = 3600 + 240 + 4 = 3844. ✓
-
Example 3: Solve (0.0169x)^0.5 = 1.3
- Square both sides: 0.0169x = 1.69
- x = 1.69 / 0.0169 = 100. ✓
-
Example 4: Algebraic — find (4a² − 4a + 1)^0.5 + 3a where a = 0.1039
- Recognise: 4a² − 4a + 1 = (2a − 1)²
- Since a = 0.1039 is less than 0.5, (2a − 1) is negative, so its absolute value is (1 − 2a).
- Expression becomes: (1 − 2a) + 3a = 1 + a = 1 + 0.1039 = 1.1039. ✓
Cube root examples
-
Example 5: ∛389017
- Last digit 7 → cube root ends in 3.
- Split: 389 | 017. Find n where n³
<=389. 7³=343, 8³=512. So tens digit = 7. - Answer: 73.
- Verify: 73² = 5329; 5329 × 73 = 373030 + 15987 = 389017. ✓
-
Example 6: ∛314432
- Last digit 2 → cube root ends in 8.
- Split: 314 | 432. Find n where n³
<=314. 6³=216, 7³=343. So tens digit = 6. - Answer: 68.
- Verify: 68² = 4624; 4624 × 68 = 277440 + 36992 = 314432. ✓
-
Example 7: ∛2197
- 2197 = 13 × 13 × 13.
- Answer: 13. ✓
-
Example 8: ∛0.000216
- Write as 216 / 1000000.
- ∛216 = 6; ∛1000000 = 100.
- Answer: 6/100 = 0.06. ✓
Mixed Practice Problems
-
Problem 1: Smallest perfect square divisible by 21, 36, and 66
- Step 1: Factorise each. 21 = 3 × 7; 36 = 2² × 3²; 66 = 2 × 3 × 11.
- Step 2: LCM = 2² × 3² × 7 × 11 = 4 × 9 × 7 × 11 = 2772.
- Step 3: In 2772, primes 7 and 11 each appear once (odd power). Multiply by 7 × 11 = 77.
- Step 4: 2772 × 77 = 213444.
- Verify: √213444 = 2 × 3 × 7 × 11 = 462; 462² = 213444. ✓
-
Problem 2: A school wants to seat 2410 students in a perfect square arrangement, but finds 9 are left over. How many students per row?
- 2410 − 9 = 2401 students in the square.
- √2401 = 49 (since 49² = 2401).
- Answer: 49 students per row.
Test-Day Decision Guide
| Situation | Best method | Typical time |
|---|---|---|
| Number is in 1 to 900 range | Direct look-up from memory | 3 seconds |
| 4-5 digit number, last digit is 2, 3, 7, or 8 | Eliminate — not a perfect square | 2 seconds |
| 4-5 digit perfect square | Last-digit + estimate-and-bracket | 15 seconds |
| 6-digit perfect cube | Last-digit map + bracket | 15 seconds |
| Equation with square root | Isolate and square both sides | 20 seconds |
| LCM/GCD-based perfect square | Prime factorisation | 30 to 45 seconds |
| Non-perfect square, decimal needed | Newton’s iteration (2 steps) | 40 seconds |
The general rule: go through the table top to bottom and stop at the first row that applies. Most placement test root questions fall in the first four rows, covering methods that take under 20 seconds.
One detail that trips students up with applied arithmetic in aptitude questions: the cube root last-digit map and the square root last-digit map are different rules. Don’t conflate them. For squares, two candidates exist (ends in 9 → root ends in 3 or 7). For cubes, the mapping is one-to-one. More standard aptitude shortcuts follow similar confirm-then-narrow logic.
Newton’s iteration covered above is the same algorithm Python’s math.sqrt and every scientific calculator implement internally. If you want to build and test that function yourself, or understand how numerical AI systems handle root-finding tasks, TinkerLLM (₹299 for 30 days) is where students implement these methods in Python and run them against randomised inputs, moving from aptitude prep into practical programming.
Primary sources
Frequently asked questions
Can a perfect square end in 8?
No. Perfect squares can only end in 0, 1, 4, 5, 6, or 9. Any number ending in 2, 3, 7, or 8 is not a perfect square — useful for eliminating answer options instantly.
What is the cube root of 0.000216?
0.06. Write 0.000216 as 216/1000000. The cube root of 216 is 6, and the cube root of 1000000 is 100. So the answer is 6/100 = 0.06.
How do I find the square root of a 4-digit perfect square quickly?
Group digits in pairs from the right. Find the largest integer whose square is less than or equal to the left pair — that gives the tens digit. Then use the last digit of the right pair to choose between the two possible unit digits.
What is Newton's (Babylonian) method for square roots?
Start with any reasonable guess x. Repeatedly apply x_new = (x + n/x) / 2, where n is the number whose root you want. Two or three iterations give a result accurate to several decimal places.
What is the smallest perfect square divisible by 21, 36, and 66?
Find LCM(21, 36, 66) = 2772. Factorise: 2772 = 2 squared times 3 squared times 7 times 11. The primes 7 and 11 each appear once (odd power). Multiply by 7 times 11 = 77 to make all powers even. Result: 2772 times 77 = 213444.
A self-paced playground for building with LLMs.
TinkerLLM is FACE Prep's sister property. A guided environment for shipping real LLM applications, the kind of project that earns a paragraph on your resume, not a line.
Try TinkerLLM (₹299 launch)