[sth; to sth]
The terms involving $a\neq 1$ contribute $O(n)$, since ......
These upper bounds are too large to be useful in computer calculations in general, but the ideas in the proofs will surely contribute to better bounds in the future.
Go to the list of words starting with: a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
y
z