Decrypting... (Problem 1 )

I have an encrypted message, a. When decrypted fully, it becomes a four-letter word. Find the four-letter word. You must use the alphabet as numbers (i.e a = 1, b = 2 ..., z = 26.) Your clues are:, a = 1, I have two numbers: 7 2 7^2 and 1 1 , the sum of the four letters is 49, l 4 l 1 = 19 l_4 - l_1 = 19 , l 2 = l 3 l_2 = l_3 , when you have found l 4 l_4 and l 1 l_1 , l 2 + l 3 = 20 l_2 + l_3 = 20 , when you have found the partially decrypted four-letter word (i.e. an example would be abbc), two further clues are: l 2 = l 3 = 10 l_2 = l_3 = 10 , l 4 l 1 = 2 l_4 - l_1 = 2 You must show proof of you finding the four-letter word (attach it in the discussion.) Note: I have used my encryption formula: this is explained in the discussion. Note 2 : Here is my proof if any of you are confused about the wording and cannot solve it:

seer bees feel deeu eeev ceet beer

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

My formula used in this problem is: ( n 1 n 2 ) / x y h i g h e s t f a c t o r z \frac{(n_1 * n_2)/x^y}{highest factor^z} = b shift where: n 1 n_1 and n 2 n_2 = random integers (except negative integers), x = highest possible divisor, y = highest possible power before n 1 n 2 n_1 * n_2 turns into fraction (or y 1 y_1 ), z = highest power possible (or y 2 y_2 ) and shift = encryption shift. I encrypt in three stages: 1st stage: encrypt each letter using n 1 n 2 x y \frac{n_1 * n_2}{x^y} and subtract any number >= 1 - afterwards I divide like this: 62 d e n o m i n a t o r o f s h i f t \frac{62}{ denominator of shift} (if the shift is like 3 34 \frac{3}{34} , I do: 62 d e n o m i n a t o r o f s h i f t \frac{62}{ denominator of shift} * numerator of shift.) After that, I round the result to an integer and encrypt by that integer (if the letter is the same, I use that encrypted letter for that letter (i.e queen and encryption is azjjr, e = j (both of them)). 2nd stage: I add the encrypted letters according to their place in the normal alphabet (since I change n 1 n_1 and n 2 n_2 every time, I cannot create a sheet where each letter is specific to an encrypted letter: it depends on n 1 n_1 and n 2 n_2 .) and create a number. 3rd stage: I divide that number by h i g h e s t f a c t o r z highest factor^z (highest factor is any factor apart from itself and 1.) and whatever number comes out, I correspond it to the alphabet and the letter (or letters) is the final encrypted mesage.

Is there supposed to be some way to derive this code from the information you give?

Richard Desper - 1 year, 1 month ago

This is the encryption formula but if you reverse it, it gives you the decryption formula (I think) to decrypt a (i.e. some of the clues found in the question are part of the encryption process - just reverse it to to find the decryption process.)

A Former Brilliant Member - 1 year, 1 month ago

I'll post a proof in the next 48 hours.

A Former Brilliant Member - 1 year, 1 month ago

Also, not the way I intended to write the question - hoped a box comes underneath the question where you can show how you worked it (i.e. a proof box.)

A Former Brilliant Member - 1 year, 1 month ago

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...