Timeline for A problem about asymptotic functions
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 8, 2021 at 17:20 | vote | accept | CommunityBot | ||
| Mar 8, 2021 at 17:05 | history | edited | user132812 | CC BY-SA 4.0 |
added 4 characters in body
|
| Mar 8, 2021 at 16:54 | vote | accept | CommunityBot | ||
| Mar 8, 2021 at 17:15 | |||||
| Mar 8, 2021 at 16:47 | answer | added | Steven | timeline score: 1 | |
| Mar 8, 2021 at 16:43 | comment | added | plop | Well, you can construction an example by choosing $f$ and $g$ such that the function $\max(f,g)$ is never equal to only one of $f$ or $g$ for sufficiently large input $n$. For example, suppose that $f(n)=n$ for $n$ even and equal to $0$ otherwise, and define $g(n)=n$ for $n$ odd and equal to $0$ otherwise. Then $(f+g)(n)=n$ for all $n$, but it can't be in either $O(f)$ or $O(g)$. This is because any function in $O(f)$ is forced to be equal to $0$ for all sufficiently large odd inputs. Similarly, all functions in $O(g)$ must be zero for all sufficiently large even inputs. | |
| Mar 8, 2021 at 16:43 | review | First posts | |||
| Mar 20, 2021 at 3:46 | |||||
| Mar 8, 2021 at 16:36 | history | asked | user132812 | CC BY-SA 4.0 |