Permutations of Characters Within a String
This program computes the number of unique permutations that can be made from a string of text characters.
Any text character repetitions are also taken properly into account.
Enter a String of Up to 80 Keyboard Symbols or Characters
(Any letters
ARE
case sensitive).
For case
IN
sensitive computations, simply ENTER
ALL
TEXT IN UPPERCASE
Or
ALL
text in lowercase letters.
There should be no leading or trailing spaces in the string. They will be lost.
All spaces
within
the string are counted as characters.
Given the character string: The quick brown fox jumped over the lazy dog. ---------------------------------------------- STATISTICAL SYNOPSIS OF THE GIVEN TEXT STRING CHAR TXT CHAR_CODE COUNTS CHARS DEC HEX ------ ----- ----- ----- 8 032 20 1 . 046 2E 1 T 084 54 1 a 097 61 1 b 098 62 1 c 099 63 2 d 100 64 4 e 101 65 1 f 102 66 1 g 103 67 2 h 104 68 1 i 105 69 1 j 106 6A 1 k 107 6B 1 l 108 6C 1 m 109 6D 1 n 110 6E 4 o 111 6F 1 p 112 70 1 q 113 71 2 r 114 72 1 t 116 74 2 u 117 75 1 v 118 76 1 w 119 77 1 x 120 78 1 y 121 79 1 z 122 7A ------ ----- ----- ----- CHAR TXT DEC HEX COUNTS CHARS CHAR_CODE Total characters count: 45 Unique characters count: 21 ---------------------------------------------- The EXACT count of unique permutations equates to the 48-digit value: 321920676432830419152108547999623118848000000000 ---------------------------------------------- Full formal numerical name delineation for the permutations count is, if < 100 digits: 321 quattuordecillion 920 tredecillion 676 duodecillion 432 undecillion 830 decillion 419 nonillion 152 octillion 108 septillion 547 sextillion 999 quintillion 623 quadrillion 118 trillion 848 billion