/sci/ - Science & Math

>>5328060
Most information for plebeians regarding this topic is filtered through feminist writers/journalists, so most plebeians immediately associate any discussion of single gender breeding with these insane extremists.

>km
>km
>km

jesus christ, I'm struggling with this fucking geometry course.

Yea, I know you won't answer the HW problems, I'm just asking for a push in the right direction because I'm fucking completely lost on how to go about answering this problem.

here it is:
You have at your disposal three types of tiles, all the same color: 1 x 1, 1 x 2, and 2 x 2 (the units are in feet). Areas to tile are in integer feet along each dimension, so it is not necessary to cut any tiles to completely cover the floor area. Sometimes your floor area is rectangular (that is, m x nfeet, where m and n are both integers but are not equal to one another) and sometimes your floor area is square (that is, n x n feet, where n is an integer). You offer your clients as many different designs as possible to fit the area, so it is important that you establish a means of identifying all nonequivalent tile patterns.
· How many unique patterns—patterns that are unique even after rotations or reflections—can you design using these tiles for floor areas 4 x 4, 4 x 5, 5 x 5, and 4 x 6 feet?
What techniques would you use to enumerate the various possibilities, and how can you classify them?

I figured that I could use something like Bernside's counting theorem, but it seems like there are hundreds of different patterns that could be made with this. I tried simplifying it to just algebra, but the problem I have is, how do you account for when you block spaces that are needed to place the 2x2, and 1x2 blocks? You could have 4 spots that are 1x1 and thus unable to place 1x2 squares down anymore, but there would be no way of knowing that...

i'm just confused and am fed up with this question.

>>4066225
How cute is he? I'd kind of fuck him.
>mfw I'm a male engineer