-(28.62-27.56)
= -1.06 or -53/50,-13/50
Answer:
distributive property
Step-by-step explanation:
we know the distributive property states that the multiplication of a number (in this case, the number 4) by a sum (in this case is a subtraction: x-6) is equal to the sum of the multiplications of that number for each of the terms that belong to the sum:
we have: 4(x-6)
we apply the distributive property, so we have
4(x-6)=4*x-4*6
4(x-6)=4x-24
Answer:
hi there! i can help you out! i don't want you to get a zero on your report card!!
Step-by-step explanation:
so, on the x-axis, which is all the numbers through 1-10 and there are the patient's number. so for ex, the first question says patient 1 : 3 hours right??
so the hours are the y-axis and you can label them 2,4,6,8 because skip counting by twos are probably the easiest! so for the first question, you would line a dot up on top of 1 and go up and you see 2 and 4 right, cuz you just labeled it... do go between 2 and 4 which is 3 and place the dot there...
and keep doing the same things with other ones too...
another ex! so on the second question, it says patient 2 : 7 hours so place the dot on top of the 2 and go up untill you see 6 and 8 and place the dot beween them!
Answer:
P(R) = 0.14
P(I) = 0.16
P(D) = 0.315
Step-by-step explanation:
Let Democrat = D
Republican = R
Independent = I
If 45% are Democrats, 35% are Republicans, and 20% are independents, then
Total registered voters = 100
In an election, 70% of the Democrats, 40% of the Republicans, and 80% of the independents voted in favor of a parks and recreation bond proposal. That is,
D = 0.7 × 45 = 31.5
R = 0.4 × 35 = 14
I = 0.8 × 20 = 16
If a registered voter chosen at random is found to have voted in favor of the bond, what is the probability that the voter is
a Republican:
P(R) = 14 /100 = 0.14
an Independent
P(I) = 16/100 = 0.16
a Democrat
P(D) = 31.5/100 = 0.315
4, 7 and 9 are mutually coprime, so you can use the Chinese remainder theorem.
Start with

Taken mod 4, the last two terms vanish and we're left with

We have
, so we can multiply the first term by 3 to guarantee that we end up with 1 mod 4.

Taken mod 7, the first and last terms vanish and we're left with

which is what we want, so no adjustments needed here.

Taken mod 9, the first two terms vanish and we're left with

so we don't need to make any adjustments here, and we end up with
.
By the Chinese remainder theorem, we find that any
such that

is a solution to this system, i.e.
for any integer
, the smallest and positive of which is 149.