instruction stringlengths 15 30k |
|---|
**Step 1: solving most of the clues (advance warning: there are some errors but I fix them later)**
Across:
>!1. Twist more hearts around, with an audience (6)
>!3. BELOVED **LOVE in BED** _though I'm not convinced by "sex" as def for BED_ Your partner, like, in sex (7)
>!4. DR **double def** Drive, doc! (2) ... |
<sub>Most of this is is flavour, with a section of puns setting the scene at the start, and then the story itself in the middle. Scroll down for the actual puzzle. You may be interested to know that all the facts about the brain are true. </sub>
<sub>**Everything in this story is true, except for the bits that aren'... |
Three identical circles are placed such that they touch each other. A larger circle is drawn around the smaller circles such that it touches them, as shown in the diagram. Can you find the ratio between the radii of the smaller circles and the larger circle?
[![enter image description here][1]][1]
[1]: https:... |
I have a machine that can divide a square pie into 9 equal square pieces using 4 blades:
[![Square pie in 9 equal pieces][1]][1]
The blades can be moved, but there is only one control - which defines the width of the blades in both dimensions
We simply have to set the width, then place the centre of the pie a... |
My answer is:
>! Yes you can. When you can divide the cake into 3 equal pieces horizontally, you can cut the cake into 9 equal pieces. The side of the middle square will be $\frac {\sqrt\pi r} 3$
Proof?
>! It's obvious that one could divide the middle part into 3 equal pieces. The edge and the center will have are... |
My answer is:
>! Yes you can. When you can divide the cake into 3 equal pieces horizontally, you can cut the cake into 9 equal pieces. The side of the middle square will be $\frac {\sqrt\pi r} 3$
Proof?
>! It's obvious that one could divide the middle part into 3 equal pieces. The edge and the center will have are... |
Are there infinitely many integers with the property that the block of its first *k* digits (for all *k*, 1<=*k*<=*n*, where *n* is the number of its digits) is either divisible by *k* or a prime?
An example of such a number with 9 digits is 149,251,283.
If not, what is the largest number with this property? |
Is this an infinite family of numbers? |
Are there infinitely many integers with the property that the block of its first $k$ digits (for all $k$, $1\le k \le n$, where $n$ is the number of its digits) is either divisible by $k$ or a prime?
An example of such a number with nine digits is $149,\! 251,\! 283$.
If not, what is the largest number with this ... |
How many $n$-digit integers have the property that the first $k$ digits are divisible by $k$ for all $1\le k\le n$? |
Are there infinitely many integers with the property that the block of its first $k$ digits (for all $k$, $1\le k \le n$, where $n$ is the number of its digits) is either a prime number or is divisible by *k*?
An example of such a number with nine digits is $149,\! 251,\! 283$.
If not, what is the largest number ... |
How many $n$-digit integers have the property that the block of its first $k$ digits is a prime or divisible by $k$ for all $1\le k\le n$? |
Are there infinitely many integers with the property that the block of its first digits (for all , 1 ≤ ≤ , where is the number of its digits) is either a prime number or is divisible by ?
An example of such a number with nine digits is 149,251,283.
If not, what is the largest number with this property? |
How many -digit integers have the property that the block of its first digits is a prime or divisible by for all 1 ≤ ≤ ? |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
[Other puzzles in this series](https://puzzling.stackexchange.com/search?q=user%3A18250+%5Bsudoku%5D+title%3A%22SS%23%22)
---
---
... |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
---
Here's that crossword you asked for... Sorry, what's that - you didn't ask me for a crossword??
> **TASK: Solve the puzzle (COMPLETELY... |
Didn't you ask me for a crossword? |
[![enter image description here][1]][1]
[1]: https://i.stack.imgur.com/0w14E.png
How should black attack all the squares in chessboard that has no piece on it (unoccupied squares must be in check by black piece/s) with only ten legal moves for black? Start from position as shown. |
[![enter image description here][1]][1]
[1]: https://i.stack.imgur.com/0w14E.png
How should black attack all the squares that has no piece on it (any unoccupied squares must be in check by black piece/s) with only ten legal moves for black? Start from position as shown. |
<sup>An entry in [Fortnightly Topic Challenge #forty-seven: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
---
Here's that crossword you asked for... Sorry, what's that - you didn't ask me for a crossword??
> **TASK: Solve the puzzle (C... |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
[Other puzzles in this series](https://puzzling.stackexchange.com/search?q=user%3A18250+%5Bsudoku%5D+title%3A%22SS%23%22)
---
---
... |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
[Other puzzles in this series](https://puzzling.stackexchange.com/search?q=user%3A18250+%5Bsudoku%5D+title%3A%22SS%23%22)
---
---
... |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
[Other puzzles in this series](https://puzzling.stackexchange.com/search?q=user%3A18250+%5Bsudoku%5D+title%3A%22SS%23%22)
---
---
... |
I was doing crossword from NY Times, from Mon, Feb 11, 2019 by Howard Barkin + Will Shortz and I got the following clue.
> Went after
The answer is "HADAT". However, I can not find definition for HADAT that fits the clue.
Various links (ex. [reference](https://www.anagrammer.com/crossword/answer/hadat)) shows me... |
Why is “HADAT” the solution to the crossword clue "went after"? |
The clue is
> Message to go in the Times (5)
What is the answer? Please included explanations of wordplay/indicators in your answer. |
What is the answer to "Message to go in the Times (5)"? |
In the sea or in the sky
Sometimes also in your eye.
Melancholy feels like me
But energy I have plenty.
Into me you have vanished
Out of me you're astonished
What am I? |
In the sea or in the sky
Sometimes also in your eye.
Melancholy feels like me
But energy I have plenty.
Into me you have vanished
Out of me you're astonished
What am I? |
So this challenge is you have (don't have to) make the numbers 1 - 100 and I'm stuck on how to make 51. Can anyone help me?
P. S. You can use +, -, ÷, x, ! And others you can think of.
|
So this challenge is you have (don't have to) make the numbers 1 - 100 with the numbers 1, 3, 4, 6. I'm stuck on how to make 100. Can anyone help me?
P. S. You can use +, -, ÷, x, ! And others you can think of. |
So this challenge is you have (don't have to) make the numbers 1 - 100 by using the numbers 1, 3, 4, 6 only once. I'm stuck on how to make 100. Can anyone help me?
P. S. You can use +, -, ÷, x, ! And others you can think of. |
Partial Answer
Right Column
>! By mapping each rune to a letter that it looks similar to it (like the "Joshua" example), we get the following list of items:
>! 1. banana
>! 2. pendant
>! 3. chipmunk
>! 4. violin bow
>! 5. pipe
>! 6. tambourine
>! 7. shrimp
>! 8. three
>! 9. drumsticks ... |
As I commented already, I have a heuristic argument that
>! there is some largest number that satisfies the condition
because
>! for a length-k number, both the probability of being a multiple of k and being prime converges to zero as k increases.
Based on this belief, I quickly coded a program in Factor:
... |
"OK, so I know that you two are always arguing about what type of crosswords to do-<br> *'Normal crosswords are too boring!' 'Cryptics are too esoteric!!'* <br>Trivia vs wordplay, yeah, I've heard both sides. But, I've *also* heard that you BOTH love video games, so here's what I've done:
>Here are twenty crosswor... |
The puzzle is as follows:
[![Sketch of the problem][1]][1]
The alternatives given are:
1. 8 movements
2. 9 movements
3. 5 movements
4. 6 movements
This puzzle doesn't have an official answer. But I'm getting 9. But I don't know exactly if my answer is right or **reasonable**,
Does it exist a c... |
How to get the least number of flips to a plastic chips to get a certain figure? |
The puzzle is as follows:
[![Sketch of the problem][1]][1]
(Transcription with grammar errors fixed)
> A game consists of the following:
>
> The challenge is to flip the chips in such a way so that they are as in state 2. You start in state 1. A movement is valid when you flip a chip, and the two that are ne... |
> I got [prefix] [suffix] [infix] from washing the [whole].
>
> *P.S. I [infix] the [whole].*
The note above, when the gaps are filled, will be a grammatical and reasonable note.
What is the note? |
How to fill 1/3 of the cylinder? |
What do these three towns have in common?
"Dublin", "Blackpool", "Chernobyl". |
What do these three towns have in common? |
The puzzle is as follows:
[![Sketch of the problem][1]][1]
(Transcription with grammar errors fixed)
> A game consists of the following:
>
> The challenge is to flip the chips in such a way so that they are as in state 2. You start in state 1. A movement is valid when you flip a chip, and the two that are ne... |
The puzzle is as follows:
[![Sketch of the problem][1]][1]
(Transcription with grammar errors fixed)
> A game consists of the following:
>
> The challenge is to flip the chips in such a way so that they are as in state 2. You start in state 1. A movement is valid when you flip a chip, and the two that are ne... |
The puzzle is as follows:
> The figure from below shows a lock mechanism used to store sensitive
> data microfilms from a certain lab.
[![Sketch of the problem][1]][1]
> This mechanism is magnetic and consists in numbered buttons which
> allow them to be moved.
>
> The only valid movements are non-rotati... |
How to open the lock from this safe? |
Here are 6 places I visited in 2008:
[![enter image description here][1]][1]
Now tell me, **where was the Sun?**
[1]: https://i.stack.imgur.com/fmNu3.jpg |
My friend said to me:
> “In February of the year 1970 at 1:12 AM Ma turned 18. Ma turned 34 in
> February of the year 2002 at 2:16 AM. How is this possible?”
“And yes. Same Ma!” he ended with that.
|
Ma turned 34 in 2002. Really? |
The puzzle is as follows:
[![Sketch of the problem][1]][1]
(Transcription with grammar errors fixed)
> A game consists of the following:
>
> The challenge is to flip the chips in such a way so that they are as in state 2. You start in state 1. A movement is valid when you flip a chip, and the two that are ne... |
Gaby numbers her 21 students with the primes between 11 and 97. She now asks them to sit around a circle making sure that any two of them sitting next to each other have either their tens or units digit equal.
In how many essentially different ways can they so sit?
|
The following cryptic clues are in English, don't include punctuation, and have a theme (except for one minor exception) which will provide context for the definitions of the clue. There are two main sets of clues, and the answers from each set will reveal a word; each group of clues produces its own word and has its o... |
The puzzle is as follows:
> The figure from below shows a lock mechanism used to store sensitive
> data microfilms from a certain lab.
[![Sketch of the problem][1]][1]
> This mechanism is magnetic and consists in numbered buttons which
> allow them to be moved.
>
> The only valid movements are non-rotati... |
<sup>An entry in [Fortnightly Topic Challenge #forty-seven: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
---
Here's that crossword you asked for... Sorry, what's that - you didn't ask me for a crossword??
> **TASK: Solve the puzzle (C... |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
[Other puzzles in this series](https://puzzling.stackexchange.com/search?q=user%3A18250+%5Bsudoku%5D+title%3A%22SS%23%22)
---
---
... |
<sub>This is in the spirit of the [What is a Word/Phrase™][1] series inaugurated by [JLee][2] with his original [Phrase™][3] and [Word™][4] puzzles.
-----
If a phrase adheres to a certain rule, then I call it a Breech Phrase™.
Use the examples below to find the rule.
| BREECH PHRASES | NOT BREECH PH... |
Inspired by stack reader I gave my try on the puzzle:
>! ![][1]
>! I mapped the turns with guessing how long some of them were (aside from the 100 meters fixed turns, however we do not know how long it did take for the GPS to announce to turn in 100m?)
>! What resolved is the letters WNNP, could be also others... |
"Darling, can you please turn on the GPS?" I asked my wife.
"Hang on, I know exactly where we are", she replied.
"Can you, for once, listen to me?"
She ignored my remark, immersed in the reading of the map. This was not the first time we were going on a trip, and this was definitely not the first time we were ... |
All sides of a triangle T1 are shorter than the shortest side of a triangle T2.
Is it always possible to put triangle T1 completely inside triangle T2? |
What is this puzzle? |
I received a bag of wooden pieces, but cannot figure out what the puzzle is supposed to be. I've tried several burr options and several Alketruse puzzles, but cannot find the correct configuration. All pieces are the same. There are 23 total (not sure how many it should be because it could be several puzzles). What ... |
What is this burr puzzle with 23 identical wooden pieces? |
So this challenge is you have (don't have to) make the numbers 1 - 100 by using the numbers 1, 3, 4, 6 only once. I'm stuck on how to make 54. Can anyone help me?
P. S. You can use +, -, ÷, x, ! And others you can think of.
Thanks for helping me! I was really stuck on 100.
STOP SAYING THAT I FOUND THIS SOMEWH... |
So this challenge is you have (don't have to) make the numbers 1 - 100 by using the numbers 1, 3, 4, 6 only once. I'm stuck on how to make 54. Can anyone help me?
P. S. You can use +, -, ÷, x, ! And others you can think of.
Thanks for helping me! I was really stuck on 100.
STOP SAYING THAT I FOUND THIS SOMEWH... |
Let's have a 10x10 grid. We want to create a Sudoku in which, in each row, the pairs (a+b), (c+d), (e+f), (g+h), (i+j) add to one of the following numbers: 7, 9, 11, 13, or 15. Can you construct a complete 10x10 Sudoku fulfilling this requirement?
NOTE:The numbers in the grid are there for clarification only.
... |
Here's another way to solve this puzzle. We can actually proceed one digit at a time, and the middle column product trick (see below) seems *way* too neat to be a coincidence.
Step 1: Where can the 1 go?
* It can't be in the rightmost column (it's too small to be subtracted, and if it's added, the other two digit... |
Here's another way to solve this puzzle. We can actually proceed one digit at a time, and the middle column product trick (see below) seems *way* too neat to be a coincidence.
Step 1: Where can the 1 go?
* It can't be in the rightmost column (it's too small to be subtracted, and if it's added, the other two digit... |
Here's another way to solve this puzzle. We can actually proceed one digit at a time, and the middle column product trick (see below) seems *way* too neat to be a coincidence.
Step 1: Where can the 1 go?
* It can't be in the rightmost column (it's too small to be subtracted, and if it's added, the other two digit... |
Let's have a 10x10 grid. We want to create a Sudoku in which, in each row, the pairs (a+b), (c+d), (e+f), (g+h), (i+j) add to one of the following numbers: 7, 9, 11, 13, or 15. Can you construct a complete 10x10 Sudoku fulfilling this requirement?
NOTE: The numbers in the grid are there for clarification only.
... |
Here's another way to solve this puzzle. We can actually proceed one digit at a time, and the middle column product trick (see below) seems *way* too neat to be a coincidence.
Step 1: Where can the 1 go?
* It can't be in the rightmost column (it's too small to be subtracted, and if it's added, the other two digit... |
In chess puzzles, the objective of the puzzle is usually to checkmate the opponent using some form of novel strategy or tactic. For example, this puzzle [from chess.com](http://www.chess.com/forum/view/more-puzzles/mate-in-2-white-to-play) has white to play and mate in two.
![mate in two][1]
But [**this**](http... |
What chess position has the longest string of moves before mate? |
Finished grid
>! [![enter image description here][1]][1]
Lowercase clues
>! 1a. cyber-nations' golden fruit conceals one <s>fay</s> (NEW) crystal at its center — **au + tomat(i)o + n + \_s\_**
>! 12a. <s>mane</s> (HEAR) relative is not in favor of — **anti (~auntie)**
>! 13a. "gaze and <s>add</s> (ELL) f... |
There are 5 boxes labeled A, B, C, D and E. Each box contains a distinct number, but you don't know what it is. You can select three boxes and the Oracle will tell you which box contains the median* of the three selected numbers. How can you figure out which box contains the median of all 5 numbers? Can you do it in th... |
I saw this on a forum and no one knows how to solve it, and it's driving me crazy. Does anyone know what the solution is and why?
I tried looking at similarities in the columns, rows, and diagonals. I tried comparing everything to the top left or to the middle but that didn't help either. I tried seeing if there was a... |
How to solve this 3x3 dots and lines puzzle? |
<sub>This is in the spirit of the [What is a Word/Phrase™][1] series inaugurated by [JLee][2] with his original [Phrase™][3] and [Word™][4] puzzles.</sub>
If a phrase adheres to a certain rule, then I call it a Stair Word™.
Use the examples below to find the rule.
| Stair Words™ | Not Stair Words™ |
|:--... |
I saw this puzzle on Twitter by user @lilva_0419 and I personally feel that it is impossible to solve. Can you prove me wrong (or right)?
[Source on Twitter](https://twitter.com/lilva_0419/status/1352179126182952962)
[Try it online](http://pzv.jp/p.html?firefly/10/10/42b3.w11a31a2.b30k42b2021b11k1.b3.a21a33w10b3.... |
Hotaru Beam Puzzle: Is it impossible? |
My friend said to me:
> “In February of the year 1970 at 1:12 AM Ma turned 18. Ma turned 34 in
> February of the year 2002 at 2:16 AM. How is this possible?”
“And yes. Same Ma!” he ended with that.
Hint
> Specific times are important here
|
I have an answer:
>! Ma was born on February 29. She was 18 on 1970, which meant she was born on 1952. It was, in fact, a leap year. But 2002 wasn't. No more explanation needed, since the lep years add up exactly to the age. Plus, the clock is changed because of the fact that days get shorter in winter, which is aro... |
Ma turns something
>! every four seconds
This something
>! is unknown to us (at least to me) and doesn't need to be identified. It can be anything that can be turned.
>!
>! We only know that it is numbered from 1 at 00:00:04 to 21600 at midnight
That's why
>! - every day, at 1:12 she turns 18 (72 =... |
Eight clues are thematic and are clued by word-play only. Each of these eight clues's word-play has an extra letter which is not part of the answer. These letters cryptically indicate something, which when put together with the theme, one might expect to drink when enjoying the theme. This (three words, (7,9,3)) mus... |
Eight clues are thematic and are clued by word-play only. Each of these eight clues' word-play has an extra letter which is not part of the answer. These letters cryptically indicate something, which when put together with the theme, one might expect to drink when enjoying the theme. This (three words, (7,9,3)) must... |
Given the product codes of 10 fruits and vegetables in the chart below, can you figure out the product code of Broccoli?
| Fruit / Vegetable | Product Code™ |
|:------------------:|:-------------:|
| Lemon | CNL |
| Carrot | DSB |
| Plum | CAC ... |
<sup>An entry in [Fortnightly Topic Challenge #47: "Wacky Sudokus"](https://puzzling.meta.stackexchange.com/questions/7139/fortnightly-topic-challenge-47-wacky-sudokus)</sup>
[Other puzzles in this series](https://puzzling.stackexchange.com/search?q=user%3A18250+%5Bsudoku%5D+title%3A%22SS%23%22)
---
---
... |
Sudoku with no grid and no numbers!!? - SS#12 |
I can't figure this one out. Any help would be appreciated.
Can you determine the day that the story with each headline was published, as well as the number of interviews Janet did for each story and the visual aid that accompanied it?
1. Janet conducted 1 more interview for the story accompanied by the bar graph... |
I can't figure this one out. Any help would be appreciated.
Can you determine the day that the story with each headline was published, as well as the number of interviews Janet did for each story and the visual aid that accompanied it?
1. Janet conducted 1 more interview for the story accompanied by the bar graph... |
I can't figure this one out. Any help would be appreciated.
Journalist-in-training Janet Seymour's byline appeared in the *Carson City Chronicle* on six days last week. On each day (Monday through Saturday), she published a story under a different headline, each of which was based on a different number of interviews... |
I can't figure this one out. Any help would be appreciated.
Journalist-in-training Janet Seymour's byline appeared in the *Carson City Chronicle* on six days last week. On each day (Monday through Saturday), she published a story under a different headline, each of which was based on a different number of interviews... |
What is the largest number, which can build as a sequence (from left to right) of different two-digit primes only?
For example, 1371731 is valid, 137131 is invalid (containing 13 twice), 139717 is invalid (containing non-prime 39)
|
What is the largest number, which can built as a sequence (from left to right) of different two-digit primes only?
For example, 1371731 is valid, 137131 is invalid (containing 13 twice), 139717 is invalid (containing non-prime 39)
|
J.R.R. wrote about the dragon, thinking of these men.
Issur performed and challenged the locals to do a crossing, thinking of these men.
G.R.R. wrote about the killer of the giant, thinking of these men.
Single, splitted in two, first is latin, last is English. Present, not past!
Writing about all this in English i... |
<sub>This is in the spirit of the [What is a Word/Phrase™][1] series inaugurated by [JLee][2] with his original [Phrase™][3] and [Word™][4] puzzles.</sub>
If a phrase adheres to a certain rule, then I call it a Count Word™.
Use the examples below to find the rule.
| Count Words™ | Not Count Words™ |
|:--... |
I can't figure this one out. Any help would be appreciated.
Journalist-in-training Janet Seymour's byline appeared in the *Carson City Chronicle* on six days last week. On each day (Monday through Saturday), she published a story under a different headline, each of which was based on a different number of interviews... |
What is this puzzle with identical wooden pieces? |
> My prefix has a classy house, where no one lives.
>
> My infix is a sneaky vermin.
>
> My suffix is the past of consumption.
**What am I?** |
I can't figure this one out. Any help would be appreciated.
Journalist-in-training Janet Seymour's byline appeared in the *Carson City Chronicle* on six days last week. On each day (Monday through Saturday), she published a story under a different headline, each of which was based on a different number of interviews... |
I can't figure this one out. Any help would be appreciated.
Journalist-in-training Janet Seymour's byline appeared in the *Carson City Chronicle* on six days last week. On each day (Monday through Saturday), she published a story under a different headline, each of which was based on a different number of interviews... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.