gematrinator.com/calculator/index.php If this is the language of Media and Government Propaganda...How significant are the connections made through numbers/Gematria >There are 26 letters in the alphabet >There are over 200k English words >There are varying numbers of letters in words >There are dead combinations of letters which do not spell anything
So for an example of how the math looks check this video out youtu.be/Q7-PHHa5x-c
to learn the code follow gematriaeffect.news search the old blog for insight freetofindtruth.blogspot.com sign up for the social media to make frens who know about (((them))) freetofindtruth.com
and for a crash course and see all of Zachs work lined up... get his book
Notice in the OP you have different letter-lengths yet the words match... This is because of the alphabet and Language being carefully crafted by Masonic freaks They numbered themselves, and use those numbers in Rituals spanning a certain number of days to align with those established numbers
Did you read Zachs book? I dont think you have. I recommend that you take a look at it and also that you use Gematrinator.com because it has more ciphers.
for example on Gematrix the English Cipher is actually English Sumerican
>over 200k english words >almost all with English Ordinals less than 200 en.wikipedia.org/wiki/Pigeonhole_principle For almost any word, there are over a thousand words with the same English Ordinal. The probability that related words have the same ordinal is 100%
Assume a drawer contains a mixture of black socks and blue socks, each of which can be worn on either foot, and that you are pulling a number of socks from the drawer without looking. What is the minimum number of pulled socks required to guarantee a pair of the same color? Using the pigeonhole principle, to have at least one pair of the same color (m = 2 holes, one per color) using one pigeonhole per color, you need to pull only three socks from the drawer (n = 3 items). Either you have three of one color, or you have two of one color and one of the other. Hand-shaking
If there are n people who can shake hands with one another (where n > 1), the pigeonhole principle shows that there is always a pair of people who will shake hands with the same number of people. In this application of the principle, the 'hole' to which a person is assigned is the number of hands shaken by that person. Since each person shakes hands with some number of people from 0 to n − 1, there are n possible holes. On the other hand, either the '0' hole or the 'n − 1' hole or both must be empty, for it is impossible (if n > 1!) for some person to shake hands with everybody else while some person shakes hands with nobody. This leaves n people to be placed into at most n − 1 non-empty holes, so that the principle applies.
Parker Perez
thanks user, im going to apply this, there is only one thing to consider. There can be 26 different color socks in the same draw(alphabet) but how do you account for the varying length of words along with the x-factor which is that things that have the same value are intrinsically related in many many many instances
The birthday problem The birthday problem asks, for a set of n randomly chosen people, what is the probability that some pair of them will have the same birthday? By the pigeonhole principle, if there are 367 people in the room, we know that there is at least one pair who share the same birthday, as there are only 366 possible birthdays to choose from (including February 29, if present). The birthday "paradox" refers to the result that even if the group is as small as 23 individuals, the probability that there is a pair of people with the same birthday is still above 50%. While at first glance this may seem surprising, it intuitively makes sense when considering that a comparison will actually be made between every possible pair of people rather than fixing one individual and comparing them solely to the rest of the group.
I think this is the best way to apply this principle to the alphabet. Another thing to consider is that English is a creation of people who spoke a different language altogether. So how does the Pigeonhole Principle apply to not only calibrate randomness, but also the randomness within very particular circumstances (the numerical representation and alignment throughout language and the alphabet)
Charles Jones
>the socks are the words no there are 26 socks >one for each letter >no two socks have the same value 1-26 >the draw is the alphabet
the action is removing x amount of socks and adding the value of the socks together. do that action again with the same or different amount of socks and matching the value.
The following are alternative formulations of the pigeonhole principle.
If n objects are distributed over m places, and if n > m, then some place receives at least two objects.[1] (equivalent formulation of 1) If n objects are distributed over n places in such a way that no place receives more than one object, then each place receives exactly one object.[1] If n objects are distributed over m places, and if n < m, then some place receives no object. (equivalent formulation of 3) If n objects are distributed over n places in such a way that no place receives no object, then each place receives exactly one object.[16]
Robert Smith
Okay fine the socks can be words in your analogy, but since your analogy does not account for varying length of words along with the x-factor, I think my analogy is better. If the socks/drawers part is confusing, just imagine coloring every word in the English dictionary one of 200 colors. If there are 200k words in that dictionary, that's roughly 1000 words a color. In each of those colors, you're going to find a bunch of words that are linked conceptually.
Easton Thomas
>If there are 200k words in that dictionary, that's roughly 1000 words a color. In each of those colors, you're going to find a bunch of words that are linked conceptually. This doesnt go far enough though because when we see that many words that have the same value are intrinsically related is another factor entirely. Although this could serve as a guideline for language creation i suppose.
Now there is also the 4 base ciphers in this picThis is the practice of Gematria and now there are 4 ciphers to where each sock (26 socks) have 4 numbers on them (each cipher) Do you know the next step? Ive been out of school too long and wasnt taught any of this extensively. I just know that a 3 letter word has 1/26x1/26x1/26 possibilities(minus the nonwords like fds,ghf, jky, axw)
Samuel Turner
No a 3 letter word has a value of at least 1+1+1 = 3 and 26+26+26=78. A 10-letter word has a value between 10 and 260.
Austin King
I.e. there are 251 possibilities for a 10-letter-word
Ryder Mitchell
>10-letter word has a value between 10 and 260. no because aaaaaaaaaa is not a word
Cooper Howard
In this alphabet/language we are trying to conceptualize a frequency band theres a bunch of stations and all the static are letter combinations that do not = actual words
Evan Robinson
Gematria was sent from the future into the ancient past. This was done using the Gödel metric. The future self-communicated the nature of the simulation, which is what Gematria describes. It is not that there is a mysterious link in mathematics, but rather between memory allocation sectors of the simulation which are described using the magically derived English alphabet.
Look here! That is your proof of what I say. There is a nexus between mathematics, science, and magic. Here it is.
Elijah Williams
>Gematria was sent from the future into the ancient past. It seems like to me that it was given to people to create govenment/religious authority It does not require time travel for there to be a conspiracy user lol
Yes, neither is ZZZZZZZZZZ Or are they? If a character is screaming and goes "AAAAAAAAAA" or he's sleeping and goes "zzzzzzzzzz" in a book, is that valid for gematria analysis?
Hudson Gomez
Here, I'm a dev who works on the sim and people are being hella evil. Have a cheat code.