which is easier to solve a substitution cipher or a transposition cipher?
396820
i think a transposition cipher cuz if u figure out one letter, you have figured out the rest. in a substitution cipher, a letter could be any letter and if you found one, you still would not know the others.
368292
Easy...\n\n312211\n\nLook at it this way...\n\nOne\n1 one\n2 ones\n1 two 1 one\n1 one 1 two 2 ones\n\nTherefor 3 ones 2 twos 1 one
211332
http://www.nce1031.net/nce/\n\nspelling is "exchangors"
130202
regular, reverse and atomic
685528
Check this site out.\n\n www.eecis.udel.edu/~trnka/past_coursework/word_scramble.html
377593
960\n\nL has 480 less, and S has 480 more, so the difference is 960.
715173
For encryption they use prime numbers.  I'd go backwards and find a way to play a prime number on a musical instrument.  If there's a rythm, it would be easy to crack the code.
606750
http://en.wikipedia.org/wiki/Hill_cipher
826575
Use one equation to substitute into the other,then solve for a one variable problem.  Use your new information (the solved variable) to solve for the second variable.\n\nFor the first set:\n\n-3x - y = 2 rearranged becomes:\ny = -3x -2\n\nUsing this "definition" of y, substitute it into the second equation as such:\n\n-6x + 2(-3x -2) = -2\n-6x - 6x - 4 = -2\n-12x = 2\nx = -1/6\n\nSubstitute -(1/6) for x in either equation to solve for y:\n\n-3(-1/6) - y = 2\ny = -3/2\n\nDo the same for the second pair of equations to make sure you got it (the answers for x and y are x=9/7, y = 1/7).
244607
reverse( NewString.begin(), NewString.end() );\n\n(You will have to #include <algorithm> )
614748
http://zbreiten.netfirms.com/UnscramblerForm.html
599042
I'll solve it for you. Send it over.\n\nstill\nshell\ngrill\ncliff\n give us a clue
754112
9804781928\nor\n3851297493
426188
Here's a good one:\n\nYou and the person you're writing to have two identical copies of the same book. It can be any book, but preferably something long so you've got a lot of range for your cipher. \n\nEach code-word consist of three numbers, which break down to a page number, line number, and word number - telling the location within the book of the word you're disguising. For instance, the code 56/20/3 would tell you to look for the third word of twentieth line on page 56... \n\nYou do the same thing for the next word, etc, making sure to choose different instances of the same word, if necessary, so that the code is that much more unbreakable.\n\n\nThat one's impossible to break unless you know exactly what book the coders are using. A simpler cipher, though, involves disguising a coded message within an apparently innocent missive - but if you read only every third word, the hidden message is revealed.
925629
polyeig(-5,-2,4,2) \n\nwill solve the equasion.  To learn about interpelations type:\n\nhelp interp1
406252
Google for any anagram solver.\n\nHere's an example: http://www.crossword-dictionary.com/anagram.asp
750008
Yes it is correct.\n\nYou can always move a term from one side of the equation to the other side of the equation as long as you change its sign. This is called transposition.