How to prove this congruent proof?

  • Thread starter jy02354441
  • Start date
  • #1
jy02354441
2
0
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
2021 Award
5,220
1,176
I'm assuming that's ak-1 and not ak-1. Do you know what the rules are for multiplication modulo n?
 

Suggested for: How to prove this congruent proof?

Replies
10
Views
439
Replies
1
Views
463
Replies
15
Views
3K
  • Last Post
Replies
5
Views
600
Replies
5
Views
851
  • Last Post
Replies
1
Views
196
Replies
14
Views
377
Replies
1
Views
467
  • Last Post
Replies
4
Views
665
  • Last Post
Replies
12
Views
352
Top