Answer:
D) Health insurers can never discriminate based on genetic information in this way
Answer:
(C) y= 2.11x
Step-by-step explanation:
<h3>
Answer: 16 square units</h3>
Let x be the height of the parallelogram. Right now it's unknown, but we can solve for it using the pythagorean theorem. Focus on the right triangle. It has legs a = 3 and b = x, with hypotenuse c = 5
a^2 + b^2 = c^2
3^2 + x^2 = 5^2
9 + x^2 = 25
x^2 = 25-9
x^2 = 16
x = sqrt(16)
x = 4
This is a 3-4-5 right triangle.
The height of the parallelogram is 4 units.
We have enough info to find the area of the parallelogram
Area of parallelogram = base*height
Area of parallelogram = 4*4
Area of parallelogram = 16 square units
Coincidentally, the base and height are the same, which isn't always going to be the case. The base is visually shown as the '4' in the diagram. The height is the dashed line, which also happens to be 4 units long.
X equals 125 and y equals 55
(e) Each license has the formABcxyz;whereC6=A; Bandx; y; zare pair-wise distinct. There are 26-2=24 possibilities forcand 10;9 and 8 possibilitiesfor each digitx; yandz;respectively, so that there are 241098 dierentlicense plates satisfying the condition of the question.3:A combination lock requires three selections of numbers, each from 1 through39:Suppose that lock is constructed in such a way that no number can be usedtwice in a row, but the same number may occur both rst and third. How manydierent combinations are possible?Solution.We can choose a combination of the formabcwherea; b; carepair-wise distinct and we get 393837 = 54834 combinations or we can choosea combination of typeabawherea6=b:There are 3938 = 1482 combinations.As two types give two disjoint sets of combinations, by addition principle, thenumber of combinations is 54834 + 1482 = 56316:4:(a) How many integers from 1 to 100;000 contain the digit 6 exactly once?(b) How many integers from 1 to 100;000 contain the digit 6 at least once?(a) How many integers from 1 to 100;000 contain two or more occurrencesof the digit 6?Solutions.(a) We identify the integers from 1 through to 100;000 by astring of length 5:(100,000 is the only string of length 6 but it does not contain6:) Also not that the rst digit could be zero but all of the digit cannot be zeroat the same time. As 6 appear exactly once, one of the following cases hold:a= 6 andb; c; d; e6= 6 and so there are 194possibilities.b= 6 anda; c; d; e6= 6;there are 194possibilities. And so on.There are 5 such possibilities and hence there are 594= 32805 such integers.(b) LetU=f1;2;;100;000g:LetAUbe the integers that DO NOTcontain 6:Every number inShas the formabcdeor 100000;where each digitcan take any value in the setf0;1;2;3;4;5;7;8;9gbut all of the digits cannot bezero since 00000 is not allowed. SojAj= 9<span>5</span>
