Skip to content

Basic math formulas

yuuki edited this page May 23, 2025 · 52 revisions

Exponent rules

a m a n = a m + n (1) ( a m ) n = a m n (2) ( a b ) n = a n b n (3)

Logarithm rules

log b ( x y ) = log b x + log b y (1) log b ( x k ) = k log b x (2) log b x = log c x log c b (3)

Proofs

Exponent rules

Let a and b be real numbers, and let m and n be positive integers.

Definition (Exponentiation):

a 1 = a , (Def. 1) a n + 1 = a n a for  n 1. (Def. 2)

By induction on n :

(1) a m a n = a m + n

Base case ( n = 1 ):

a m a 1 = a m a (by Def. 1) = a m + 1 . (by Def. 2)

Inductive step: Assume a m a n = a m + n . Then:

a m a n + 1 = a m ( a n a ) (by Def. 2) = ( a m a n ) a (by associativity) = a m + n a (by the induction hypothesis) = a ( m + n ) + 1 (by Def. 2) = a m + ( n + 1 ) . (by associativity)

(2) ( a m ) n = a m n

Base case ( n = 1 ):

( a m ) 1 = a m (by Def. 1) = a m 1 . (by identity)

Inductive step: Assume ( a m ) n = a m n . Then:

( a m ) n + 1 = ( a m ) n a m (by Def. 2) = a m n a m (by the induction hypothesis) = a m n + m (by Rule 1) = a m ( n + 1 ) . (by distributivity)

(3) ( a b ) n = a n b n

Base case ( n = 1 ):

( a b ) 1 = a b (by Def. 1) = a 1 b 1 . (by Def. 1)

Inductive step: Assume ( a b ) n = a n b n . Then:

( a b ) n + 1 = ( a b ) n ( a b ) (by Def. 2) = a n b n ( a b ) (by the induction hypothesis) = ( a n a ) ( b n b ) (by associativity and commutativity) = a n + 1 b n + 1 . (by Def. 2)

Logarithm rules

Let x , y > 0 and k be real numbers, and let b , c > 0 be real numbers with b , c 1 . Since a logarithm is the inverse of exponentiation, we have:

b log b x = log b ( b x ) = x ,

just like f ( f 1 ( x ) ) = f 1 ( f ( x ) ) = x . Using this:

(1)

log b ( x y ) = log b ( b log b x b log b y ) = log b ( b log b x + log b y ) = log b x + log b y .

(2)

log b ( x k ) = log b ( ( b log b x ) k ) = log b ( b k log b x ) = k log b x .

(3)

log b x = log b x log c b log c b = log c ( b log b x ) log c b = log c x log c b .