Ask question

Ask question

All categories

3 years ago

14

Can you help me with this problem?

1 answer:

Vinil7 [7]3 years ago

5 0

Answer:

well I can't rlly answer measures

You might be interested in

The value of 7 in 17.92 is times as much value of 7 in 92.17

koban [17]

100
.. . . . . . . . .

3 0

3 years ago

Help please! Question is in picture

netineya [11]

39 ft of carpet

11x3+3x2=39

3 0

3 years ago

Write 2/5 and 1/3 as equivalent fractions using a common denominator

Len [333]

I believe the answer is 11/15 .

5 0

3 years ago

Read 2 more answers

Prove that $5^{3^n} + 1$ is divisible by $3^{n + 1}$ for all nonnegative integers $n.$

Viktor [21]

When $n=0$ , we have

$5^{3^0} + 1 = 5^1 + 1 = 6$

$3^{0 + 1} = 3^1 = 3$

and of course 3 | 6. ("3 divides 6", in case the notation is unfamiliar.)

Suppose this is true for $n=k$ , that

$3^{k + 1} \mid 5^{3^k} + 1$

Now for $n=k+1$ , we have

$5^{3^{k+1}} + 1 = 5^{3^k \times 3} + 1 \\\\ ~~~~~~~~~~~~~ = \left(5^{3^k}\right)^3 + 1^3 \\\\ ~~~~~~~~~~~~~ = \left(5^{3^k} + 1\right) \left(\left(5^{3^k}\right)^2 - 5^{3^k} + 1\right)$

so we know the left side is at least divisible by $3^{k+1}$ by our assumption.

It remains to show that

$3 \mid \left(5^{3^k}\right)^2 - 5^{3^k} + 1$

which is easily done with Fermat's little theorem. It says

$a^p \equiv a \pmod p$

where $p$ is prime and $a$ is any integer. Then for any positive integer $x$ ,

$5^3 \equiv 5 \pmod 3 \implies (5^3)^x \equiv 5^x \pmod 3$

Furthermore,

$5^{3^k} \equiv 5^{3\times3^{k-1}} \equiv \left(5^{3^{k-1}}\right)^3 \equiv 5^{3^{k-1}} \pmod 3$

which goes all the way down to

$5^{3^k} \equiv 5 \pmod 3$

So, we find that

$\left(5^{3^k}\right)^2 - 5^{3^k} + 1 \equiv 5^2 - 5 + 1 \equiv 21 \equiv 0 \pmod3$

QED

5 0

2 years ago

HELP!!BRAINLIEST AND 10 POINTS

leva [86]

Answer:

A

Step-by-step explanation:

I think that's da answer I hope it help ya

6 0

3 years ago