Author |
Topic: Dominant Fifth (Read 10071 times) |
|
Nootch
Newbie
Posts: 16
|
 |
Dominant Fifth
« on: Jul 12th, 2004, 3:03pm » |
 Quote  Modify
|
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Here is the puzzle:
"What's the Dominant Fifth?" asked Dr. Dingo, as his daughter Cicely came in from school.
Cicely blushed. "Just a secret society," she said. "I'm one of the vice-presidents."
"And you're meeting tonight; is that right?"
"How on earth did you know?" ask Cicely.
"You left this lying about. That's no way to keep secrets, my girl." He handed Cicely this paper:
Dominant Fifth
REASM NCNVE OTMLE SEHST TAOEI
"How did you manage to read it?" asked Cicely. "The code is known to only about eight of us."
"Change it," said Dingo. "Any fool can read that."
~~~~~~~~~~~~~~
This may be an exaggeration. But it's not a difficult code.
Can you decipher it?
~Where and When is the next meeting scheduled?
// thread title renamed by wwu 10:41 PM 8/19/2004
|
| « Last Edit: Aug 19th, 2004, 10:42pm by william wu » |
 IP Logged |
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender: 
Posts: 13730
|
 |
Re: Help me solve this riddle anyone?
« Reply #1 on: Jul 12th, 2004, 3:07pm » |
Quote Modify
|
Posting it in just one place is plenty.
Posting it on at least four boards (and once in another active thread) on the other hand is highly annoying (so I removed the other ones)..
I haven't broken the code yet though (despite leaving it in easy). But I'm sure it has something to do with the number 5
|
| « Last Edit: Jul 12th, 2004, 3:22pm by towr » |
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
Nootch
Newbie
Posts: 16
|
|
Re: Help me solve this riddle anyone?
« Reply #2 on: Jul 12th, 2004, 3:33pm » |
Quote Modify
|
I am very sorry for the mulitple posts. I couldn't quite figure out how to "tell" if they had been posted, being a newbie and all. In the end, I noted that in fact, my posts had popped up everywhere. Again, I apologize for the over-abundance of postings.
I have figured out that if you skip every fifth letter, you get the word MEET -- after that, I get a little stumped on where to continue the decipher path. Should I now go backwards, should i skip a word cluster, etc.... Your help is appreciated. I usually sleep much easier after the puzzles are solved.  Thanks again.
|
|
IP Logged |
|
|
|
Three Hands
Uberpuzzler
Gender:
Posts: 715
|
|
Re: Help me solve this riddle anyone?
« Reply #3 on: Jul 12th, 2004, 4:27pm » |
Quote Modify
|
Well, you got the first 4 letters...
I make it:
Meet in the classroom at seven
Method:
Take every fifth unused letter from the sequence, looping from the end to the beginning. This would create the following sequence, where every fifth letter is removed from the loop:
REASM NCNVE OTMLE SEHST TAOEI REASN CNVOT MLSEH STAOE REASC NVOML SESTA OREAS NVOMS ESTOR EANVO MESTO EANVM ESTEA NVEST ENVES ENVEE NVENV ENENE NNNNN
The spaces after each fifth letter highlight which letter is being removed, and you can read the message by taking the last letter of each group of five.
Some credit also to rmsgrey for helping in checking that my theory was correct, and for suggesting the layout for the method explanation.
|
| « Last Edit: Jul 12th, 2004, 4:28pm by Three Hands » |
IP Logged |
|
|
|
Sir Col
Uberpuzzler
impudens simia et macrologus profundus fabulae
Gender:
Posts: 1825
|
|
Re: Help me solve this riddle anyone?
« Reply #4 on: Jul 12th, 2004, 4:44pm » |
Quote Modify
|
RERDN HEWHI KAEOC SNT
::Alternatively you can just cross off a letter after it has been used.::
It is quite challenging trying to encode a message. Can you work out how to do it?
|
|
IP Logged |
mathschallenge.net / projecteuler.net
|
|
|
Three Hands
Uberpuzzler
Gender:
Posts: 715
|
|
Re: Help me solve this riddle anyone?
« Reply #5 on: Jul 12th, 2004, 5:14pm » |
Quote Modify
|
AOIST YNRUH LCKO 
Can't think of an easier way of encoding off the top of my head than create a line of x's equal to the number of letters you're encoding, and then replace every fifth x you come to with a letter to spell out the message - at least, that's how I did my little bit of work...
Presumably there is some clever trick to doing it, but I just can't think of it...
|
|
IP Logged |
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender:
Posts: 13730
|
|
Re: Help me solve this riddle anyone?
« Reply #6 on: Jul 13th, 2004, 1:12am » |
Quote Modify
|
It should be easy enough to program (and for other bases than 5 as well)
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
Speaker
Uberpuzzler
Gender:
Posts: 1118
|
|
Re: Help me solve this riddle anyone?
« Reply #7 on: Jul 13th, 2004, 1:17am » |
Quote Modify
|
I do not know how to program, but Sir Col's idea of finding an easy way to encode is interesting.
I have been trying to work out a way to do it by writing in a triangle, or a circle, or a square. Then straightening out the shape into a mixed up line.
But, no luck. 
I tried to write an equation, but I do that worse than programming. 
|
|
IP Logged |
They that can give up essential liberty to obtain a little temporary safety deserve neither liberty nor safety. <Ben Franklin>
|
|
|
Sir Col
Uberpuzzler
impudens simia et macrologus profundus fabulae
Gender:
Posts: 1825
|
|
Re: Help me solve this riddle anyone?
« Reply #9 on: Jul 13th, 2004, 3:01am » |
Quote Modify
|
Very neat, towr, but...
ctxw naio rpru hygl elrd atoy a?oo moiu eul
|
|
IP Logged |
mathschallenge.net / projecteuler.net
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender:
Posts: 13730
|
|
Re: Help me solve this riddle anyone?
« Reply #10 on: Jul 13th, 2004, 3:07am » |
Quote Modify
|
Well, for encoding I just used the method Three Hands mentioned (starting with a blank line and replacing each nth blank character with the next character in the string), and for decoding also the obvious one (removing each nth letter and counting to the next )
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender:
Posts: 13730
|
|
Re: Help me solve this riddle anyone?
« Reply #11 on: Jul 13th, 2004, 3:21am » |
Quote Modify
|
You can make all sorts of devious variation on the encoding:
nied__C t_es?ca duoohy
b)so?dobwengH htuheuaysSuh; otioael
olewstoorctrc ekeasOtproceu a,odsewnagrfe f.uir.vhnebnd nd.Tb
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
Barukh
Uberpuzzler
Gender:
Posts: 2276
|
|
Re: Help me solve this riddle anyone?
« Reply #12 on: Jul 13th, 2004, 4:05am » |
Quote Modify
|
The problem of encoding is equivalent to the well known Josephus Problem: to encode is to put the prisoners in order of their execution.
It seems (read the introduction) no explicit formula exists for the position of a certain symbol in the encoded sequence.
|
|
IP Logged |
|
|
|
TINY
Newbie
Gender: 
Posts: 1
|
|
Re: Dominant Fifth
« Reply #13 on: Aug 27th, 2004, 5:06am » |
Quote Modify
|
MEET IN THE CLASSROOM AT SEVEN
|
|
IP Logged |
|
|
|
Guest
Guest
|
I still don't get it. Could you explain please?
|
|
IP Logged |
|
|
|
Guest
Guest
|
Whoops, I didn't see the other posts. Never mind.
|
|
IP Logged |
|
|
|
jbcrowley
Newbie
Posts: 9
|
|
Re: Dominant Fifth
« Reply #16 on: Jan 16th, 2013, 12:33pm » |
Quote Modify
|
I've been trying to find a general equation for this problem.
To try to figure it out, I used the string ABCDEF...Y which has 25 letters (same as the original). I encoded the string manually and then put together a table that contained the original index and the encoded index and tried to come up with a relationship between the two. I found one that is pretty close but I can't quite get all the indices exactly right.
Code:Original string A B C D E F G H I J K L M N O P Q R S T U V W X Y
Original index 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Encoded string J O T Y A F K P U B G L Q V C H M R W D I N S X E
Original string A B C D E F G H I J K L M N O P Q R S T U V W X Y
Encoded pos 5 10 15 20 25 6 11 16 21 1 7 12 17 22 2 8 13 18 23 3 9 14 19 24 4
Calc Formula 5 10 15 20 1 6 11 16 21 2 7 12 17 22 3 8 13 18 23 4 9 14 19 24 5
|
|
Original string - the unencoded "message", A..Y
Original index - the index of each letter in the original message starting with 1
Encoded string - the original string after encoding
Encoded position - the index of the character in the encoded string, A is in position 5, B is in position 10, etc.
Calc formula - I used 5*mod(n,5)+floor(n/5) where n is the original index to calculate these values.
You can see that they all are correct except for every 5th index. It's always off by -1. I was hoping that if I posted this, someone else could see the key that I'm missing.
BTW, I wanted to put this in an html table but the bb didn't like it... it kept inserting spaces in places that broke the html table code, etc.
|
|
IP Logged |
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender:
Posts: 13730
|
|
Re: Dominant Fifth
« Reply #17 on: Jan 16th, 2013, 1:06pm » |
Quote Modify
|
Use ceil(n/5-1) instead of floor(n/5). Which is the same except for multiples of 5 where it's one less, exactly as you want.
|
| « Last Edit: Jan 16th, 2013, 1:08pm by towr » |
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
jbcrowley
Newbie
Posts: 9
|
|
Re: Dominant Fifth
« Reply #18 on: Jan 17th, 2013, 6:19am » |
Quote Modify
|
on Jan 16th, 2013, 1:06pm, towr wrote:| Use ceil(n/5-1) instead of floor(n/5). Which is the same except for multiples of 5 where it's one less, exactly as you want. |
|
5*mod(n,5)+ceil(n/5-1) is very close but for n = 5 it gives 0 instead of 25.
5 10 15 20 0 6 11 16 21 1 7 12 17 22 2 8 13 18 23 3 9 14 19 24 4
|
|
IP Logged |
|
|
|
SMQ
wu::riddles Moderator
Uberpuzzler
Gender:
Posts: 2084
|
|
Re: Dominant Fifth
« Reply #19 on: Jan 17th, 2013, 8:32am » |
Quote Modify
|
on Jan 17th, 2013, 6:19am, jbcrowley wrote:| 5*mod(n,5)+ceil(n/5-1) is very close but for n = 5 it gives 0 instead of 25. |
|
That's because mod is zero-based and you're using one-based indexes. You can fix it by wrapping the whole thing in another mod which essentially replaces 0 with 25:
mod(5*mod(n, 5) + ceil(n/5 - 1) - 1, 25) + 1
but that's starting to get fairly inelegant, and I'm not sure how well it can generalize to lengths that aren't multiples of 5...
--SMQ
|
|
IP Logged |
--SMQ
|
|
|
|
RIDDLES SITE
WRITE MATH!
Home 
Help 
Search 
Members 
Login 
Register
Reply
Notify of replies
Send Topic
Print
Remove