T(n) = (2n-4)^3 . How do I prove by Iteration? [on hold]











up vote
-3
down vote

favorite












T(n) = (2n-4)^3. Probably I need to find what is the Big-O. The question only asks to prove by iteration so I'm confused.






discrete-mathematics recursive-algorithms







share|cite|improve this question







New contributor




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











put on hold as unclear what you're asking by Nosrati, Kavi Rama Murthy, José Carlos Santos, gammatester, Toby Mak 7 hours ago


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.















  • Welcome to MSE. It will be more likely that you will get an answer if you show us that you made an effort. This should be added to the question rather than in the comments.
    – José Carlos Santos
    7 hours ago










  • I already tried using the definition to prove, but somehow T(No) is negative. That's where I'm stuck. I am still confused if iteration here means using repeated substitution or something else
    – Alex
    7 hours ago










  • The equation you posted doesn't appear to have any iteration. Double check if the right side has a $T(n)$ term.
    – Aditya Dua
    7 hours ago










  • I just edited T(n) which is on the left side T(n) = (2n-4)^3. I mistyped when I posted
    – Alex
    7 hours ago















up vote
-3
down vote

favorite












T(n) = (2n-4)^3. Probably I need to find what is the Big-O. The question only asks to prove by iteration so I'm confused.






discrete-mathematics recursive-algorithms







share|cite|improve this question







New contributor




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











put on hold as unclear what you're asking by Nosrati, Kavi Rama Murthy, José Carlos Santos, gammatester, Toby Mak 7 hours ago


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.















  • Welcome to MSE. It will be more likely that you will get an answer if you show us that you made an effort. This should be added to the question rather than in the comments.
    – José Carlos Santos
    7 hours ago










  • I already tried using the definition to prove, but somehow T(No) is negative. That's where I'm stuck. I am still confused if iteration here means using repeated substitution or something else
    – Alex
    7 hours ago










  • The equation you posted doesn't appear to have any iteration. Double check if the right side has a $T(n)$ term.
    – Aditya Dua
    7 hours ago










  • I just edited T(n) which is on the left side T(n) = (2n-4)^3. I mistyped when I posted
    – Alex
    7 hours ago













up vote
-3
down vote

favorite









up vote
-3
down vote

favorite











T(n) = (2n-4)^3. Probably I need to find what is the Big-O. The question only asks to prove by iteration so I'm confused.






discrete-mathematics recursive-algorithms







share|cite|improve this question







New contributor




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











T(n) = (2n-4)^3. Probably I need to find what is the Big-O. The question only asks to prove by iteration so I'm confused.






discrete-mathematics recursive-algorithms




discrete-mathematics recursive-algorithms






share|cite|improve this question







New contributor




Alex 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




Alex 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






New contributor




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









asked 7 hours ago









Alex

1




1




New contributor




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





New contributor





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






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




put on hold as unclear what you're asking by Nosrati, Kavi Rama Murthy, José Carlos Santos, gammatester, Toby Mak 7 hours ago


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.






put on hold as unclear what you're asking by Nosrati, Kavi Rama Murthy, José Carlos Santos, gammatester, Toby Mak 7 hours ago


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.














  • Welcome to MSE. It will be more likely that you will get an answer if you show us that you made an effort. This should be added to the question rather than in the comments.
    – José Carlos Santos
    7 hours ago










  • I already tried using the definition to prove, but somehow T(No) is negative. That's where I'm stuck. I am still confused if iteration here means using repeated substitution or something else
    – Alex
    7 hours ago










  • The equation you posted doesn't appear to have any iteration. Double check if the right side has a $T(n)$ term.
    – Aditya Dua
    7 hours ago










  • I just edited T(n) which is on the left side T(n) = (2n-4)^3. I mistyped when I posted
    – Alex
    7 hours ago


















  • Welcome to MSE. It will be more likely that you will get an answer if you show us that you made an effort. This should be added to the question rather than in the comments.
    – José Carlos Santos
    7 hours ago










  • I already tried using the definition to prove, but somehow T(No) is negative. That's where I'm stuck. I am still confused if iteration here means using repeated substitution or something else
    – Alex
    7 hours ago










  • The equation you posted doesn't appear to have any iteration. Double check if the right side has a $T(n)$ term.
    – Aditya Dua
    7 hours ago










  • I just edited T(n) which is on the left side T(n) = (2n-4)^3. I mistyped when I posted
    – Alex
    7 hours ago
















Welcome to MSE. It will be more likely that you will get an answer if you show us that you made an effort. This should be added to the question rather than in the comments.
– José Carlos Santos
7 hours ago




Welcome to MSE. It will be more likely that you will get an answer if you show us that you made an effort. This should be added to the question rather than in the comments.
– José Carlos Santos
7 hours ago












I already tried using the definition to prove, but somehow T(No) is negative. That's where I'm stuck. I am still confused if iteration here means using repeated substitution or something else
– Alex
7 hours ago




I already tried using the definition to prove, but somehow T(No) is negative. That's where I'm stuck. I am still confused if iteration here means using repeated substitution or something else
– Alex
7 hours ago












The equation you posted doesn't appear to have any iteration. Double check if the right side has a $T(n)$ term.
– Aditya Dua
7 hours ago




The equation you posted doesn't appear to have any iteration. Double check if the right side has a $T(n)$ term.
– Aditya Dua
7 hours ago












I just edited T(n) which is on the left side T(n) = (2n-4)^3. I mistyped when I posted
– Alex
7 hours ago




I just edited T(n) which is on the left side T(n) = (2n-4)^3. I mistyped when I posted
– Alex
7 hours ago















active

oldest

votes






















active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes

-

Popular posts from this blog

AnyDesk - Fatal Program Failure

Image
up vote 0 down vote favorite Good day all. I have a window that pops up saying Fatal Program Failure (AnyDesk). This is what I have done so far: Uninstalled AnyDesk and reinstalled it. ( The window still appeared ) I disabled AnyDesk start up in Msconfig and the window seems to have disapeared. Lastly I made sure that AnyDesk worked by remoting into it, and it worked. Today the same window appeared. How do I get rid of this window? remote-desktop share | improve this question edited 10 hours ago Tomasz Jakub Rup 552 3 13 ...
Read more

How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

Image
up vote 0 down vote favorite I need help with an issue we're facing in a project where we are moving from a Windows-based POS environment to one running on CentOS7. The problem consists of a number of factors, please find the details below: The supplier of our POS application will only deliver an application that is hard-coded to run in a 1024:768 4:3 format. The hardware we are using is a POS unit from HP that has a built-in 16:9 touch-screen. The employees using this solution is not supposed to see nor have access to anything but the POS application. Our sales organization demands that touch is an available feature when going live with the new POS environment. Going further into this, allow me to explain what we have encountered on the way trying to achieve the goal of having a touch-screen: We've simply change...
Read more

QoS: MAC-Priority for clients behind a repeater

Image
1 1 I've setup a wireless network using a Linksys-Router (DD-WRT) as an AP and a TP-Link repeater for range extension. To manage bandwith for specific users, I've setup QoS-Rules on the AP (DD-WRT) using MAC-Priority: However the AP shows only the Repeater's MAC and the MACs of users inside the AP-Range. The MAC addresses of users behind the Repeater are not listed : The purple MAC is not listed in the AP-Clientlist. Its related to a device connected via the TP-Link repeater. Q: How can I setup MAC-Priority for repeater-clients? Do I simply add the purple MAC in AP-MAC priority list although it's not listed as a client? I want to setup specific priority instead of giving one priority for all clients behind the repeater by adding the repeater's MAC in the MAC priority list in the AP as ...
Read more