GROUP PROJECT!(any programmers?) - lets find ALL possibilites for 666, with computer technology

by EndofMysteries 14 Replies latest watchtower bible

• 

  EndofMysteries

  Back in the 1st century, when Iraneus said that MANY words can equal 666, including latinos and titan, that spending much time to get them is pointless until it's actually taking place, and it will just serve as a 'confirmation'. They also didn't have computers and could spend forever trying to come up with every possible scenario. We can easily, with the right resources do that fairly easily. Hoping some people can input how to do certain parts of this, or what programs may work, etc.

  PHASE 1 - I remembered seeing online a letter descrambler, put in letters and it will pop out every word that matches the letters. So first thing would need to do would be to find a way to input every numberic value of the greek alphabet, and display every possible calculation which will equate 666 in less then 20 or so calculations. (so we don't get 1+1+1+1, etc, only as big as the largest word would be.) Simplified the equation is (Using ONLY these inputed numbers, display every instance starting from just using 1 of them to 20 and they can be repeated but no more then a list of 20, when the sum of them will equal 666. - THIS will give us the calculation of EVERY POSSIBILITY for a name to equal 666 from 1 letter to 20 letters long. (600+60+6) = 3 letters, (300+300+10+10+10+10+10+10+6)=9 letters, etc.

  PHASE 2 - so now we will have like shown above, every possible calculation, then they must be converted back to letters. (at the very least, I know at this point, websites which you can input a list of letters and get every possible english word out of it, (hopefully names also in it) But we then descramble all. (this would be the hard part, but ALSO greek version, since names are spelt different in greek and would make it different, so all possible greek words, THEN translate all those greek words to english. Like the letter descamblers for english, one which could do the same in Greek)

  PHASE 3 (optional) - depending based on the greek and english alphabets numeric values how many possibilites limited to 20 letters would come up, may want to see if a program could run them all vs inputting each one in manually.

  We would have a list of just english words which equaled it, and a list of greeks words translated to english that did (I kind of think the greek translated to english would be the most accurate and intended)

  Sound fun? ;)

  Now currently people will just 'check' words to see if it meets the number, many times going just based on the english lettering.

  Here is my idea, and thought might be some here who want to put their minds together and figure this out........

  First, the greek alphabet each letter has a corresponding numeric value. We have no way of knowing if that number will be based off of calculation from the greek translation or if english translation (it DOES change the number)
• 

  bohm

  not really sure what you want..

  Does the identification: l = 666 and the rest of the letters = 0 mean that Donald Duck has value 666?

  There is about 4.4*10^21 ways to split up a sum that equals 666, so an exchaustive search is fairly damn difficult.

  It is an interesting question what assignment of letters to numbers would make the most english word equal to 666 or alternatively, the most words weighted with frequency equate to 666. A naive idea is to assign each letter a value of 666/k where k is the average number of letters in an english word, but we can properly do a lot better. Let L be the length of a given word and P(L) be the distribution of lengths of words in the english alphabet (this could easily be estimated) and let a be some letter and p(a) the propability we observe letter a ('e' would clearly have the highest propability). We could then try to optimize our assignment of weights w(a) to minimize the error

  E(v) = sum(L from 1 to infinity) p(L) ( sum(a is all letters) w(a) p(a)*L - 666)^2

  This is trivially minimized by just differentiating and solving the 24 (or what small number of letters you poor sods must do with!) equations - if i try to put on my ball-eye, it is just about finding the inverse of a 24x24 matrix where the entries only depend on p(a) and the first and second moment of L.

  Additionally, i think its possible to say something quantitively about the hardness of finding words that equate to 666; it will be depend on the peakedness of the P(L) distribution (more peaked the better) and entropy of p(a) (more entropy the better), but i digress.

  My guess is that no matter how you slice it you are going to find a metric shitload of words that calculate to 666. My other conclusion is that drinking beer while writing on your masters is a really crappy idea since you end up doing a ton of unrelated stuff :-).

  Bohm, of the 'back to youtube'-class.
• 

  EndofMysteries

  Bohm - here is the greek alphabet and its numeric values http://en.wikipedia.org/wiki/Greek_numerals

  We have 1 2 3 4 5 6 7 8 9 10 20 30 40 50 60 70 80 90 100 200 300 400 500 600 700 800 900 - each of those individual numbers equals a letter as you will see in the chart on the above link.

  it definitely won't be 700 800 or 900 , we need a formula which would take the 24 numbers remaining, and find as many combinations of them allotting up to 20 or less which would equate 666. After having that large large list of all the possible ways with the 24 numbers of that list to equate 666, then converting them in that list back to the letters they correspond with.

  Lets take 600+60+6 for example, = the letters χ', ξ', and ( ? ' or ? ' or στ'), and list all the greek words that can come from those combinations, then translate to english. Then we know all the names and words for that set.

  As complex as it would be, I know with good programmers and with some existing programs and tools, this can be done.
• 

  tec

  Someone somewhere has probably already tried to do this. What do you hope to accomplish with your results?

  Tammy
• 

  EndofMysteries

  Just a full list alphabetically of every word and name that matches, interesting to see what is contained in it
• 

  TheClarinetist

  Where are you going to get your dictionary? A lot of the combinations will be completely meaningless, and it might be faster to go through a dictionary sequentially. Also, why English and Greek, and not Hebrew, Latin, Aramaic, or Italian? What if God mispells a word?

  If you get a dictionary, what format will it be in, and are you planning on going through the words recursively or have different functions for every word length?

  What type of characters are you using? Is it perhaps possible that the number 666 is based upon the unicode for the characters, as opposed to normal numerology? Or perhaps the offset from the beginning of the character set which contains the alphabet.
• 

  bohm

  well, if that is what you want, you should clearly just download a dictionary file for a spellchecker (free) and go through the ~100'000 words. For each word, just turn it into its numerical value. Finally, plot all those numerical values as a histogram. If it is sharply peaked at 666 - the debil is behind the world! if it is not, well, he may still be. At any rate, you can do it in a hour or so and the program wont take more than a few minutes to run AT MOST.

  Dont try to solve the problem of finding combinations of letters that add up - its a difficult problem (not in the sence of writing a method that does it - thats doable in a few lines - but its darn expensive computationally and i cannot really see if its even doable on normal hardware), and its a totally backwards way of solving the problem.
• 

  OUTLAW

  I turned my computer screen upside down..

  666 comes out 999..

  Mystery Solved!!..

  ................. ...OUTLAW
• 

  AllTimeJeff

  Huh?
• 

  EndofMysteries

  BOHM, thanks for that last comment. I was adding more work then neccessary, could use digital dictionaries for Hebrew/Greek ( I say greek because the book of Revelation was written in greek ), also need a complete file of 'names' in greek, then convert them to the numerical values, and sort by total sum, and grab the ones which equal 666.

  Again, I this isn't something important to do, if anything just serves as confirmation when it actually happens or is happening, unless happening now, doing it won't be much benefit, and if it will take too much hassle, i won't do it either.