Any math nerds out there! Is there any way to find any unique word in the infinite set of all possible words using location n? The way the set is set up is by length, so for any particular length L, there exists 26^L unique words. For example: {a,b,c,...,x,y,z,aa,ab,ac,...,zx,zy,zz,aaa,aab,...} The way I would prefer the equation to work is using a series of numbers between 1-26, and using those numbers to construct the word at that location. Please ask if this needs more clarification. I already have 1.5 pages written about the background of this topic.
Posted on: Mon, 07 Oct 2013 23:04:28 +0000
Trending Topics
Recently Viewed Topics
© 2015