Menu
News
All News
Dungeons & Dragons
Level Up: Advanced 5th Edition
Pathfinder
Starfinder
Warhammer
2d20 System
Year Zero Engine
Industry News
Reviews
Dragon Reflections
White Dwarf Reflections
Columns
Weekly Digests
Weekly News Digest
Freebies, Sales & Bundles
RPG Print News
RPG Crowdfunding News
Game Content
ENterplanetary DimENsions
Mythological Figures
Opinion
Worlds of Design
Peregrine's Nest
RPG Evolution
Other Columns
From the Freelancing Frontline
Monster ENcyclopedia
WotC/TSR Alumni Look Back
4 Hours w/RSD (Ryan Dancey)
The Road to 3E (Jonathan Tweet)
Greenwood's Realms (Ed Greenwood)
Drawmij's TSR (Jim Ward)
Community
Forums & Topics
Forum List
Latest Posts
Forum list
*Dungeons & Dragons
Level Up: Advanced 5th Edition
D&D Older Editions, OSR, & D&D Variants
*TTRPGs General
*Pathfinder & Starfinder
EN Publishing
*Geek Talk & Media
Search forums
Chat/Discord
Resources
Wiki
Pages
Latest activity
Media
New media
New comments
Search media
Downloads
Latest reviews
Search resources
EN Publishing
Store
EN5ider
Adventures in ZEITGEIST
Awfully Cheerful Engine
What's OLD is NEW
Judge Dredd & The Worlds Of 2000AD
War of the Burning Sky
Level Up: Advanced 5E
Events & Releases
Upcoming Events
Private Events
Featured Events
Socials!
EN Publishing
Twitter
BlueSky
Facebook
Instagram
EN World
BlueSky
YouTube
Facebook
Twitter
Twitch
Podcast
Features
Top 5 RPGs Compiled Charts 2004-Present
Adventure Game Industry Market Research Summary (RPGs) V1.0
Ryan Dancey: Acquiring TSR
Q&A With Gary Gygax
D&D Rules FAQs
TSR, WotC, & Paizo: A Comparative History
D&D Pronunciation Guide
Million Dollar TTRPG Kickstarters
Tabletop RPG Podcast Hall of Fame
Eric Noah's Unofficial D&D 3rd Edition News
D&D in the Mainstream
D&D & RPG History
About Morrus
Log in
Register
What's new
Search
Search
Search titles only
By:
Forums & Topics
Forum List
Latest Posts
Forum list
*Dungeons & Dragons
Level Up: Advanced 5th Edition
D&D Older Editions, OSR, & D&D Variants
*TTRPGs General
*Pathfinder & Starfinder
EN Publishing
*Geek Talk & Media
Search forums
Chat/Discord
Menu
Log in
Register
Install the app
Install
Upgrade your account to a Community Supporter account and remove most of the site ads.
Rocket your D&D 5E and Level Up: Advanced 5E games into space! Alpha Star Magazine Is Launching... Right Now!
Community
General Tabletop Discussion
*TTRPGs General
Best...Puzzle...Ever....
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
<blockquote data-quote="Tiefling" data-source="post: 1345953" data-attributes="member: 251"><p>I got the same answer as everyone else, using the following algorithm:</p><p></p><p>[spoiler]Equation of Death - # of Killings to Go at the End - Highest Remaining # at the End - Calibration Number</p><p></p><p>(Calibration Number is 0 if the first remaining number in the next round will be killed, 1 if the second remaining number in the next round will be killed.)</p><p></p><p>1+n*2 - 499 - 1000 - 0</p><p>2+n*4 - 249 - 1000 - 0</p><p>4+n*8 - 124 - 1000 - 0</p><p>8+n*16 - 61 - 992 - 1</p><p>32+n*32 - 30 - 976 - 1</p><p>48+n*32 - 0 - 976 - N/A</p><p></p><p>In which n is and integer on [0,Previous Remaining Killings Minus One]. Each line can be arrived at by taking the previous line and performing some simple logic and arithmetic. Crude, I know, but it works and takes about 5 minutes.[/spoiler]</p><p></p><p></p><p>Concerning the 52 card problem-</p><p></p><p>[spoiler]Take 13 cards from the deck to form the second pile, and flip them all over. If you subtract x turned cards from the first pile it has 13-x turned cards. Since the second pile had 13-x rightside-up cards, it now has 13-x turned cards. Equal.[/spoiler]</p><p></p><p>Concerning the Evil Villain, Secret Numbers problem-</p><p></p><p>[spoiler]Poor villain. He managed to A) imprison two lightning-fast number theorists and B) pick exactly the wrong pair of numbers.</p><p></p><p>This problem requires that a few ground rules be laid out to determine the validity of a pair of numbers. But first, let me define a few terms for this problem: a "sumoid" is any pair of numbers whose sum is a desired number. A "productoid" is any pair of numbers whose product is a desired number. A sumoid of a productoid is a sumoid of the number that the productoid pair adds to. A productoid of a sumoid is a productoid of the number that the sumoid pair multiplies to. Whew!</p><p></p><p>1. A and B cannot both be prime, for obvious reasons.</p><p></p><p>2. None of the sumoids of A can be both prime, as Person A could not be sure that it was a false sumoid and/or that Person B could not factor it.</p><p></p><p>3. [For every false productoid of B, there must be at least one sumoid of that productoid that is a pair of prime numbers. This cannot apply to the true productoid of B.] This allows Person B to eliminate those false productoids upon hearing that Person A knew he could not factor B, leaving only the true productoid, (X,Y).</p><p></p><p>4. Rule 3 does not apply to any of the false sumoids of A. That is, if you have a false sumoid (c,d) then either zero or two or more of its productoids lack any prime sumoids, but never exactly one. This allows Person A to locate the false sumoids of A when informed of Person B's success.</p><p></p><p>This could also be written as follows:</p><p></p><p>1. X and Y are both integers on [2,99]</p><p>2. X /= prime OR Y /= prime</p><p>3. X+Y = A</p><p>4. X*Y = B</p><p>5. A-q /= prime OR q /= prime where q is any integer on [2,A-2]</p><p>6. B/C = D where C is any integer on [2,B/2] EXCEPT X or Y</p><p>7. C+D-q = prime AND q = prime for at least one integer q on [2,C+D-2]</p><p>8. E(A-E) = F where E is any integer on [2,A-2] EXCEPT X or Y</p><p>9. F/G = H where G is any divisor of F on [2,F/2]</p><p>10.G+H-q = prime and q = prime for either ZERO or TWO OR MORE possible integers q on [2,G+H-2]</p><p></p><p>So the sequence goes like this:</p><p></p><p>1. Person A finds that none of the sumoids of A are both prime, meaning that Person B could not possibly factor B into its true productoid without more information.</p><p>2. Person B finds that one of B's productoids has a sum with no prime sumoids, while all the other productoids have at least one such sumoid.</p><p>3. Person A tells Person B that Person B could not have found the answer.</p><p>4. Person B deduces that only the productoid with a sum producing no prime sumoids could be correct, as all the others would lead to uncertainty in Person B. He announces his success.</p><p>5. Person A figures out what Person B deduced, and finds that it only works on the sumoid of A that correspond to with Rule 3, not those that correspond to Rule 4. He determines what the true sumoid is, and also announces his success.</p><p></p><p>The rules allow a program to be written for or a bored mathematician to be prodded into examining each of the 9604 possible combinations in turn until finding one that works. But I'm not about to try.[/spoiler]</p></blockquote><p></p>
[QUOTE="Tiefling, post: 1345953, member: 251"] I got the same answer as everyone else, using the following algorithm: [spoiler]Equation of Death - # of Killings to Go at the End - Highest Remaining # at the End - Calibration Number (Calibration Number is 0 if the first remaining number in the next round will be killed, 1 if the second remaining number in the next round will be killed.) 1+n*2 - 499 - 1000 - 0 2+n*4 - 249 - 1000 - 0 4+n*8 - 124 - 1000 - 0 8+n*16 - 61 - 992 - 1 32+n*32 - 30 - 976 - 1 48+n*32 - 0 - 976 - N/A In which n is and integer on [0,Previous Remaining Killings Minus One]. Each line can be arrived at by taking the previous line and performing some simple logic and arithmetic. Crude, I know, but it works and takes about 5 minutes.[/spoiler] Concerning the 52 card problem- [spoiler]Take 13 cards from the deck to form the second pile, and flip them all over. If you subtract x turned cards from the first pile it has 13-x turned cards. Since the second pile had 13-x rightside-up cards, it now has 13-x turned cards. Equal.[/spoiler] Concerning the Evil Villain, Secret Numbers problem- [spoiler]Poor villain. He managed to A) imprison two lightning-fast number theorists and B) pick exactly the wrong pair of numbers. This problem requires that a few ground rules be laid out to determine the validity of a pair of numbers. But first, let me define a few terms for this problem: a "sumoid" is any pair of numbers whose sum is a desired number. A "productoid" is any pair of numbers whose product is a desired number. A sumoid of a productoid is a sumoid of the number that the productoid pair adds to. A productoid of a sumoid is a productoid of the number that the sumoid pair multiplies to. Whew! 1. A and B cannot both be prime, for obvious reasons. 2. None of the sumoids of A can be both prime, as Person A could not be sure that it was a false sumoid and/or that Person B could not factor it. 3. [For every false productoid of B, there must be at least one sumoid of that productoid that is a pair of prime numbers. This cannot apply to the true productoid of B.] This allows Person B to eliminate those false productoids upon hearing that Person A knew he could not factor B, leaving only the true productoid, (X,Y). 4. Rule 3 does not apply to any of the false sumoids of A. That is, if you have a false sumoid (c,d) then either zero or two or more of its productoids lack any prime sumoids, but never exactly one. This allows Person A to locate the false sumoids of A when informed of Person B's success. This could also be written as follows: 1. X and Y are both integers on [2,99] 2. X /= prime OR Y /= prime 3. X+Y = A 4. X*Y = B 5. A-q /= prime OR q /= prime where q is any integer on [2,A-2] 6. B/C = D where C is any integer on [2,B/2] EXCEPT X or Y 7. C+D-q = prime AND q = prime for at least one integer q on [2,C+D-2] 8. E(A-E) = F where E is any integer on [2,A-2] EXCEPT X or Y 9. F/G = H where G is any divisor of F on [2,F/2] 10.G+H-q = prime and q = prime for either ZERO or TWO OR MORE possible integers q on [2,G+H-2] So the sequence goes like this: 1. Person A finds that none of the sumoids of A are both prime, meaning that Person B could not possibly factor B into its true productoid without more information. 2. Person B finds that one of B's productoids has a sum with no prime sumoids, while all the other productoids have at least one such sumoid. 3. Person A tells Person B that Person B could not have found the answer. 4. Person B deduces that only the productoid with a sum producing no prime sumoids could be correct, as all the others would lead to uncertainty in Person B. He announces his success. 5. Person A figures out what Person B deduced, and finds that it only works on the sumoid of A that correspond to with Rule 3, not those that correspond to Rule 4. He determines what the true sumoid is, and also announces his success. The rules allow a program to be written for or a bored mathematician to be prodded into examining each of the 9604 possible combinations in turn until finding one that works. But I'm not about to try.[/spoiler] [/QUOTE]
Insert quotes…
Verification
Post reply
Community
General Tabletop Discussion
*TTRPGs General
Best...Puzzle...Ever....
Top