
Mathematics: from foundations to higher mathematics Lesson 27 of 41
Powers and roots: repeated multiplication and its inverse question
We read powers through base and exponent, derive same-base laws from meaning, and use roots as an inverse check.
This text was translated with AI.
Where we are on the map
Algebraic notation now compresses repeated multiplication.
Begin with a familiar image
Repeatedly folding paper doubles its layers: 2, 4, 8. Powers record such repeated multiplication compactly.
Precise meaning
aⁿ is a product of n factors equal to a. √b is the nonnegative number whose square equals b.
The lesson’s support signal
meaning → model → calculation → check → explain in your own words
base → count factors → apply exponent law → check with a root or power
Worked example
2³×2⁴ contains seven factors of 2, so 2⁷=128; √144=12 because 12²=144.
Example with a fading prompt
Change the numbers in the example and repeat the solution without copying its steps. Estimate first, calculate exactly, and check against the original condition.
Recall without a prompt
- Define the main idea in one sentence.
- Rebuild the support signal from memory.
- Solve the example with different numbers and explain why every step is valid.
Find and correct the mistake
Writing 2³+2⁴=2⁷ is wrong: exponents add when same-base powers are multiplied, not added.
Transfer to a new setting
Apply the same relationship to something you can measure yourself. Name the quantities, units, and the boundary within which the model is valid. Check the answer by a second representation or an inverse operation.
Exercise
Required. Explain 3²×3⁴, 5⁷÷5³, and √225 by expanding factors and checking inversely.
With your own data. Create one everyday example with the same structure and show it in words, a formula, and a check.
Optional. Seven days later, change the numbers and repeat without the support map.
Open perspective
Terms with powers form polynomials, whose operations rely on distribution.
If you have found a mistake or a typo in this article, tell us about it
Comments (0)
Log in to leave a comment →
No comments yet. Be the first.