For an unrestricted integer, approximately one out of every 37 values is divisible by 37 and one out of every 73 values is divisible by 73. This pattern tests whether contiguous sections of Genesis 1:1 produce unusually many multiples of both members of the prime pair 37 and 73.
Remove the spaces between the seven Hebrew words, producing a sequence of 28 letters. Beginning at each letter, calculate the traditional Hebrew value of every contiguous sequence ending at that letter or any later letter. This produces 406 sequences:
28+27+26+⋯+1=406.
Count how many of the 406 values are evenly divisible by 37 and how many are evenly divisible by 73.
The accompanying Java program performs these calculations and compares the result with computer-generated 28-letter strings.
God's prime digit pairs.
Read detail page for Pattern 66
The probability for this pattern should be estimated by counting how many randomized 28-letter strings equal or exceed the Genesis 1:1 result under the same scoring rule. The number of trials, randomization method, qualifying results, and random seed should all be reported.
This page uses the probability notation provided in the original pattern sequence.
Letter values are highlighted.
| Genesis 1:1 | |
|---|---|
| Hebrew Word | Number of Letters |
| בראשית | 6 |
| ברא | 3 |
| אלהימ | 5 |
| את | 2 |
| השםימ | 5 |
| ואת | 3 |
| הארצ | 4 |
| Total Words: 7 | Total Letters: 28 |
| Traditional Hebrew Letter Values | Word Total | |||||
|---|---|---|---|---|---|---|
|
|
|
|
|
|
|
913 |
|
|
|
| 203 | |||
|
|
|
|
|
| 86 | |
|
|
| 401 | ||||
|
|
|
|
|
| 395 | |
|
|
|
| 407 | |||
|
|
|
|
| 296 | ||
| Verse Value Total | 2701 | |||||
| Hebrew Alphabet Positions | Word Total | |||||
|---|---|---|---|---|---|---|
| 2 | 20 | 1 | 21 | 10 | 22 | 76 |
| 2 | 20 | 1 | 23 | |||
| 1 | 12 | 5 | 10 | 13 | 41 | |
| 1 | 22 | 23 | ||||
| 5 | 21 | 13 | 10 | 13 | 62 | |
| 6 | 1 | 22 | 29 | |||
| 5 | 1 | 20 | 18 | 44 | ||
| Verse Position Total | 298 | |||||