Subcategories

• Day 13

  Polygon Angles

  Module 0 Day 13 Challenge Part 1

  Module 0 Day 13 Challenge Part 2

  Module 0 Day 13 Challenge Part 3

  Module 0 Day 13 Challenge Part 4

  Module 0 Day 13 Challenge Part 5

  Module 0 Day 13 Your Turn Part 1
  4
  Topics
  14
  Posts

  

  No offence but can you make the pic less messy so I can read it? I don't have good eyesight.

• Day 14

  Telescoping Sum

  Module 0 Day 14 Challenge Part 1

  Module 0 Day 14 Challenge Part 2

  Module 0 Day 14 Challenge Part 3

  Module 0 Day 14 Your Turn Part 1
  1
  Topics
  2
  Posts

  

  @angeliccanary Yep, that's exactly how you would rigorously prove that a pattern exists!

  Just a really small note- for the proof, it actually doesn't strictly matter that n(n-1) is the LCD; we can still algebraically set n(n-1) to be the common denominator no matter what. This is sort of like how we can write 1/2 + 3/5 as 22/20, even though technically it's 11/10 simplified. You're right that n(n-1) is the LCD because the numerator becomes 1, though

  Great job!

• Day 15

  Beehive Paths

  Module 0 Day 15 Challenge Part 1

  Module 0 Day 15 Challenge Part 2

  Module 0 Day 15 Challenge Part 3

  Module 0 Day 15 Your Turn Part 1

  Module 0 Day 15 Your Turn Part 2

  Module 0 Day 15 Your Turn Part 3

  Module 0 Day 15 Your Turn Part 4

  Module 0 Day 15 Your Turn Part 5
  2
  Topics
  7
  Posts

  

  1, 1, 2, 3, 5, 8, 13, 21 and so on add the 2 numbers given for example 13 and 21 is 34

• Day 16

  Square Remainders

  Module 0 Day 16 Challenge Part 1

  Module 0 Day 16 Challenge Part 2

  Module 0 Day 16 Challenge Part 3

  Module 0 Day 16 Your Turn Part 1

  Module 0 Day 16 Your Turn Part 2
  2
  Topics
  3
  Posts

  

  Joke alert :
  Poor 3... it was so close to 4 but it didn’t even get to be the remainder when 4 is divided by the sum of two perfect squares.

  PS the two Number Theory problems are really cool!