Given that a≡b(modm), aⁿ≡bⁿ(modm) [Mathematical Induction Proof for Further Pure Mathematics 2]

Mathematics Proofs - GCSE & A Level

clock arithmetic clock arithmetic proof clock arithmetic proofs further pure mathematics further pure mathematics proofs further pure maths further pure maths number further pure maths proof further pure maths proofs mathematical induction mathematical induction proof clock arithmetic mathematical induction proof modular arithmetic modular arithmetic modular arithmetic proof modular arithmetic proofs number theory further pure maths

description

In this video I demonstrate how to show, that if a≡b(modm) then aⁿ≡bⁿ(modm) using mathematical induction. These workings can be used for Further Pure Mathematics 2.

If you have any questions related to this video, pop them into the comments section and I will respond as soon as I can.

This video was created by:

https://www.twitter.com/tiago_hands

For more mathematics content, check out:

https://www.threads.net/@mathematics.proofs

https://www.instagram.com/mathematics.proofs

Thanks for watching this video and make sure you have subscribed if you want to see more videos like this! ... https://www.youtube.com/watch?v=31lcZekvNnA

created

2023-10-30

staked

0.0 LBC

license

Copyrighted (contact publisher)

File size

16600669 Bytes