Subcategories

• Module 3 Day 4 Challenge Part 1

  Choosing Squares on a Grid

  1
  Topics
  4
  Posts

  V

  @rz923 I bet that if anyone thought that if they are not equally shaped, then the answer MUST BE 0.............lol hahaha

• Module 3 Day 4 Challenge Part 2

  Casework Using Bounding Boxes

  0
  Topics
  0
  Posts
  No new posts.
• Module 3 Day 4 Challenge Part 3

  Casework Using Bounding Boxes

  1
  Topics
  3
  Posts

  T

  If someone can put this into stuff people can understand, that'd be great, but I'm not very good with code. So I'm just going to describe it.

  n = size of one dimension in square grid
  x = number of possible combinations in bounding box
  y = number of bounding boxes

  To find number of combinations in any given grid,
  start with the highest size bounding box possible, in which possibilities will equal $$ y \times n^2 $$

  For the next bounding box size, increase y by 1 and decrease n by 1. So like this:

  $$ y+1 \times (n - 1)^2 $$

  Keep adding and subtracting from one side until n = 1. Then, add all the products up.

• Module 3 Day 4 Your Turn Part 1

  Choosing Triangles on a Grid

  0
  Topics
  0
  Posts
  No new posts.
• Module 3 Day 4 Your Turn Part 2

  Casework Using Bounding Boxes

  2
  Topics
  4
  Posts

  P

  Why is it that (ii) is the best answer here. Should I be thinking that because this is a subcase of a given box dimension 1x2 , I need to keep the dimension fixed and consider the subcases ? Because to me at least (i) seems correct as well.

  f98224ae-9831-4bbd-b3d3-8e1f16ea19bc-image.png

• Module 3 Day 4 Your Turn Part 3

  Casework Using Bounding Boxes

  3
  Topics
  11
  Posts

  L

  Wait... the box is made of dots ands its 3 by 3... ok I just confuse myself

• Module 3 Day 4 Your Turn Part 4

  Casework Using Bounding Boxes

  1
  Topics
  2
  Posts

  D

  @divinedolphin Thank you for catching this! What you said sounds correct. We'll try to fix this ASAP.

• Module 3 Day 4 Your Turn Part 5

  Shortcut Solution

  5
  Topics
  15
  Posts

  P

  If we are trying to subtract the number of lines which aren't triangles for a question with a square of bigger dimensions (say a \(20 \times 20 \) square), wouldn't it be more tedious to count the number of lines rather than a \(3 \times 3 \) square? Is there a shortcut to count these "bad" 3 dot combinations?