How to prove this congruent proof?

  • Thread starter jy02354441
  • Start date
  • #1
If a is congruent to b mod n and a^k−1 is congruent to b^k−1 mod n, then a^k is congruent to b^k mod n.? n>0 and k>1

How to prove it by induction?
 

Answers and Replies

  • #2
Office_Shredder
Staff Emeritus
Science Advisor
Gold Member
4,109
278
I'm assuming that's ak-1 and not ak-1. Do you know what the rules are for multiplication modulo n?
 

Related Threads on How to prove this congruent proof?

  • Last Post
Replies
2
Views
4K
  • Last Post
Replies
1
Views
9K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
7
Views
10K
Top