Answer:
Step-by-step explanation:a = m + (p-1)*d
b = m + (q-1)*d
c = m + (r-1)*d
p(b-c) = p*(q-r)*d
q(c-a) = q*(r-p)*d
r(a-b) = r*(p-q)*d
p(b-c)+q(c-a)+r(a-b)
= p*(q-r)*d + q*(r-p)*d +r*(p-q)*d
= (pq-pr+qr-pq+rp-qr)*d
= 0*d = 0
So i prove p(b-c)+q(c-a)+r(a-b)=0 hope this is helpfull
<span>Addition Property of Equality
hope that helps</span>
Answer:
1.5 feet
Step-by-step explanation:
12/8 = 1.5 feet
Answer:
Least positive integer divisible by the numbers 2, 4, and 7 is 28
Step-by-step explanation:
We can find the least positive integer divisible by the numbers 2, 4, and 7 by taking the LCM
First lets List all prime factors for each number.
Prime Factorization of 2
2 is prime => 
Prime Factorization of 4 is:
2 x 2 => 
Prime Factorization of 7 is:
7 is prime => 
For each prime factor, find where it occurs most often as a factor and write it that many times in a new list.
The new superset list is
2, 2, 7
Multiply these factors together to find the LCM.
LCM = 2 x 2 x 7 = 28
Answer:
maybe
Step-by-step explanation: