Answer:
We now want to find the best approximation to a given function. This fundamental problem in Approximation Theory can be stated in very general terms. Let V be a Normed Linear Space and W a finite-dimensional subspace of V , then for a given v ∈ V , find w∗∈ W such that kv −w∗k ≤ kv −wk, for all w ∈ W.
Step-by-step explanation:
Answer:a) 870
b) 435
Step-by-step explanation:
a)
number of photos to be posted =n = 30
number of web pages on which they would be posted is 2
Since the order in which the photos appear on the web pages matters,
Number of ways = 30 permutation 2
=870 ways
b)
Since the order in which the photos appear on the web pages does not matter,
Number of ways = 30 combination 2
= 435 ways
The third one
5/6 is the answer
I hope this helps you
6740/10=674
6740/3=2,246666
