Answer:
a K=2
b A =200
c B = ±2
Step-by-step explanation:
A = kB^2
When A =50 B=5
Substitute these values in
50 = k * 5^2
50 = k*25
Divide by 25
50/25 = k25/25
2 =k
A = 2B^2
When B = 10
A = 2*10^2
A = 2 *100
A = 200
When A =8
8 =2B^2
Divide by 2
8/2 = 2/2B^2
4 = B^2
Take the square root
±sqrt(4) = sqrt(B^2)
±2 = B
Using Euclid's algorithm, the first number you check is their difference:
60 - 48 = 12
Since 12 divides both numbers evenly, that is your GCF.
_____
If the difference does not divide both numbers evenly, you can repeat the procedure with the difference and the remainder from dividing the smallest of the other numbers by the difference. For example, ...
GCF(60, 44) = GCF(44 mod 16, 16) = GCF(12, 16) = 4
Answer:
y=4
y=−3
Step-by-step explanation:
Since these events are independent, you add the possibilities
the number of cards less than 9 is 32
the number of spades is 13
there are 52 cards in a deck, so you put those numbers over 52
32/52 + 13/52 = 45/52
the answer is 45/52
