Subcategories

• Day 9

  Repeating Patterns

  Module 5 Day 9 Challenge Part 1 Module 5 Day 9 Challenge Part 2 Module 5 Day 9 Challenge Part 3 Module 5 Day 9 Challenge Part 4 Module 5 Day 9 Challenge Part 5 Module 5 Day 9 Challenge Part 6 Module 5 Day 9 Your Turn Part 1 Module 5 Day 9 Your Turn Part 2 Module 5 Day 9 Your Turn Part 3 Module 5 Day 9 Your Turn Part 4
  4
  Topics
  7
  Posts

  P

  oops made the same mistake as po-shen loh
  so i learned that \(\phi(mn)=\phi(m)\cdot\phi(n)\) and i applied the fact on this problem and i got 4 😞
  is the phi function only multiplicative (as in the above equation) when \(\gcd(m,n)=1?\)

• Day 10

  Chinese Remainder Theorem

  Module 5 Day 10 Challenge Part 1 Module 5 Day 10 Challenge Part 2 Module 5 Day 10 Challenge Part 3 Module 5 Day 10 Challenge Part 4 Module 5 Day 10 Challenge Part 5 Module 5 Day 10 Challenge Part 6 Module 5 Day 10 Challenge Part 7 Module 5 Day 10 Your Turn Part 1 Module 5 Day 10 Your Turn Part 2 Module 5 Day 10 Your Turn Part 3
  3
  Topics
  7
  Posts

  西

  Okay, thanks! 🙂 @professionalbronco

• Day 11

  Not Relatively Prime

  Module 5 Day 11 Challenge Part 1 Module 5 Day 11 Challenge Part 2 Module 5 Day 11 Challenge Part 3 Module 5 Day 11 Challenge Part 4 Module 5 Day 11 Challenge Part 5 Module 5 Day 11 Your Turn Part 1 Module 5 Day 11 Your Turn Part 2
  2
  Topics
  4
  Posts

  P

  Why can't we just take mod 3 to solve the "Your Turn" problem? Taking mod 3 leads to contradiction, hence solved.

• Day 12

  More Remainders

  Module 5 Day 12 Challenge Part 1 Module 5 Day 12 Challenge Part 2 Module 5 Day 12 Challenge Part 3 Module 5 Day 12 Challenge Part 4 Module 5 Day 12 Challenge Part 5 Module 5 Day 12 Your Turn Part 1 Module 5 Day 12 Your Turn Part 2 Module 5 Day 12 Your Turn Part 3 Module 5 Day 12 Your Turn Part 4 Module 5 Day 12 Your Turn Part 5
  2
  Topics
  5
  Posts

  P

  @potato2017 I used the exact same method here, and it was pretty quick.