Rearranging Letters Experiment

Rearrange alphabetical experiments Set up this survey to find an expression that resolves how many alignments can be taken for a single word, no matter how many times a letter or characters are repeated . First, we find an expression to find out how many arrangements can be found for the name LUCY. After finding this, I will check how many arrangements can be obtained from the name EMMA. After examining how many arrangements are being made, we will put them officially to see if there is a relationship between the first half and the second half of the investigation.

Transposition: In transposition, bits, letters, words ... as part of the message are sorted in a different order. The recipient needs to know how to restore the original message by undoing transposition. Since sorting is determined by a key in a unique way, if both the sender and the recipient know the key, you can decide how to swap and flip it. Replace: Replace the message replacing component (bit, letter, word ...). The recipient needs to know how to undo the replacement and restore the original message. Replacement is determined by the key in its own way, so if both the sender and the recipient know the key, you can derive the correct output from the input.

Mathematician Mike Byster suggests rearranging the alphabet so that it thinks outside the box. First of all, you need to think about a single word. It can be anything. Next, just remember to rearrange the letters in alphabetical order. For example, "Sutava" becomes "AASTUV". As you get better and better, you can try longer words. Sometimes the life of a child is much higher than that of an adult. Their innocence and frank thinking, yet not fully adapted to social norms, can help you see your problem in various ways. Although their advice is not necessarily the best (Santa can not pay rent or complete your mission), their insight will help you think out of the box