Wordplay addition paradoxFarmer needs to get his word across the riverWordplay subtraction paradox9 letter word decompositionA 3 letter word whose permutations are wordsBridge words - word pairs linked by the front and backWhat's the longest concertina word you can find?Venetian word pairs (i.e., sectioned word reversals)Interlaced Word PairsHoliday cookies word attrition [humans only]Holiday cookies word attrition [computers welcome]Chrysanthemum bejeweled with dew dropsFarmer needs to get his word across the river
Operation Unz̖̬̜̺̬a͇͖̯͔͉l̟̭g͕̝̼͇͓̪͍o̬̝͍̹̻
How can I help our ranger feel special about her beast companion?
Credit card details stolen every 1-2 years. What am I doing wrong?
Improve quality of image bars
what relax command means?
A scene of Jimmy diversity
Is this artwork (used in a video game) real?
Can a Resident Assistant be told to ignore a lawful order?'
Why do so many pure math PhD students drop out or leave academia, compared to applied mathematics PhDs?
Is the purpose of sheet music to be played along to? Or a guide for learning and reference during playing?
Where are the rest of the Dwarves of Nidavellir?
What are the first usages of "thong" as a wearable item of clothing, both on the feet and on the waist?
Why does "git status" show I'm on the master branch and "git branch" does not in a newly created repository?
Is passive Investigation essentially truesight against illusions?
Interviewing with an unmentioned 9 months of sick leave taken during a job
How to find abandoned railways in Google Maps?
Increasing muscle power without increasing volume
Is straight-up writing someone's opinions telling?
Get node ID or URL in Twig on field level
Why does FFmpeg choose 10+20+20 ms instead of an even 16 ms for 60 fps GIF images?
How to check if a new username is a system user?
Sending a photo of my bank account card to the future employer
How can electric field be defined as force per charge, if the charge makes its own, singular electric field?
Create Array from list of indices/values
Wordplay addition paradox
Farmer needs to get his word across the riverWordplay subtraction paradox9 letter word decompositionA 3 letter word whose permutations are wordsBridge words - word pairs linked by the front and backWhat's the longest concertina word you can find?Venetian word pairs (i.e., sectioned word reversals)Interlaced Word PairsHoliday cookies word attrition [humans only]Holiday cookies word attrition [computers welcome]Chrysanthemum bejeweled with dew dropsFarmer needs to get his word across the river
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words from which you can remove a chunk, then insert a different chunk with different letters, and get the original word again?
What the heck am I talking about?!
There are actually thousands of such examples. I'm just looking for a general description of the pattern that creates this strange phenomenon.
(Too easy? Too hard? Try the counterpart subtraction paradox.)
wordplay pattern
$endgroup$
add a comment |
$begingroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words from which you can remove a chunk, then insert a different chunk with different letters, and get the original word again?
What the heck am I talking about?!
There are actually thousands of such examples. I'm just looking for a general description of the pattern that creates this strange phenomenon.
(Too easy? Too hard? Try the counterpart subtraction paradox.)
wordplay pattern
$endgroup$
add a comment |
$begingroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words from which you can remove a chunk, then insert a different chunk with different letters, and get the original word again?
What the heck am I talking about?!
There are actually thousands of such examples. I'm just looking for a general description of the pattern that creates this strange phenomenon.
(Too easy? Too hard? Try the counterpart subtraction paradox.)
wordplay pattern
$endgroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words from which you can remove a chunk, then insert a different chunk with different letters, and get the original word again?
What the heck am I talking about?!
There are actually thousands of such examples. I'm just looking for a general description of the pattern that creates this strange phenomenon.
(Too easy? Too hard? Try the counterpart subtraction paradox.)
wordplay pattern
wordplay pattern
asked 8 hours ago
SlowMagicSlowMagic
2,0964 silver badges33 bronze badges
2,0964 silver badges33 bronze badges
add a comment |
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
I assume that
"with different letters" means only that the sequence of letters isn't the same, rather than that the (multi)set of letters isn't, because otherwise the thing seems to be genuinely impossible unless there's some sort of lateral-thinking nonsense going on.
In that case
D(ESP)ERATE can lose ESP to make DERATE and then gain SPE to make DE(SPE)RATE again. Or R(ESIGN)ED can lose ESIGN to make RED and then gain SIGNE to make RE(SIGNE)D again.
The general picture here is
that you have words ABCBD and ABD where A,B,C,D are arbitrary strings of letters. The easiest cases (as above) have B a single letter, but I bet there are some where B is longer. At any rate, you're then removing BC and inserting CB or vice versa.
[EDITED to add:]
Yes, B can certainly be longer. For instance, BANYANS can lose ANY and gain YAN or vice versa. Or consider HONEYMOONED; you can lose ONEYMO making HONED and then gain YMOONE to get HONEYMOONED again.
$endgroup$
1
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
add a comment |
$begingroup$
Are you talking about...
words that have the pattern "...X(...X)...", where X is any letter and
()marks the chunk to remove? For example, you can takeNINout ofFANNINGto getFANG, then addNNI into the middle of it to getFANNING` again.
$endgroup$
add a comment |
$begingroup$
One suggestion
From
DECENT
You can remove the chunk
EC
and get
DENT
But if now you had the different chunk
CE
You can come back to the first word,
DECENT
$endgroup$
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
add a comment |
$begingroup$
Here is one
HANDSOME, from which you can remove ANDS to get HOME
and
add jumbled SAND to HOME to get HANDSOME again.
Few more are:
M(ORE)OVER, B(RACEL)ET
$endgroup$
add a comment |
$begingroup$
I'm pretty sure it's easy to understand what the OP is talking about if you've tried to solve this question before. :)
Solution:
If the word is [Left][Old chunk][Right], the new chunk must be added from somewhere else, splitting the left or right part into two. Let's say it consists of five parts, as in [I][II][Old chunk][III][IV] (I or IV can be empty):
If [I][II][Old chunk][III][IV] = [I][New chunk][II][III][IV],
[II][Old chunk] = [New chunk][II] ([Old chunk] is made up of [V][II], [New chunk] of [II][V])
If [I][II][Old chunk][III][IV] = [I][II][III][New chunk][IV],
[Old chunk][III] = [III][New chunk] ([Old chunk] is made up of [III][V], [New chunk] of [V][III])
$endgroup$
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "559"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f86247%2fwordplay-addition-paradox%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I assume that
"with different letters" means only that the sequence of letters isn't the same, rather than that the (multi)set of letters isn't, because otherwise the thing seems to be genuinely impossible unless there's some sort of lateral-thinking nonsense going on.
In that case
D(ESP)ERATE can lose ESP to make DERATE and then gain SPE to make DE(SPE)RATE again. Or R(ESIGN)ED can lose ESIGN to make RED and then gain SIGNE to make RE(SIGNE)D again.
The general picture here is
that you have words ABCBD and ABD where A,B,C,D are arbitrary strings of letters. The easiest cases (as above) have B a single letter, but I bet there are some where B is longer. At any rate, you're then removing BC and inserting CB or vice versa.
[EDITED to add:]
Yes, B can certainly be longer. For instance, BANYANS can lose ANY and gain YAN or vice versa. Or consider HONEYMOONED; you can lose ONEYMO making HONED and then gain YMOONE to get HONEYMOONED again.
$endgroup$
1
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
add a comment |
$begingroup$
I assume that
"with different letters" means only that the sequence of letters isn't the same, rather than that the (multi)set of letters isn't, because otherwise the thing seems to be genuinely impossible unless there's some sort of lateral-thinking nonsense going on.
In that case
D(ESP)ERATE can lose ESP to make DERATE and then gain SPE to make DE(SPE)RATE again. Or R(ESIGN)ED can lose ESIGN to make RED and then gain SIGNE to make RE(SIGNE)D again.
The general picture here is
that you have words ABCBD and ABD where A,B,C,D are arbitrary strings of letters. The easiest cases (as above) have B a single letter, but I bet there are some where B is longer. At any rate, you're then removing BC and inserting CB or vice versa.
[EDITED to add:]
Yes, B can certainly be longer. For instance, BANYANS can lose ANY and gain YAN or vice versa. Or consider HONEYMOONED; you can lose ONEYMO making HONED and then gain YMOONE to get HONEYMOONED again.
$endgroup$
1
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
add a comment |
$begingroup$
I assume that
"with different letters" means only that the sequence of letters isn't the same, rather than that the (multi)set of letters isn't, because otherwise the thing seems to be genuinely impossible unless there's some sort of lateral-thinking nonsense going on.
In that case
D(ESP)ERATE can lose ESP to make DERATE and then gain SPE to make DE(SPE)RATE again. Or R(ESIGN)ED can lose ESIGN to make RED and then gain SIGNE to make RE(SIGNE)D again.
The general picture here is
that you have words ABCBD and ABD where A,B,C,D are arbitrary strings of letters. The easiest cases (as above) have B a single letter, but I bet there are some where B is longer. At any rate, you're then removing BC and inserting CB or vice versa.
[EDITED to add:]
Yes, B can certainly be longer. For instance, BANYANS can lose ANY and gain YAN or vice versa. Or consider HONEYMOONED; you can lose ONEYMO making HONED and then gain YMOONE to get HONEYMOONED again.
$endgroup$
I assume that
"with different letters" means only that the sequence of letters isn't the same, rather than that the (multi)set of letters isn't, because otherwise the thing seems to be genuinely impossible unless there's some sort of lateral-thinking nonsense going on.
In that case
D(ESP)ERATE can lose ESP to make DERATE and then gain SPE to make DE(SPE)RATE again. Or R(ESIGN)ED can lose ESIGN to make RED and then gain SIGNE to make RE(SIGNE)D again.
The general picture here is
that you have words ABCBD and ABD where A,B,C,D are arbitrary strings of letters. The easiest cases (as above) have B a single letter, but I bet there are some where B is longer. At any rate, you're then removing BC and inserting CB or vice versa.
[EDITED to add:]
Yes, B can certainly be longer. For instance, BANYANS can lose ANY and gain YAN or vice versa. Or consider HONEYMOONED; you can lose ONEYMO making HONED and then gain YMOONE to get HONEYMOONED again.
answered 8 hours ago
Gareth McCaughan♦Gareth McCaughan
76.9k3 gold badges191 silver badges295 bronze badges
76.9k3 gold badges191 silver badges295 bronze badges
1
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
add a comment |
1
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
1
1
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
$begingroup$
Thank you for your clarification. Yes, I only meant that the sequence of letters isn't the same, not the set of letters used. (It would be truly magical to remove a chunk containing a letter "J", then insert a chunk that does not contain any "J" and expect to get the same original word back again, wouldn't it?) The phrasing was studiously nonspecific to avoid giving any unintentional hints.
$endgroup$
– SlowMagic
7 hours ago
add a comment |
$begingroup$
Are you talking about...
words that have the pattern "...X(...X)...", where X is any letter and
()marks the chunk to remove? For example, you can takeNINout ofFANNINGto getFANG, then addNNI into the middle of it to getFANNING` again.
$endgroup$
add a comment |
$begingroup$
Are you talking about...
words that have the pattern "...X(...X)...", where X is any letter and
()marks the chunk to remove? For example, you can takeNINout ofFANNINGto getFANG, then addNNI into the middle of it to getFANNING` again.
$endgroup$
add a comment |
$begingroup$
Are you talking about...
words that have the pattern "...X(...X)...", where X is any letter and
()marks the chunk to remove? For example, you can takeNINout ofFANNINGto getFANG, then addNNI into the middle of it to getFANNING` again.
$endgroup$
Are you talking about...
words that have the pattern "...X(...X)...", where X is any letter and
()marks the chunk to remove? For example, you can takeNINout ofFANNINGto getFANG, then addNNI into the middle of it to getFANNING` again.
answered 8 hours ago
Deusovi♦Deusovi
69.3k7 gold badges238 silver badges303 bronze badges
69.3k7 gold badges238 silver badges303 bronze badges
add a comment |
add a comment |
$begingroup$
One suggestion
From
DECENT
You can remove the chunk
EC
and get
DENT
But if now you had the different chunk
CE
You can come back to the first word,
DECENT
$endgroup$
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
add a comment |
$begingroup$
One suggestion
From
DECENT
You can remove the chunk
EC
and get
DENT
But if now you had the different chunk
CE
You can come back to the first word,
DECENT
$endgroup$
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
add a comment |
$begingroup$
One suggestion
From
DECENT
You can remove the chunk
EC
and get
DENT
But if now you had the different chunk
CE
You can come back to the first word,
DECENT
$endgroup$
One suggestion
From
DECENT
You can remove the chunk
EC
and get
DENT
But if now you had the different chunk
CE
You can come back to the first word,
DECENT
answered 8 hours ago
EvargaloEvargalo
3,5151 gold badge10 silver badges27 bronze badges
3,5151 gold badge10 silver badges27 bronze badges
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
add a comment |
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
$begingroup$
Creative! (+1) :P
$endgroup$
– Mr Pie
3 hours ago
add a comment |
$begingroup$
Here is one
HANDSOME, from which you can remove ANDS to get HOME
and
add jumbled SAND to HOME to get HANDSOME again.
Few more are:
M(ORE)OVER, B(RACEL)ET
$endgroup$
add a comment |
$begingroup$
Here is one
HANDSOME, from which you can remove ANDS to get HOME
and
add jumbled SAND to HOME to get HANDSOME again.
Few more are:
M(ORE)OVER, B(RACEL)ET
$endgroup$
add a comment |
$begingroup$
Here is one
HANDSOME, from which you can remove ANDS to get HOME
and
add jumbled SAND to HOME to get HANDSOME again.
Few more are:
M(ORE)OVER, B(RACEL)ET
$endgroup$
Here is one
HANDSOME, from which you can remove ANDS to get HOME
and
add jumbled SAND to HOME to get HANDSOME again.
Few more are:
M(ORE)OVER, B(RACEL)ET
answered 5 hours ago
Mea Culpa NayMea Culpa Nay
6,7251 gold badge6 silver badges39 bronze badges
6,7251 gold badge6 silver badges39 bronze badges
add a comment |
add a comment |
$begingroup$
I'm pretty sure it's easy to understand what the OP is talking about if you've tried to solve this question before. :)
Solution:
If the word is [Left][Old chunk][Right], the new chunk must be added from somewhere else, splitting the left or right part into two. Let's say it consists of five parts, as in [I][II][Old chunk][III][IV] (I or IV can be empty):
If [I][II][Old chunk][III][IV] = [I][New chunk][II][III][IV],
[II][Old chunk] = [New chunk][II] ([Old chunk] is made up of [V][II], [New chunk] of [II][V])
If [I][II][Old chunk][III][IV] = [I][II][III][New chunk][IV],
[Old chunk][III] = [III][New chunk] ([Old chunk] is made up of [III][V], [New chunk] of [V][III])
$endgroup$
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
add a comment |
$begingroup$
I'm pretty sure it's easy to understand what the OP is talking about if you've tried to solve this question before. :)
Solution:
If the word is [Left][Old chunk][Right], the new chunk must be added from somewhere else, splitting the left or right part into two. Let's say it consists of five parts, as in [I][II][Old chunk][III][IV] (I or IV can be empty):
If [I][II][Old chunk][III][IV] = [I][New chunk][II][III][IV],
[II][Old chunk] = [New chunk][II] ([Old chunk] is made up of [V][II], [New chunk] of [II][V])
If [I][II][Old chunk][III][IV] = [I][II][III][New chunk][IV],
[Old chunk][III] = [III][New chunk] ([Old chunk] is made up of [III][V], [New chunk] of [V][III])
$endgroup$
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
add a comment |
$begingroup$
I'm pretty sure it's easy to understand what the OP is talking about if you've tried to solve this question before. :)
Solution:
If the word is [Left][Old chunk][Right], the new chunk must be added from somewhere else, splitting the left or right part into two. Let's say it consists of five parts, as in [I][II][Old chunk][III][IV] (I or IV can be empty):
If [I][II][Old chunk][III][IV] = [I][New chunk][II][III][IV],
[II][Old chunk] = [New chunk][II] ([Old chunk] is made up of [V][II], [New chunk] of [II][V])
If [I][II][Old chunk][III][IV] = [I][II][III][New chunk][IV],
[Old chunk][III] = [III][New chunk] ([Old chunk] is made up of [III][V], [New chunk] of [V][III])
$endgroup$
I'm pretty sure it's easy to understand what the OP is talking about if you've tried to solve this question before. :)
Solution:
If the word is [Left][Old chunk][Right], the new chunk must be added from somewhere else, splitting the left or right part into two. Let's say it consists of five parts, as in [I][II][Old chunk][III][IV] (I or IV can be empty):
If [I][II][Old chunk][III][IV] = [I][New chunk][II][III][IV],
[II][Old chunk] = [New chunk][II] ([Old chunk] is made up of [V][II], [New chunk] of [II][V])
If [I][II][Old chunk][III][IV] = [I][II][III][New chunk][IV],
[Old chunk][III] = [III][New chunk] ([Old chunk] is made up of [III][V], [New chunk] of [V][III])
edited 2 hours ago
answered 3 hours ago
NautilusNautilus
4,1126 silver badges26 bronze badges
4,1126 silver badges26 bronze badges
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
add a comment |
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
$begingroup$
Ha, thanks for noticing! Yes, these "paradoxical" observations came out of my work on that river-crossing puzzle.
$endgroup$
– SlowMagic
1 hour ago
add a comment |
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f86247%2fwordplay-addition-paradox%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown