What is the Big-Ω of the following function?












2












$begingroup$


For the following function:



$$
sum_{n=1}^{2n}x+x^2
$$



It is easy to see the (tightest) Big-Oh is $O(n^3)$, but I am not so sure about the Big-Omega. Here is my attempt:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
geq sum_{n=1}^{2n}x^2
$$



But not sure how to continue. Also, does tightest Big-Ω always equal tightest Big-Oh?



EDIT: The way I worked out the Big-Oh is shown below:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
leq sum_{n=1}^{2n}x^2+x^2
$$
$$
= sum_{n=1}^{2n}2x^2
$$
$$
leq 2n ( 2(2n)^2)
$$
$$
= 8n^3
$$



Therefore the Big-Oh is $O(n^3)$.






time-complexity asymptotics runtime-analysis







share|cite|improve this question









New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$








  • 1




    $begingroup$
    Please show in the question how "to see the (tightest) Big-$O$ is $O(n^3)$".
    $endgroup$
    – Apass.Jack
    4 hours ago










  • $begingroup$
    @Apass.Jack Updated the question.
    $endgroup$
    – TigerHix
    2 hours ago
















2












$begingroup$


For the following function:



$$
sum_{n=1}^{2n}x+x^2
$$



It is easy to see the (tightest) Big-Oh is $O(n^3)$, but I am not so sure about the Big-Omega. Here is my attempt:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
geq sum_{n=1}^{2n}x^2
$$



But not sure how to continue. Also, does tightest Big-Ω always equal tightest Big-Oh?



EDIT: The way I worked out the Big-Oh is shown below:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
leq sum_{n=1}^{2n}x^2+x^2
$$
$$
= sum_{n=1}^{2n}2x^2
$$
$$
leq 2n ( 2(2n)^2)
$$
$$
= 8n^3
$$



Therefore the Big-Oh is $O(n^3)$.






time-complexity asymptotics runtime-analysis







share|cite|improve this question









New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$








  • 1




    $begingroup$
    Please show in the question how "to see the (tightest) Big-$O$ is $O(n^3)$".
    $endgroup$
    – Apass.Jack
    4 hours ago










  • $begingroup$
    @Apass.Jack Updated the question.
    $endgroup$
    – TigerHix
    2 hours ago














2












2








2





$begingroup$


For the following function:



$$
sum_{n=1}^{2n}x+x^2
$$



It is easy to see the (tightest) Big-Oh is $O(n^3)$, but I am not so sure about the Big-Omega. Here is my attempt:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
geq sum_{n=1}^{2n}x^2
$$



But not sure how to continue. Also, does tightest Big-Ω always equal tightest Big-Oh?



EDIT: The way I worked out the Big-Oh is shown below:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
leq sum_{n=1}^{2n}x^2+x^2
$$
$$
= sum_{n=1}^{2n}2x^2
$$
$$
leq 2n ( 2(2n)^2)
$$
$$
= 8n^3
$$



Therefore the Big-Oh is $O(n^3)$.






time-complexity asymptotics runtime-analysis







share|cite|improve this question









New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




For the following function:



$$
sum_{n=1}^{2n}x+x^2
$$



It is easy to see the (tightest) Big-Oh is $O(n^3)$, but I am not so sure about the Big-Omega. Here is my attempt:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
geq sum_{n=1}^{2n}x^2
$$



But not sure how to continue. Also, does tightest Big-Ω always equal tightest Big-Oh?



EDIT: The way I worked out the Big-Oh is shown below:



$$
sum_{n=1}^{2n}x+x^2
$$
$$
leq sum_{n=1}^{2n}x^2+x^2
$$
$$
= sum_{n=1}^{2n}2x^2
$$
$$
leq 2n ( 2(2n)^2)
$$
$$
= 8n^3
$$



Therefore the Big-Oh is $O(n^3)$.






time-complexity asymptotics runtime-analysis




time-complexity asymptotics runtime-analysis






share|cite|improve this question









New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 2 hours ago







TigerHix













New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 4 hours ago









TigerHixTigerHix

134




134




New contributor




TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






