Recent content by Gear2d

I was wondering if I could get some help with the terminology when it comes to graph theory. In this picture : http://en.wikipedia.org/wiki/Image:6n-graf.svg the numerical values are vertices (or nodes as some call it), so what are the edges then (are they the lines that connect the nodes)...

Thank you, that makes sense. Don't know why I did not see that. Thanks again.

Thanks Ad2d you said what I wanted to say. So how would one approach this problem?

Sorry about that, n can be any number, does not have to be fixed like the k's. So, for example nk1 < nk2.

Homework Statement k is a constant where k1 < k2 Is the relation between the two <. > or = to: A = nk1 + k2n B = nk2 + k1n The Attempt at a Solution I did this problem said that A > B, and I got it wrong. I am having a hard time telling if nki or kin is greater.

Sorry the r >5 was meant to be x >5 in 2x >(x+1)2

Homework Statement I was reading my discrete math book and have this example of how they prove by induction that if 2x >(x+1)2 that 2k+1 >[(k + 1) + 1]2 Where r>5The Attempt at a Solution 2k+1 = 2 * 2k >2(k+1)2 by inductive hypothesis => How? And what happened the +1...

I need some help. I am having a hard time find the recurrence when given an algorithm in c++. The algorithm is a Max search: Its where the program goes through the array from first element to last, or last to first (depends on how you program it) to look for the largest value. In this case it...

Could take the log of the inside to get the i th term? 2i-1 - 1 = k (some constant) Take lg of each side 2i-1 = k +1 i-1 = lg(k+1) i = lg(k+1) + 1

I am assuming that is what the teacher wants. Could this be it: C(n)=[SIZE="7"]{ 1, n=1 and C(n/2) + 2, otherwise

Homework Statement Solve and prove your solution for the following recurrence relation for the number of comparisons in Binary Search: C(21 - 1)=1 C(2i - 1) = 2 + C(2(i+1) - 1) The Attempt at a Solution The setup for this would be: C(n)=[SIZE="7"]{ 1, n=1 and 2 + C(2(i+1) - 1), otherwise...

Homework Statement I am not sure if this is the right spot to post this, but how would I go about proving this by induction: f(n) = { 6, n=1 5n+1, otherwise Homework Equations The Attempt at a Solution Base case: n=1, 5(1) + 1 = 6...

Homework Statement What is the order of the two functions: f(n) = (log(n^3))^4 g(n) = (log(n^7))^2 Homework Equations http://www.augustana.ca/~hackw/csc210/exhibit/chap04/bigOhRules.html The Attempt at a Solution f(n) = (log(n^3))^4 = log(n^3) * log(n^3) * log(n^3) *...

Good point guys. I wanted to compare two of them to each other, let's say: f(x) = 2^x vs. g(x) = 3^x now from this I have to determine if f=Theta(g), f<Theta(g) or f>Theta(g). Instead of using L'Hospital rule: c=lim 2^x/3^x = lim (2/3)^x = 0 as x goes to infinite this would mean that...

I need now what is the order (The Big Oh notation) of these three functions: 2^x 3^x 3^(x-10)