We stated that the number 561 is a Carmichael number, but we never checked that a561 ≡ a (mod 561) for every value of a. (a) The number 561 factors as 3 · 11 · 17. First use Fermat’s little theorem to prove that a561 ≡ a (mod 3), a561 ≡ a (mod 11), and a561 ≡ a (mod 17) for every value of a.

Then explain why these three congruences imply that a561 ≡ a (mod 561) for every value of a.

admin for giving such valuable information through your article . your article is much more similar to   word unscramble tool because it also provides a lot of knowledge of vocabulary new words with its meanings.

b. would be the answer : )

step-by-step explanation:

step 1: add -16x to both sides.

16x−4y+−16x=64+−16x  

−4y=−16x+64

step 2: divide both sides by -4.

−4y /-4 = -16x + 64/-4

answer:   y=4x−16

hope i'm right