Question

Show that 2^n+1 is 0(2^n)

Answer 1

are you sure of what you just whrite

Answer 2

That is the same question I asked the professor!

Answer 3

Is that expression multiplied by zero ? 0(2^n)

Answer 4

No it's big O notation.

Answer 5

\(2^n+1 = O(2^n)\)

Answer 6

Right? @kattck

Answer 7

That is what I was thinking at first but how it is written I have asked and it does represent the number 0

Answer 8

Well, if it is, I haven't seen anything like this before. For me, that expression is equal to 0, there is no such 'n' for 2^2 + 1 to be zero.

Answer 9

sorry, I was going to write 2^n+1

Answer 10

Well, it's not what big O means.

Answer 11

What class are you in? @kattck

Answer 12

Yah this would be false statement correct?

Answer 13

yes

Answer 14

This is discrete Mathematic Comp Science

Answer 15

then I'm pretty sure it's big O.

Answer 16

What subjects did your proffessor explained you so far?

Answer 17

Do you have note about it? What is this "0"?

Answer 18

What is definition of 0( f(x) )?

Answer 19

I found a whole section on Big-"OH" notation!

Answer 20

geerky42 You were right!

Answer 21

Yeah :)

What is definition of big O, if you were given?

Answer 22

Then from here, we can figure out how to show etc

Answer 23

Or you can use this: https://www.cs.utexas.edu/users/tandy/big-oh.pdf

Answer 24

ok so big OH is measuerment time of the execution of the algorithm

Answer 25

Well, yeah that's what big O is often used for.

Answer 26

In your question, by "show," you mean like prove?

Answer 27

Yah this section is mostly about proving the algorithms.

Answer 28

OK, so from definition in link, \(2^n+1 = O(2^n)\) if there exist positive constant \(C_1\) and \(C_2\) such that \(2^n+1\le C_1~ 2^n\) for all \(n>C_2\)

You get the idea, right?