TigerHix is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 1




    $begingroup$
    Please show in the question how "to see the (tightest) Big-$O$ is $O(n^3)$".
    $endgroup$
    – Apass.Jack
    4 hours ago










  • $begingroup$
    @Apass.Jack Updated the question.
    $endgroup$
    – TigerHix
    2 hours ago














  • 1




    $begingroup$
    Please show in the question how "to see the (tightest) Big-$O$ is $O(n^3)$".
    $endgroup$
    – Apass.Jack
    4 hours ago










  • $begingroup$
    @Apass.Jack Updated the question.
    $endgroup$
    – TigerHix
    2 hours ago








1




1




$begingroup$
Please show in the question how "to see the (tightest) Big-$O$ is $O(n^3)$".
$endgroup$
– Apass.Jack
4 hours ago




$begingroup$
Please show in the question how "to see the (tightest) Big-$O$ is $O(n^3)$".
$endgroup$
– Apass.Jack
4 hours ago












$begingroup$
@Apass.Jack Updated the question.
$endgroup$
– TigerHix
2 hours ago




$begingroup$
@Apass.Jack Updated the question.
$endgroup$
– TigerHix
2 hours ago










1 Answer
1






active

oldest

votes


















2












$begingroup$

$$begin{align}
sum_{x=1}^{2n}(x+x^2) gt sum_{x=1}^{2n}x^2 gt sum_{x=n+1}^{2n}x^2gtsum_{x=n+1}^{2n}n^2= n^3
end{align}
$$



So the function is $Omega(n^3)$. You have shown it is $O(n^3)$. So the function is $Theta(n^3)$.



Although $n^3$, the asymptotic lower bound ignoring a constant factor is the same as the asymptotic upper bound ignoring a constant factor in the current case, it is not always true because some functions fluctuate. For example,
$$f(n)=begin{cases}1 quad text {when }ntext{ is odd,}\ n quad text{when }ntext{ is even.}end{cases}$$ $f(n)=O(n)$ and $f(n)=Omega(1)$. Both bounds are tightest.




Exercise. Show that $$sum_{x=1}^{m}(x+x^2)=frac{m(m+1)(m+2)}{3}$$






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
    $endgroup$
    – TigerHix
    2 hours ago










  • $begingroup$
    That clears it up, thanks!
    $endgroup$
    – TigerHix
    1 hour ago






  • 1




    $begingroup$
    @TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
    $endgroup$
    – Draconis
    30 mins ago













Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "419"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






TigerHix is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f102874%2fwhat-is-the-big-%25ce%25a9-of-the-following-function%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

$$begin{align}
sum_{x=1}^{2n}(x+x^2) gt sum_{x=1}^{2n}x^2 gt sum_{x=n+1}^{2n}x^2gtsum_{x=n+1}^{2n}n^2= n^3
end{align}
$$



So the function is $Omega(n^3)$. You have shown it is $O(n^3)$. So the function is $Theta(n^3)$.



Although $n^3$, the asymptotic lower bound ignoring a constant factor is the same as the asymptotic upper bound ignoring a constant factor in the current case, it is not always true because some functions fluctuate. For example,
$$f(n)=begin{cases}1 quad text {when }ntext{ is odd,}\ n quad text{when }ntext{ is even.}end{cases}$$ $f(n)=O(n)$ and $f(n)=Omega(1)$. Both bounds are tightest.




Exercise. Show that $$sum_{x=1}^{m}(x+x^2)=frac{m(m+1)(m+2)}{3}$$






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
    $endgroup$
    – TigerHix
    2 hours ago










  • $begingroup$
    That clears it up, thanks!
    $endgroup$
    – TigerHix
    1 hour ago






  • 1




    $begingroup$
    @TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
    $endgroup$
    – Draconis
    30 mins ago


















2












$begingroup$

$$begin{align}
sum_{x=1}^{2n}(x+x^2) gt sum_{x=1}^{2n}x^2 gt sum_{x=n+1}^{2n}x^2gtsum_{x=n+1}^{2n}n^2= n^3
end{align}
$$



So the function is $Omega(n^3)$. You have shown it is $O(n^3)$. So the function is $Theta(n^3)$.



Although $n^3$, the asymptotic lower bound ignoring a constant factor is the same as the asymptotic upper bound ignoring a constant factor in the current case, it is not always true because some functions fluctuate. For example,
$$f(n)=begin{cases}1 quad text {when }ntext{ is odd,}\ n quad text{when }ntext{ is even.}end{cases}$$ $f(n)=O(n)$ and $f(n)=Omega(1)$. Both bounds are tightest.




