You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
You've probably already seen that, with small values of <m>n</m>, sometimes <m>n^2</m> and sometimes <m>2^n</m> is bigger. But if you keep experimenting one of the functions seems to get bigger and stay bigger than the other. The number <m>n=b</m> where this change occurs is a good choice for a base case. So as not to spoil the problem for you, we won't say here what this value of <m>b</m> is. However you shouldn't be surprised later in the proof if you need to use the assumption that <m>n /gt b</m>.
Typo at the end of the line: <m>n /gt b</m> should be <m>n \gt b</m>
The text was updated successfully, but these errors were encountered:
ibl-combinatorics/mbx/app2-1-induction.mbx
Line 418 in fff9482
Typo at the end of the line:
<m>n /gt b</m>
should be<m>n \gt b</m>
The text was updated successfully, but these errors were encountered: