If a,b >0 and c> a+b, then prove that lga + lgb < 2*lgc -2.

**Subject Computer Science Discrete Math**

If a,b >0 and c> a+b, then prove that lga + lgb < 2*lgc -2.

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

lga+lgb ≤2*lgc -2 is equivalent with: lg(ab) ≤2*lgc -2 (according to property 1)

Moving further one step, this is equivalent to prove that:

2*lgc -lg(ab) ≥2 which is the same with lg(c^2) -lg(ab) ≥2 (property 3)...

Moving further one step, this is equivalent to prove that:

2*lgc -lg(ab) ≥2 which is the same with lg(c^2) -lg(ab) ≥2 (property 3)...

This is only a preview of the solution. Please use the purchase button to see the entire solution

Discrete Mathematics Problem

$10.00

Discrete Mathematics

Division Algorithm

Computer Science

Primes

Proof

Integers

Discrete Math Questions with Sets, Functions, Fibonacci, and Base Conversion

$35.00

Set

Interval

Base

Function

Fibonacci

Integer

One-to-one

Onto

Fraction

Real

Decimal

Point

Intersection

Union

Power

Cartesian

Product

Inverse

Injective

Element

Method

Bare

Hand

Induction

Set

Interval

Base

Function

Fibonacci

Integer

One-to-one

Onto

Fraction

Real

Decimal

Point

Intersection

Union

Power

Cartesian

Product

Inverse

Injective

Element

Method

Bare

Hand

Induction