Question

In: Computer Science

Prove that in any nonempty set of n numbers, there is one number whose value is...

Prove that in any nonempty set of n numbers, there is one number whose value is at least the average of the n numbers.

Solutions

Expert Solution

Let us suppose a non empty set S having n elements,

mark the largest among all the elements be M.

and sum of all the numbers Sum =i Si  where Si is element in set at i-th position where i goes from 1 to n.

Also for every i , Si <= M

for average value should let say N = Sum / n

N = i Si / n             

where / stand for divided by

on cross multiplying ,

N*n = i Si

as Si <= M

N*n <=i M

N*n <= n*M

N <= M

that means N (average) is  always lower than or equal to maximum element in the set S.

Or in other words M is always greater than or equal to average and

hence there exist a element(the largest one in set) in set that is atleast average of set.

PROVED !!

DO UPVOTE IF YOU LIKED MY ANSWER!!


Related Solutions

Let the cardinal number of N, the set of all natural numbers, be א0. Prove that...
Let the cardinal number of N, the set of all natural numbers, be א0. Prove that the product set N × N = {(m,n);m ∈ N,n ∈ N} has the same cardinal number. Further prove that Q+, the set of all positive rational numbers, has the cardinal number N_0. Hint: You may use the formula 2^(m−1)(2n − 1) to define a function from N × N to N, see the third example on page 214 of the textbook.
Please prove that: A nonempty compact set S of real numbers has a largest element (called...
Please prove that: A nonempty compact set S of real numbers has a largest element (called the maximum) and a smallest element (called the minimum). By the way, I think a minimum is provided by -max(-S)
Let S ⊆ R be a nonempty compact set and p ∈ R. Prove that there...
Let S ⊆ R be a nonempty compact set and p ∈ R. Prove that there exists a point x_0 ∈ S which is “closest” to p. That is, prove that there exists x0 ∈ S such that |x_0 − p| is minimal.
PROOFS: 1. State the prove The Density Theorem for Rational Numbers 2. Prove that irrational numbers are dense in the set of real numbers
  PROOFS: 1. State the prove The Density Theorem for Rational Numbers 2. Prove that irrational numbers are dense in the set of real numbers 3. Prove that rational numbers are countable 4. Prove that real numbers are uncountable 5. Prove that square root of 2 is irrational
*Combinatorics* Prove bell number B(n)<n!
*Combinatorics* Prove bell number B(n)<n!
How can I prove that the number of proper subsets of a set with n elements is 2n−1 ?
How can I prove that the number of proper subsets of a set with n elements is 2n−1 ?
Prove that a disjoint union of any finite set and any countably infinite set is countably...
Prove that a disjoint union of any finite set and any countably infinite set is countably infinite. Proof: Suppose A is any finite set, B is any countably infinite set, and A and B are disjoint. By definition of disjoint, A ∩ B = ∅ In case A = ∅, then A ∪ B = B, which is countably infinite by hypothesis. Now suppose A ≠ ∅. Then there is a positive integer m so that A has m elements...
4. Prove that for any n∈Z+, An ≤Sn.
4. Prove that for any n∈Z+, An ≤Sn.
(Lower bound for searching algorithms) Prove: any comparison-based searching algorithm on a set of n elements...
(Lower bound for searching algorithms) Prove: any comparison-based searching algorithm on a set of n elements takes time Ω(log n) in the worst case. (Hint: you may want to read Section 8.1 of the textbook for related terminologies and techniques.)
Prove that for any real numbers a and b, there exists rational numbers x and y...
Prove that for any real numbers a and b, there exists rational numbers x and y where y>0 such that a < x-y < x+y < b
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT