using Euclids division algorithm, find the largest number that divides 475 and 871 leaving 7 as the remainder in each case​

$30.32

step-by-step explanation:

65.00*.12=2.80

65.00-2.80=57.20

57.20*1.06=60.632

60.632/2=30.316

hi there!

first we need to find out how much they are adding to each number to make the next number.

ex: 4 + 4 = 8, 8 + 8 = 16, and so on.

so continuing with 32,

32 + 32 = 64

64 + 64 = 128

128 + 128 = 256

256 + 256 = 512

4, 8, 16, 32, 64, 128, 256, 512

the 8th term of the sequence will be 512

hope this ! ~

what is

step-by-step explanation:

soo this can be solve by using the formula:

f = p( 1 + i)^ n

where f is the future profit

p is the initial profit

i is the percent increase

n is the number of years

a . f = 30000 ( 1.05)^n

b. f = 30000 ( 1.05)^15

f = $62,368