Datasets:
mlfoundations-dev
/
stackoverflow_puzzling

Dataset card Data Studio Files
xet
 Community
instruction
stringlengths
15
30k
M.Gardner in his book "Mathematical puzzles and diversions" states that the following 2x4 map $$ \begin{array}{|c|c|} \hline 1 &\space\space & \space\space & \space\space \\ \hline \space\space & \space\space & \space\space & \space\space\\ \hline \end{array} $$ can be folded in 40 different ways ...
M.Gardner in his book "Mathematical puzzles and diversions" states that the following 2x4 map $$ \begin{array}{|c|c|} \hline 1 & \phantom{1} & \phantom{1} & \phantom{1} \\ \hline \phantom{1} & \phantom{1} & \phantom{1} & \phantom{1} \\ \hline \end{array} $$ can be folded in 40 different ways (along...
A rod of unit length is broken into $n$ pieces, what is the expected length of the longest piece? The positions at which the rod is broken are chosen randomly uniformly. This is a generalization of a puzzle I recently encountered, the answer to which I do not know myself:
Well we can easily rephrase the question as follows (the subtractor being $k + (k - 1) / 2$ obviously for $\bmod k$): $$\begin{align} (n - 1) \equiv 0 & \mod 2 \\ (n - 3) \equiv 0 & \mod 3 \\ (n - 10) \equiv 0 & \mod 5 \\ (n - 21) \equiv 0 & \mod 7 \\ (n - 45) \equiv 0 & \mod 10 \\ \end...
I am looking for hints to find the solution of this puzzle: > There is a kingdom with a square shape with sides of length 1. The castle is located at the center of the square. At the castle the king lives under the protection of one soldier. There are other soldiers, but each soldier is at his own house. Houses are ...
Here is the solution I found. Please tell, if you see any mistakes. Let's call $M'$ maximum number of jokers, which can be among group of chosen $N'$ man according to our knowledge. Our start group will include all men, $N' = N$. Our knowledge is that $K+M=N, K>M$, therefore $M'= (N-1)/2$. The goal is to find...
Here is the solution I found. Please tell, if you see any mistakes. Let's call $M'$ maximum number of jokers, which can be among group of chosen $N'$ man according to our knowledge. Our start group will include all men, $N' = N$. Our knowledge is that $K+M=N, K>M$, therefore $M'= (N-1)/2$. The goal is to find...
> There are $N$ men. $K$ of them are knights, $M$ of them are jokers. > $N$ is known, $K$ and $M$ are unknown. You know that: $K + M = N$, $K \gt M$, $M \ge 1$, $N$ is odd. > Knights always tell the truth, jokers can tell whatever they want. All $N$ people know who is who. You go to anyone of them and ask him a ...
The minimum number of questions of the special form “Person $i$, is Person $j$ a knight?” that will guarantee to find everyone's identity is $3(N-1)/2$. This was first proved by P. Blecher in <a href="http://www.sciencedirect.com/science/article/pii/0012365X83900262">this paper</a>. Suppose we know for sure that at...
This is not the answer, but just one step forwards it. Here I'm making an attempt to find as many as possible ways to fold the map. I number the cells according to positions they would take at the resulting 1x1 folder map, counting from top to bottom. Notations: H - fold along horizontal line; VI - fold along ...
This is not the answer, but just one step forwards it. Here I'm making an attempt to find as many as possible ways to fold the map. I number the cells according to positions they would take at the resulting 1x1 folder map, counting from top to bottom. Notations: H - fold along horizontal line; VI - fold along ...
This is not the answer, but just one step forwards it. Here I'm making an attempt to find as many as possible ways to fold the map. I number the cells according to positions they would take at the resulting 1x1 folder map, counting from top to bottom. Notations: H - fold along horizontal line; VI - fold along ...
This is not the answer, but just one step forward it. Here I'm making an attempt to find as many as possible ways to fold the map. I number the cells according to positions they would take at the resulting 1x1 folder map, counting from top to bottom. Notations: H - fold along horizontal line; VI - fold along I...
![Isaac Asimov's Science Fiction Magazine, spring 1977][cover] I found the following puzzle by Martin Gardner in an archived copy of _[Isaac Asimov's Science Fiction Magazine][arch]_. I've heard it before, but in a more vulgar setting, involving condoms instead of gloves. > The first earth colony on Mars has been...
> Let 1A stand for the insides of the first pair of gloves, 1B for the outsides. Let 2A stand for the insides of the second pair, 2B for the outsides. &nbsp; >! Dr. Xenophon wears both pairs, the second on top of the first. Sides 1A and 2B may become contaminated. Sides 1B and 2A remain sterile. Dr. Ypsilanti wea...
This is not the answer, but just one step forward it. I give here 23 ways to fold the map + idea how to find more. I number the cells according to positions they would take at the resulting 1x1 folder map, counting from top to bottom. Notations: H - fold along horizontal line; VI - fold along I-th vertical lin...
- Juan's strategy is simple: if he has to choose between opponents, then his shot *will* turn it into a two-man contest, and he will have to survive a shot before he can kill the second man. So of course he will shoot Jose first. - José's strategy, similarly, is to shoot at Juan. Leaving Juan alive and Jorge dead ca...
The answer to whether this could be brute forced is yes. However, would it be feasible to brute force the answer? Probably not. Let's look at why: A chessboard has 64 squares — 32 white, and 32 black. Removing one of each color gives us 32^2, or 1024 possible ways to arrange it. However, there are 4 lines of symmetr...
If you play two games, your chance is $ p^2$. If you play four, your chance is $p^4+4p^3(1-p)$, which becomes greater when $p\gt \frac 13 $. If you play six games, your chance is $p^6+6p^5(1-p)+15p^4(1-p)^2$, which is better than four games when $p \gt \frac 25$ It is tempting to conjecture that you should play $2n...
![grid][1] If one were to work through the way you describe (each player taking into account only the previous players plan), then a 12 unit loop would quickly be observed. Case $M=2$ is the same as case $M=14$ which is the same as case $M=26$ etc. This doesn't really help anything. This loop does not yield a per...
If four 2s make eight, and three 2s also make eight, how many 2s do you need to make three eights, when you only have less than eight 8s?
If four 2s make eight, and three 2s also make eight, how many 2s do you need to make three eights, when you only have less than eight 2s?
I've already shown how you can force my other answer to fail. Hopefully this one will not have such an exploit. - Step 1: First knight goes to the extreme house on the map. (Equivalent to just going the the north house if there is a house there.) (Maximum time $\frac{\sqrt{2}}{2}$) For a sometimes faster ...
Following this question http://puzzling.stackexchange.com/questions/186/whats-the-fewest-weights-you-need-to-balance-any-weight-from-1-to-40-pounds I am interested what is the minimum number M of weights you need to **define** any integer weight from a) 1 to 40? b) 1 to N? For example, if N = 2, M = 1. Indeed, wi...
Can someone help me solve this pattern puzzle?
![image][1] Here's a rough MathJax rendering: $$ \begin{array}{|ccc|c|ccc|c|ccc|} \; & 41 & \; & \; & \; & 31 & \; & \; & \; & ? & \; \\ 5 & \; & 6 & \; & 9 & \; & 4 & \; & 8 & \; & 7 \\ 7 & \; & 8 & \; & 2 & \; & 6 & \; & 2 & \; & 6 \\ \end{array} \\ a. 51 \\ b. 62 \\ c. 48 \\ d. 53 \\ $$...
*(Note: This answer is a work in progress. See [relevant meta discussion](http://meta.puzzling.stackexchange.com/q/1283/1622) if you would rather answers such as this did not exist.)* I don't like complicated things so I immediately chose to solve some simple variants of this problem before scaling up to the full de...
Suppose there are $n$ ants on a stick which has length 10. At any time, the ants may be facing _left_ or _right_, the initial directions of the ants are arbitrary. At time 0, all ants start moving in the direction they're facing at speed 1. Each time an ant collides with another ant, both ants reverse direction i...
This question is purely a follow-up to http://puzzling.stackexchange.com/questions/1784/maximum-time-for-ants-to-fall-off-stick/. Suppose there are $n$ ants on a stick which has length 10. At any time, the ants may be facing left or right, the initial directions of the ants are arbitrary. At time 0, all ants star...
Suppose there are $n$ ants on a stick which has length 10. At any time, the ants may be facing _left_ or _right_, the initial directions of the ants are arbitrary. At time 0, all ants start moving in the direction they're facing at speed 1. Each time an ant collides with another ant, both ants reverse direction i...
Suppose there are $n$ ants on a stick which has length 1. At any time, the ants may be facing _left_ or _right_, the initial directions of the ants are arbitrary. Each ant can be modeled as a point in the stick. At time 0, all ants start moving in the direction they're facing at speed 1. Each time an ant collides...
This question is purely a follow-up to http://puzzling.stackexchange.com/questions/1784/maximum-time-for-ants-to-fall-off-stick/. Suppose there are $n$ ants on a stick which has length 10. At any time, the ants may be facing left or right, the initial directions of the ants are arbitrary. At time 0, all ants star...
What is the number of Chinese parking spot?
I believe the most obvious answer is: >! There is usual sequence of numbers, we just look on it from wrong place. >! The shown numbers must be: 86,??,88,89,90,91. Therefore the answer is "**87**".
I believe the most obvious answer is: >! There is usual sequence of numbers, we just look on it from wrong place. The numbers of parking spots must be wived from inside of the parking, as a driver would see them. >! The shown numbers must be: 86,??,88,89,90,91. Therefore the answer is "**87**".
I believe the most obvious answer is: >! There is a usual sequence of numbers, we're just looking at it in the wrong direction. The numbers of the parking spots must be viewed from the outside in, as a driver would see them, which is upside-down from the current view.<br /> <br /> >! The shown numbers are: 86, ??, ...
This question is purely a follow-up to http://puzzling.stackexchange.com/questions/1784/maximum-time-for-ants-to-fall-off-stick/. Suppose there are $n$ ants on a stick which has length 10. At any time, the ants may be facing left or right, the initial directions of the ants are arbitrary. At time 0, all ants star...
![image][1] Here's a rough MathJax rendering: > This question is based upon the figure shown below. $$ \begin{array}{|ccc|c|ccc|c|ccc|} \; & 41 & \; & \; & \; & 31 & \; & \; & \; & ? & \; \\ 5 & \; & 6 & \; & 9 & \; & 4 & \; & 8 & \; & 7 \\ 7 & \; & 8 & \; & 2 & \; & 6 & \; & 2 & \; & 6 \\ \e...
![image][1] > This question is based upon the figure shown below. > > $$ \begin{array}{|ccc|c|ccc|c|ccc|} \; & 41 & \; & \; & \; & 31 & \; & \; & \; & ? & \; \\ 5 & \; & 6 & \; & 9 & \; & 4 & \; & 8 & \; & 7 \\ 7 & \; & 8 & \; & 2 & \; & 6 & \; & 2 & \; & 6 \\ \end{array} \\ a. 51 \\ b. 62 \\ ...
[Soccer World Cup](http://www.fifa.com/worldcup/matches/) is in progress, so that warrants a themed question (though just a bit late, as group stage is over now - oh well): > Is your number both valid and not less than a number of points that a team got after finishing a group stage match in which they scored at lea...
[Wimbledon](http://www.wimbledon.com/index.html) is in progress, so let's put that to good use: > Is your number less than a number of sets played in a straight-set win in a Wimbledon tennis match? Women win in 2 sets, men in 3 sets. 1 -> yes 2 -> maybe 3 -> no
Suppose you have twelve identical-looking balls. Ten of them are the same weight, but one is slightly lighter and one slightly heavier, in such a way that the weight of the lighter and heavier ball add up to exactly the weight of two of the equal-weight balls. What is the minimum number of weighings on a two-sided s...
There is another way to do this problem, that doesn't involve any sort of conditional branching at all. It is in fact possible to set a fixed weighing schedule beforehand and still determine which ball is lighter or heavier in just 3 weighings. I'll explain how below. ----- The gist of problems like these is, how...
**Notation** <br> We need to have some notation for the algorithms. We use: - \$U\$ for the upper layer and \$u\$ for the middle upper layer. - \$R\$ for the right layer and \$r\$ for the middle right layer. - \$L\$ for the right layer and \$l\$ for the middle left layer. - \$F\$ for the front layer and \...
**Notation** <br> We need to have some notation for the algorithms. We use: - $U$ for the upper layer and $u$ for the middle upper layer. - $R$ for the right layer and $r$ for the middle right layer. - $L$ for the right layer and $l$ for the middle left layer. - $F$ for the front layer and $f$ for the mid...
The question reads: **From the given pattern, What comes in place of '?'** ![enter image description here][1] [1]: https://i.stack.imgur.com/JImq8.jpg
The following problem is found in the first Norwegian arithmetic, published in 1645 by Tyge Hansøn: Three hundred oxen large and small, A cattle owner wanted to buy: 3 for 63 daler he got. Again, he let them sell, 3 for 63 daler they fetched, both slim and fat. 787$1\over 2$ daler was his profit. ...
The following problem is found in the first Norwegian arithmetic, published in 1645 by Tyge Hansøn: Three hundred oxen large and small, A cattle owner wanted to buy: 3 for 63 daler he got. Again, he let them sell, 3 for 63 daler they fetched, both slim and fat. 787$1\over 2$ daler was his profit. ...
This is a small generalization of well known [12 balls][1] puzzle: > You are given two-sided scale and some number of balls. All balls have the same weight but one. It is of a different weight, although you don't know whether it's lighter or heavier. You are allowed to do only 3 weighings to determine not only what ...
This is a small generalization of well known [12 balls][1] puzzle: > You are given two-sided scale and some number of balls. All balls have the same weight but one. It is of a different weight, although you don't know whether it's lighter or heavier. You are allowed to do only 3 weighings to determine not only what ...
This question has been written in order to help answer http://puzzling.stackexchange.com/questions/548/fastest-way-to-collect-an-arbitrary-army. There is a 1 x 1 square area with corners labelled clockwise A, B, C and D. A finite number of stationary robots are spread out across the area. Every robot knows where e...
How long is needed to clear the area of robots?
The problem in modern English might be stated as follows: > A farmer wanted to buy three hundred oxen. He bought them at a price of $3$ oxen for $\$63$. > Afterwards, he sold the oxen at $3$ for $\$63$ as well, but managed to make a profit of $\$787.50$. > How did he manage this? At first blush, as you said...
The problem in modern English might be stated as follows: > A farmer wanted to buy three hundred oxen. He bought them at a price of $3$ oxen for $\$63$. > Afterwards, he sold the oxen at $3$ for $\$63$ as well, but managed to make a profit of $\$787.50$. > How did he manage this? At first blush, as you said...
The problem in modern English might be stated as follows: > A farmer wanted to buy three hundred oxen. He bought them at a price of $3$ oxen for $\$63$. > Afterwards, he sold the oxen at $3$ for $\$63$ as well, but managed to make a profit of $\$787.50$. > How did he manage this? At first blush, as you said...
Here is more complicated http://puzzling.stackexchange.com/questions/626/paying-the-troll-toll like puzzle: > Between you and your destination, you have 7 bridges, and there is a troll under every bridge. Each troll, quite rightly, insists that you pay a troll toll. Before you can cross the $K$-th bridge, you have...
The following problem is found in the first Norwegian arithmetic, published in 1645 by Tyge Hansøn: Three hundred oxen large and small, A cattle owner wanted to buy: 3 for 63 daler he got. Again, he let them sell, 3 for 63 daler they fetched, both slim and fat. 787$1\over 2$ daler was his profit. ...
Here is more complicated http://puzzling.stackexchange.com/questions/626/paying-the-troll-toll like puzzle: > Between you and your destination, you have 7 bridges, and there is a troll under every bridge. Each troll, quite rightly, insists that you pay a troll toll. Before you can cross the $K$-th bridge, you have...
Suppose you've rigged the church charity lottery so that you cannot lose (what a swell guy you are). There are 10 drawings, and you start off with 10 dollars exactly. At each drawing, you must chose an amount to bet, and that amount gets put into a pool (that money then can no longer be used to wager). You then pr...
This is basically a question of partitioning - which partition of $n$ generates the largest product? Let's establish the rules that our partition should follow: 1) It doesn't make sense to make a partition of 1, that won't increase the product. We'd rather make another partition one larger. Better to have $2,3$ t...
This is basically a question of partitioning - which partition of $n$ generates the largest product? Let's establish the rules that our partition should follow: 1) It doesn't make sense to make a partition of 1, that won't increase the product. We'd rather make another partition one larger. Better to have $2,3$ t...
Here is more complicated http://puzzling.stackexchange.com/questions/626/paying-the-troll-toll like puzzle: > Between you and your destination, you have 7 bridges, and there is a troll under every bridge. Each troll, quite rightly, insists that you pay a troll toll. Before you can cross the $K$-th bridge, you have...
On HuDoKu's page on Uniqueness, under [Unique Rectangle](http://hodoku.sourceforge.net/en/tech_ur.php#un2), it says > A common mistake when looking for URs is to violate the "2 blocks" rule (see the [Sudopedia article](http://www.sudopedia.org/wiki/Unique_Rectangle) for an example). Unfortunately, the Sudopedia l...
Could this be an alternative link? [Unique Rectangles](http://www.sudokuwiki.org/Unique_Rectangles) If you end up with the 2 blocks like this (and you've filled in all other boxes) then either: * the setter has not created a sudoku with a unique solution * or you have gone wrong somewhere. I don't think tha...
Could this be an alternative link? [Unique Rectangles](http://www.sudokuwiki.org/Unique_Rectangles) The link is saying that if you end up with the 2 blocks like this (the four pink boxes can only have either 1 or 2 in them, "MadOverlord" named this Unique Rectangle pattern the Deadly Pattern apparently!): ![enter...
This is a puzzle I remember arguing with my sister about when we were little...<br /> (Not quite as loud (or as public!) as the Monty Hall argument we had.) You have two large beakers of the same size.<br /> Beaker A is half filled with blue sand.<br /> Beaker B is half filled with red sand. * You take a cup ...
How much red sand and how much blue sand?
Suppose you've rigged the church charity lottery so that you cannot lose (what a swell guy you are). There are 10 drawings, and you start off with 10 dollars exactly. At each drawing, you must chose an amount to bet, and that amount gets put into a pool (that money then can no longer be used to wager). You then pr...
Suppose you've rigged the church charity lottery so that you cannot lose (what a swell guy you are). There are 10 drawings, and you start off with 10 dollars exactly. At each drawing, you must chose an amount to bet, and that amount gets put into a pool (that money then can no longer be used to wager). You then pr...
Suppose you've rigged the church charity lottery so that you cannot lose (what a swell guy you are). There are 10 drawings, and you start off with 10 dollars exactly. At each drawing, you must chose an amount to bet, and that amount gets put into a pool (that money then can no longer be used to wager). You then pr...
Let's put the number of coins at $c$ and see what happens if we increase $n$. We'll number the pirates from meekest ($1$) to fiercest ($n$). $\begin{array}{rrrll} \begin{array}{c}\text{Nr. of pirates}\end{array} & \begin{array}{c}\text{Pirate} \\ \text{meekest to fiercest}\end{array} & \begin{array}{c}\tex...
I am thinking of an odd number , does your number divide the number I am thinking of? 1 -> yes 2 -> no 3 -> maybe
The question I would ask is this (where $n$ is the number you are thinking of): > Is $\lim_{x \to n} \frac{1}{x-2} > 0$ (where we are approaching $n$ from either the left or the right)? The possible answers are: - If $n = 1$: $\frac{1}{1-2} = -$, so the answer is **"No"**. - If $n = 2$: $\lim_{x \to 2^+} \fra...
I have a set of encyclopaedias on my bookshelf, beautifully bound and neatly arranged with volume 1 on the left and volume 32 on the right. They were a talking point when I bought them 30-odd years ago and were regularly used, but as the internet took off so my use of them declined, preferring to use the online resourc...
A nomad is injured in the desert. And he can't move, but fortunately an oasis is nearby, and he can stay there for enough time until rescue arrives. But the water is a magical water, that it can't be stored. So it should be drunk immediately or it'll disappear. In other words, one cannot bring the water outside the oas...
A nomad is injured in the desert. And he can't move, but fortunately an oasis is nearby, and he can stay there for enough time until rescue arrives. But the water is a magical water, that it can't be stored. So it should be drunk immediately or it'll disappear. In other words, one cannot bring the water outside the oas...
### Background Story A nomad is injured in the desert. And he can't move, but fortunately an oasis is nearby, and he can stay there for enough time until rescue arrives. But the water is a magical water, that it can't be stored. So it should be drunk immediately or it'll disappear. In other words, one cannot bring t...
There are $N$ letters in an alphabet. There is a combination lock, the code to it consists from $M$ different letters. You can input $M$ letters combination and try to open the lock. (But you can't check the lock unless you have inputted all $M$ letters). If you guess at least $M-1$ letters from the code correctl...
Suppose you are allowed to use all digits (0,1,2,...9) but each only ones and any arithmetic operations ($-$,$+$,$\times$, \ ) any number of times and you can create numbers from digits writing them together. What is the minimal natural number, which you can not write?
What is the minimal natural number, which can not be written using arithmetics and without digit repetitions?
Suppose you are allowed to use all digits (0,1,2,...9) but each only ones and any arithmetic operations ($-$,$+$,$\times$, \ ) any number of times and you can create numbers from digits writing them together. What is the smallest natural number, which you can not write? For example, you can write: $6 = 1+2+3$ ...
What is the smallest integer, which can not be written using arithmetics and without digit repetitions?
Suppose you are allowed to use all digits (0,1,2,...9) but each only ones and any arithmetic operations ($-$,$+$,$\times$,$\div$) any number of times and you can create numbers from digits writing them together. What is the smallest natural number, which you can not write? For example, you can write: $6 = 1+2+3$ ...
> Suppose you are allowed to use all digits (0,1,2,...9), each only ones; arithmetic operations ($-$,$+$,$\times$,$\div$), any number of times; and you can create numbers from digits writing them together. > What is the smallest natural number, which you would not be able to write? For example, you can write: ...
> Suppose you are allowed to use all 10 digits (0,1,2,...9), each only ones; 4 arithmetic operations ($-$,$+$,$\times$,$\div$), each any number of times; and you can create numbers from digits writing them together. > What is the smallest natural number, which you would not be able to write? For example, you can ...
What is the smallest positive integer, which can not be written without repetitions of digits and using arithmetics only?
> Suppose you are allowed to use all 10 digits (0,1,2,...9) at most once each; 4 arithmetic operations ($-$,$+$,$\times$,$\div$), each any number of times; and you can create numbers from digits by writing them together. > What is the smallest natural number which you would not be able to write? For example, you ...
> Suppose you are allowed to use all 10 digits (0,1,2,...9) at most once each; 4 arithmetic operations ($-$,$+$,$\times$,$\div$), each any number of times; parenthesises to group operations; and you can create numbers from digits by writing them together. > What is the smallest natural number which you would not be ...
> Suppose you are allowed to use all 10 digits (0,1,2,...9) at most once each; 4 arithmetic operations ($-$,$+$,$\times$,$\div$), each any number of times; parenthesises to group operations; and you can create numbers from digits by writing them together. > What is the smallest natural number which you would not be ...
It is impossible. Suppose you have drawn such a line and follow it from one room to another. Since you must use each door you must have a look at each room out of 5. What are these rooms? You can start at some room, and finish at another room. You will need to go through the rest 3 rooms (if you entry it you alwa...
In the interest of crowd-sourcing the brute forcing, I've made a google spreadsheet with the list of the 4765 numbers from 1 to 9999 which can't be formed by simple concatenation. Please pick a couple of them and work out solutions. [Spreadsheet](https://docs.google.com/spreadsheets/d/1oCv8zImAWJ4k-VOKRlVWQp5d58zA_...
It is impossible. Suppose you have drawn such a line and follow it from one room to another. Since you must use each door you must have a look at each room out of 5. What are these rooms? One room you can start at, and another room you can finish at. These rooms will involve an odd number of door-uses. You will n...
It is impossible. 1. Suppose you have drawn such a line and follow it from one room to another. Since you must use each door you must have a look at each room out of 5. What are these rooms? 2. There will be 3 (at least) rooms you always go through (in and out of) 3 rooms. If you enter it you always exit it lat...
It is impossible. 1. Suppose you have drawn such a line and follow it from one room to another. Since you must use each door you must have a look at each room out of 5. What are these rooms? 2. There will be 3 (at least) rooms you always go through - if you enter it you always exit it later. Indeed, one room...
It is impossible. 1. Suppose you have drawn such a line and follow it from one room to another. Since you must use each door you must have a look at each room out of 5. What are these rooms? 2. There will be 3 (at least) rooms you always go through - if you enter it you always exit it later. Indeed, 1 (at mo...
There is a puzzle which I remember from many years ago which can be summarised as > It is easy to arrange 20 items in four rows of five items, but how could you arrange just 10 items in four rows of five items? The answer is this (spoiler-protected for those of you who want to try to solve it first): >! ![ente...
What's the more general case of this puzzler?
There is a puzzle which I remember from many years ago which can be summarised as > It is easy to arrange 20 items in five rows of four items, but how could you arrange just 10 items in five rows of four items? The answer is this (spoiler-protected for those of you who want to try to solve it first): >! ![ente...
> The solution for this test is 1. But what is the pattern? >![enter image description here][1] P.S. I checked that 1 is the answer by simply trying different options in the test itself (Russian site for the test is here: http://sly2m.com/sly2m/IQ ) [1]: https://i.stack.imgur.com/QCBmB.jpg
What is the pattern in this puzzle from IQ test?