Help Using Fermats Little Theorem to solve this problem

[waycomgroup@gmail.com]

p is prime and (x+y) ≡ a^b + b^c mod p


Find a=?, b=?, c=?

 

[Deleted member 4993]

p is prime and (x+y) ≡ a^b + b^c mod p


Find a=?, b=?, c=?

f possible a few lines of explanation would help

Can you please tell us what is Fermat's Little theorem?

 

[waycomgroup@gmail.com]

Fermat's little theorem

Can you please tell us what is Fermat's Little theorem?

Fermat's little theorem states that if p is a prime number, then for any integer a, the number a ^p − a is an integer multiple of p.

For example, if a = 2 and p = 7, 2⁷ = 128, and 128 − 2 = 7 × 18 is an integer multiple of 7.

If a is not divisible by p, Fermat's little theorem is equivalent to the statement that a ^{p − 1} − 1 is an integer multiple of p

For example, if a = 2 and p = 7 then 2⁶ = 64 and 64 − 1 = 63 is a multiple of 7

 

[stapel]

Fermat's little theorem states that if p is a prime number, then for any integer a, the number a^p − a is an integer multiple of p. For example, if a = 2 and p = 7, 2⁷ = 128, and 128 − 2 = 7 × 18 is an integer multiple of 7.

If a is not divisible by p, Fermat's little theorem is equivalent to the statement that a^{p − 1} − 1 is an integer multiple of p. For example, if a = 2 and p = 7 then 2⁶ = 64 and 64 − 1 = 63 is a multiple of 7

Okay. Now, how have you attempted to apply this information? How far have you gotten? Where are you stuck?

Please be complete. Thank you!