Simulate
Check the claim with numbers
Lesson 1.4.3 gave three log rules and checked them on a few numbers; here they meet 10,000 random cases. Each case picks a base , positive numbers and , and a power . It then measures how far each rule is from exact.
Every gap is below , the size of rounding error in the last digits. The rules need positive inputs, though. The next cell tries in the power rule, and a sum in place of a product.
Since , the left side is , but does not exist. And there is no rule for the log of a sum: 1.6094 against 1.7918.
Conjecture
For every base with , all and every real ,
Ten thousand cases agree to within . Rounding hides small failures, and no test can try every positive number, so the rules still need a proof.
Turn a log fact into an exponent fact
A logarithm is an exponent (lesson 1.4.3): is the power of that gives . So a fact about logs can be proved as a fact about powers, where the rules are known.
Rule: Reading off a log
For the graph of always rises, and for it always falls (lesson 1.4.2). Either way it reaches each positive exactly once. So is one number, and showing proves that it is .
The proofs also use the exponent rules for real exponents. Lesson PG2.2 proved them for whole numbers. Lesson 1.4.2 extends powers of a positive base to every real exponent, with the same rules, and this stage takes that as known:
Format 2
Fill the gap
Here are the three proofs, each a line long once the logs are named. Fill each gap as you would a quick answer, such as u+v, then check.
Let and . By the definition of a logarithm, and .
Product rule. with . Reading off the log, .
Quotient rule. with . So .
Power rule. with . So .
For example, and , so the product rule gives .
How to type answers
- Powers with
^, brackets round a power that is a sum:r^k,r^(k+1). - Fractions with
/and brackets:(1-r)/(1+r). Multiply with*or side by side:2k+1. - Press Enter in any box to check them all.
Format 3
Find the error
This proof claims that for every . The simulation found but no , so one line must be wrong. Select it, then say why.
Simulate
A claim of your own to prove
Lesson 1.4.3 also gave the change-of-base formula, . The cell computes for four pairs, then raises to the power . If , then is by its definition.
In all four rows comes back to , for example . A base of 1 breaks the formula, because .
Conjecture
For every base with and every ,
Four pairs agree. Prove the formula for every base and every positive , using the power rule you have just proved.
Format 4
Write it
Prove the change-of-base formula: for , and , show that . Say why the division is allowed.
Saved in this browser as you type.
Write your own first: a proof you have tried to write teaches far more than one you only read.
Summary card
- To prove a fact about logs, name the logs ( means ) and prove a fact about powers.
- If , then : the exponential reaches each positive number exactly once.
- , , , for .
- for every ; is right only for .
- Change of base, , needs so that .