I’m having trouble with this question. if anyone can answer it would mean a lot

Mathematics

1 answer:

natulia [17]3 years ago

4 0

Answer:

Step-by-step explanation:

x = - 48/-8 = 6

c = c^2/c^1 = c^(2-1) = c^1

d = d^4 / d^1 = d^(4 - 1) = d ^3

x = 6

e = 1

f = 3

You might be interested in

Using fermat's little theorem, find the least positive residue of $2^{1000000}$ modulo 17.

torisob [31]

Fermat's little theorem states that
$a^p$ ≡a mod p

If we divide both sides by a, then
$a^{p-1}$ ≡1 mod p
=>
$a^{17-1}$ ≡1 mod 17
$a^{16}$ ≡1 mod 17

Rewrite
$a^{1000000}$ mod 17 as
$=(a^{16})^{62500}$ mod 17
and apply Fermat's little theorem
$=(1)^{62500}$ mod 17
=>
$=(1)$ mod 17

So we conclude that
$a^{1000000}$ ≡1 mod 17

6 0

3 years ago

What number should be placed in the box to help complete the division calculation? can someone please do the problem (8587/12) s

disa [49]

Answer:

8587 should be in the box

Step-by-step explanation:

we would see it question as: 12/- 8587

12 goes into 85 7 times, so 7

12 goes into 18 1 time, so 1

12 goes into 67 5 times, so 5

then the remainder is 7