Exercise. Show that $$sum_{x=1}^{m}(x+x^2)=frac{m(m+1)(m+2)}{3}$$






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
    $endgroup$
    – TigerHix
    2 hours ago










  • $begingroup$
    That clears it up, thanks!
    $endgroup$
    – TigerHix
    1 hour ago






  • 1




    $begingroup$
    @TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
    $endgroup$
    – Draconis
    30 mins ago
















2












2








2





$begingroup$

$$begin{align}
sum_{x=1}^{2n}(x+x^2) gt sum_{x=1}^{2n}x^2 gt sum_{x=n+1}^{2n}x^2gtsum_{x=n+1}^{2n}n^2= n^3
end{align}
$$



So the function is $Omega(n^3)$. You have shown it is $O(n^3)$. So the function is $Theta(n^3)$.



Although $n^3$, the asymptotic lower bound ignoring a constant factor is the same as the asymptotic upper bound ignoring a constant factor in the current case, it is not always true because some functions fluctuate. For example,
$$f(n)=begin{cases}1 quad text {when }ntext{ is odd,}\ n quad text{when }ntext{ is even.}end{cases}$$ $f(n)=O(n)$ and $f(n)=Omega(1)$. Both bounds are tightest.




Exercise. Show that $$sum_{x=1}^{m}(x+x^2)=frac{m(m+1)(m+2)}{3}$$






share|cite|improve this answer











$endgroup$



$$begin{align}
sum_{x=1}^{2n}(x+x^2) gt sum_{x=1}^{2n}x^2 gt sum_{x=n+1}^{2n}x^2gtsum_{x=n+1}^{2n}n^2= n^3
end{align}
$$



So the function is $Omega(n^3)$. You have shown it is $O(n^3)$. So the function is $Theta(n^3)$.



Although $n^3$, the asymptotic lower bound ignoring a constant factor is the same as the asymptotic upper bound ignoring a constant factor in the current case, it is not always true because some functions fluctuate. For example,
$$f(n)=begin{cases}1 quad text {when }ntext{ is odd,}\ n quad text{when }ntext{ is even.}end{cases}$$ $f(n)=O(n)$ and $f(n)=Omega(1)$. Both bounds are tightest.




Exercise. Show that $$sum_{x=1}^{m}(x+x^2)=frac{m(m+1)(m+2)}{3}$$







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 1 hour ago

























answered 2 hours ago









Apass.JackApass.Jack

8,1121633




8,1121633












  • $begingroup$
    Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
    $endgroup$
    – TigerHix
    2 hours ago










  • $begingroup$
    That clears it up, thanks!
    $endgroup$
    – TigerHix
    1 hour ago






  • 1




    $begingroup$
    @TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
    $endgroup$
    – Draconis
    30 mins ago




















  • $begingroup$
    Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
    $endgroup$
    – TigerHix
    2 hours ago










  • $begingroup$
    That clears it up, thanks!
    $endgroup$
    – TigerHix
    1 hour ago






  • 1




    $begingroup$
    @TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
    $endgroup$
    – Draconis
    30 mins ago


















$begingroup$
Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
$endgroup$
– TigerHix
2 hours ago




$begingroup$
Thank you for the detailed answer! Could you also answer the other question: does the tightest Big-Ω always equal the tightest Big-Oh?
$endgroup$
– TigerHix
2 hours ago












$begingroup$
That clears it up, thanks!
$endgroup$
– TigerHix
1 hour ago




$begingroup$
That clears it up, thanks!
$endgroup$
– TigerHix
1 hour ago




1




1




$begingroup$
@TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
$endgroup$
– Draconis
30 mins ago






$begingroup$
@TigerHix The fact that $O$ and $Omega$ can be different, btw, is why $Theta$ exists.
$endgroup$
– Draconis
30 mins ago












TigerHix is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















TigerHix is a new contributor. Be nice, and check out our Code of Conduct.













TigerHix is a new contributor. Be nice, and check out our Code of Conduct.












TigerHix is a new contributor. Be nice, and check out our Code of Conduct.
















Thanks for contributing an answer to Computer Science Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f102874%2fwhat-is-the-big-%25ce%25a9-of-the-following-function%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Plaza Victoria

Image
Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
Read more

Puebla de Zaragoza

Image
Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc
Read more

Musa

Image
Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo
Read more