(a) Prove c2^(2)(n)=2⌊(n-1) / 2⌋+1, for n ≥3. (See Exercise 6.6 for the definition of ck^(d)(n).

Name: Problem 7, Chapter 6: Algorithms in Combinatorial Geometry
Uploaded: 2022-12-05T12:50:48-08:00
Duration: 6 min 49 s
Channel: Prabhat Tyagi
Description: (a) Prove c2^(2)(n)=2⌊(n-1) / 2⌋+1, for n ≥3. (See Exercise 6.6 for the definition of ck^(d)(n).) (b) Prove c3^(2)(n) ≥(n^2)/(3)+c n, for some real constant c. (c) Prove cd^(d)(n)=O(n^d-1).

step 1 Here in Part A of this question consider the expression the expression combination of n to k is

Question

(a) Prove $c_2^{(2)}(n)=2\lfloor(n-1) / 2\rfloor+1$, for $n \geq 3$. (See Exercise 6.6 for the definition of $c_k^{(d)}(n)$.) (b) Prove $c_3^{(2)}(n) \geq \frac{n^2}{3}+c n$, for some real constant $c$. (c) Prove $c_d^{(d)}(n)=\mathrm{O}\left(n^{d-1}\right)$.

   (a) Prove $c_2^{(2)}(n)=2\lfloor(n-1) / 2\rfloor+1$, for $n \geq 3$. (See Exercise 6.6 for the definition of $c_k^{(d)}(n)$.)
(b) Prove $c_3^{(2)}(n) \geq \frac{n^2}{3}+c n$, for some real constant $c$. 
(c) Prove $c_d^{(d)}(n)=\mathrm{O}\left(n^{d-1}\right)$.

Algorithms in Combinatorial Geometry

Herbert Edelsbrunner 1st Edition

Chapter 6, Problem 7

Thanks for your feedback!

(a) Prove $c_2^{(2)}(n)=2\lfloor(n-1) / 2\rfloor+1$, for $n \geq 3$. (See Exercise 6.6 for the definition of $c_k^{(d)}(n)$.) (b) Prove $c_3^{(2)}(n) \geq \frac{n^2}{3}+c n$, for some real constant $c$. (c) Prove $c_d^{(d)}(n)=\mathrm{O}\left(n^{d-1}\right)$.