how do I solve this using discrete math. Claim 3n2+8n-5 ≠ O(n). You prove such a claim by showing that ∀c>0, n0 ≥0 there exists n≥n0 : 3n2+8n-5>c*n. For problem, you need to determine a formula for the smallest value of n for which the statement above is true (in order to prove the claim.) Once you get formula for n in terms of those variables, plug in the following values for   and c and  n0. c=39,  n0=3. Use formula to determine the smallest value of n for which the inequality holds. round answer to the nearest 2 decimal places

how do I solve this using discrete math.

Claim 3n²+8n-5 ≠ O(n). You prove such a claim by showing that ∀c>0, n₀ ≥0 there exists n≥n₀ : 3n²+8n-5>c*n. For problem, you need to determine a formula for the smallest value of n for which the statement above is true (in order to prove the claim.) Once you get formula for n in terms of those variables, plug in the following values for 
 and c and  n₀. c=39,  n₀=3. Use formula to determine the smallest value of n for which the inequality holds. round answer to the nearest 2 decimal places