New answers tagged

1

The answer might be this: Considering that the picture can be of any scale in all diagrams i.e. : each cross (axes) may have different scales as scales or markings are not mentioned.


0

Ι say it is The reason is:


0

The sequence of prime numbers follows the pattern below ›! The next number is 337. 263 4x+3 293 4x+1 313 4x+1 331 4x+3 337 4x+1


1

The sequence is: So a longer list includes:


2

No one seems to have made any progress, so here's the partial answer for 9:


6

A lower bound for the number of moves is because This can be done as follows:


5

We need for the following reason:


1

I agree with Dmitry Kamenetsky that this looks like a programming competition, so I won't at this time give algorithms, just results. Fully $\frac{1}{2}$ of the possible input have no solution. The longest optimal solution for $N$ integers is of length $\big\lfloor{\frac{N}{2}}\big\rfloor$. The bit about a cyclic right shift is deceptive. You can do both ...


1

The solution is: Explanation:


1

puzzle 39 Explanation: Looking at a row each tile is shifted once to the right and turned in a pattern like this: (squares becomes circles) (circles becomes triangles) (triangles becomes squares). The last column of a picture when its shifted towards the right: it shifts one downwards before appearing on the left side of the new picture.


Top 50 recent answers are included