Riddle Number Three
up vote
2
down vote
favorite
Time for a challenge! Here, the riddle is encoded using a specific cipher. You must decode the numbers and answer the riddle correctly to solve it. Good luck!
83191143|2367|02|41026731|434771|02|41026731?
Note: I will start adding bounties to my riddles, should they continue to be unsolved. That way you all get rewarded for your achievements.
riddle cipher
New contributor
add a comment |
up vote
2
down vote
favorite
Time for a challenge! Here, the riddle is encoded using a specific cipher. You must decode the numbers and answer the riddle correctly to solve it. Good luck!
83191143|2367|02|41026731|434771|02|41026731?
Note: I will start adding bounties to my riddles, should they continue to be unsolved. That way you all get rewarded for your achievements.
riddle cipher
New contributor
+1 for the note
– Omega Krypton
57 mins ago
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
Time for a challenge! Here, the riddle is encoded using a specific cipher. You must decode the numbers and answer the riddle correctly to solve it. Good luck!
83191143|2367|02|41026731|434771|02|41026731?
Note: I will start adding bounties to my riddles, should they continue to be unsolved. That way you all get rewarded for your achievements.
riddle cipher
New contributor
Time for a challenge! Here, the riddle is encoded using a specific cipher. You must decode the numbers and answer the riddle correctly to solve it. Good luck!
83191143|2367|02|41026731|434771|02|41026731?
Note: I will start adding bounties to my riddles, should they continue to be unsolved. That way you all get rewarded for your achievements.
riddle cipher
riddle cipher
New contributor
New contributor
edited 2 hours ago
New contributor
asked 2 hours ago
Edward Nigma
886
886
New contributor
New contributor
+1 for the note
– Omega Krypton
57 mins ago
add a comment |
+1 for the note
– Omega Krypton
57 mins ago
+1 for the note
– Omega Krypton
57 mins ago
+1 for the note
– Omega Krypton
57 mins ago
add a comment |
1 Answer
1
active
oldest
votes
up vote
3
down vote
accepted
Cipher
You are using an unmodified prime numbers cipher. Every two digits make up a prime number. Each pair's place in the prime set corresponds to its alphabetical rank. This allows us to learn that your code reads "When is a mask not a mask?"
Riddle
There are a few possible responses to this riddle and we lack the context to know which one is desired. A few possibilities could include:
- When it is in plain sight
- When it is used as a numerical limit
- When it reveals the wearer's true face
- When it is a sheet mask (in cosmetology)
there might be more, but this was off the top of my head
sniped by a couple of seconds ;)
– NL628
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Cipher
You are using an unmodified prime numbers cipher. Every two digits make up a prime number. Each pair's place in the prime set corresponds to its alphabetical rank. This allows us to learn that your code reads "When is a mask not a mask?"
Riddle
There are a few possible responses to this riddle and we lack the context to know which one is desired. A few possibilities could include:
- When it is in plain sight
- When it is used as a numerical limit
- When it reveals the wearer's true face
- When it is a sheet mask (in cosmetology)
there might be more, but this was off the top of my head
sniped by a couple of seconds ;)
– NL628
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
add a comment |
up vote
3
down vote
accepted
Cipher
You are using an unmodified prime numbers cipher. Every two digits make up a prime number. Each pair's place in the prime set corresponds to its alphabetical rank. This allows us to learn that your code reads "When is a mask not a mask?"
Riddle
There are a few possible responses to this riddle and we lack the context to know which one is desired. A few possibilities could include:
- When it is in plain sight
- When it is used as a numerical limit
- When it reveals the wearer's true face
- When it is a sheet mask (in cosmetology)
there might be more, but this was off the top of my head
sniped by a couple of seconds ;)
– NL628
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
add a comment |
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Cipher
You are using an unmodified prime numbers cipher. Every two digits make up a prime number. Each pair's place in the prime set corresponds to its alphabetical rank. This allows us to learn that your code reads "When is a mask not a mask?"
Riddle
There are a few possible responses to this riddle and we lack the context to know which one is desired. A few possibilities could include:
- When it is in plain sight
- When it is used as a numerical limit
- When it reveals the wearer's true face
- When it is a sheet mask (in cosmetology)
there might be more, but this was off the top of my head
Cipher
You are using an unmodified prime numbers cipher. Every two digits make up a prime number. Each pair's place in the prime set corresponds to its alphabetical rank. This allows us to learn that your code reads "When is a mask not a mask?"
Riddle
There are a few possible responses to this riddle and we lack the context to know which one is desired. A few possibilities could include:
- When it is in plain sight
- When it is used as a numerical limit
- When it reveals the wearer's true face
- When it is a sheet mask (in cosmetology)
there might be more, but this was off the top of my head
answered 1 hour ago
Arpeyji
3808
3808
sniped by a couple of seconds ;)
– NL628
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
add a comment |
sniped by a couple of seconds ;)
– NL628
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
sniped by a couple of seconds ;)
– NL628
1 hour ago
sniped by a couple of seconds ;)
– NL628
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
Congratulations! You not only deduced the cipher, but solved the riddle! The answer was: when it's in plain sight. I'll have to keep my eye on you ;)
– Edward Nigma
1 hour ago
add a comment |
Edward Nigma is a new contributor. Be nice, and check out our Code of Conduct.
Edward Nigma is a new contributor. Be nice, and check out our Code of Conduct.
Edward Nigma is a new contributor. Be nice, and check out our Code of Conduct.
Edward Nigma is a new contributor. Be nice, and check out our Code of Conduct.
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f76255%2friddle-number-three%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
+1 for the note
– Omega Krypton
57 mins ago