Show your working

that

Number of smallest squares plus one
Question is retarded. You can make infinite patterns from a single data point

You can make infinite patterns from any number of data points

Don't you sass me Jimmy

The answer is 12.

It is a networking problem counting only nodes. Either it is drawn like shit and the corners aren't nodes or it is only nodes with some fancy name I can't fucking remember right now.

>Extrapolating from one datapoint

Let Q be "A square formed by four smaller squares: One top left (Q00), one top right (Q10), one bottom left (Q10) and one bottom right (Q11)." We know that Q = 5.

In the picture below we have 4 overlapping Q's. So if we ignored the overlap, we would have 4Q = 20.

Now, let's consider the overlap:
- The top left Q overlaps with its bottom right square (Q11).
- The top right Q overlaps with its bottom left square (Q01).
- The bottom left Q overlaps with its top right square (Q10).
- The bottom right Q overlaps with its top left square (Q00).

Now, when we combine Q11, Q01, Q10 and Q00, we get a single Q (straight from the definition).

Thus the answer is 4Q - Q = 3Q = 15.

fuck your retarded retardings

"1,2,_,_,_"
if you were ever asked to complete this pattern and it harmed you emotionally, i feel bad for you, but you can't go around the internet crying about it.

OP here. 11.25 is the correct answer. Why the fuck is Veeky Forums so bad at simple questions?