Original post by Merdan
Prove that ax≡ay(modn)
is equivalent to the congruence x≡y(modn/d) if gcd(a,n)=d
is equivalent to the congruence x≡y(modn/d) if gcd(a,n)=d
Well? What have you done?
Quick Reply
Related discussions
- 2022 Edexcel Maths GCSE (Higher) Checklist
- GCSE Diary
- Job offer won't accept my proof of address
- opening a bank account
- Maths - GCSE
- Teenagers find an "impossible" proof of Pythagoras' Theorem
- student finance
- Recursion Q
- How can I obtain a proof of income for a rental application?
- Student loan, residence and covid lockdown
- Proof of work experience
- uploading GCSE and A levels certificates
- National insurance number
- Gap year applicants.
- Paperwork for uni
- A-level Edexcel Maths - Proofs
- Provisional licence application
- This offer is subject to you obtaining
- A2 maths Proof by Contradiction
- Lying about living out on student finance
Latest
Trending
Last reply 2 days ago
Did Cambridge maths students find maths and further maths a level very easy?Last reply 2 weeks ago
Edexcel A Level Mathematics Paper 2 unofficial mark scheme correct me if wrongMaths
71
Trending
Last reply 2 days ago
Did Cambridge maths students find maths and further maths a level very easy?Last reply 2 weeks ago
Edexcel A Level Mathematics Paper 2 unofficial mark scheme correct me if wrongMaths
71
