Previous Page
   Next Page
 
Evokation
  
 
Index
  

 

A

MAZE

IN

ZAZAZA ENTER ZAZAZA

ZAZAZAZAZAZAZAAZAZAZAZAZAZAZ

ZAZAZAZAZAZAZAZAZAAZAZAZAZAZAZAZAZAZ

THE

MAGICALALPHABET

ABCDEFGHIJKLMNOPQRSTUVWXYZZYXWVUTSRQPONMLKJIHGFEDCBA

 12345678910111213141516171819202122232425262625242322212019181716151413121110987654321

 

 

WORK DAYS OF GOD

Herbert W Morris D.D.circa 1883

Page 22

"As all the words in the English language are composed out of the twenty-six letters of the alphabet,.."

 

 

LIGHT AND LIFE

Lars Olof Bjorn 1976

Page 197

"By writing the 26 letters of the alphabet in a certain order one may put down almost any message (this book 'is written with the same letters' as the Encyclopaedia Britannica and Winnie the Pooh, only the order of the letters differs). In the same way Nature is able to convey with her language how a cell and a whole organism is to be constructed and how it is to function. Nature has succeeded better than we humans; for the genetic code there is only one universal language which is the same in a man, a bean plant and a bacterium."

"BY WRITING THE 26 LETTERS OF THE ALPHABET IN A CERTAIN ORDER

ONE MAY PUT DOWN ALMOST ANY MESSAGE"

 

 

A
B
C
D
E
F
G
H
I
1
2
3
4
5
6
7
8
9
 =
 =
 =
 =
 =
 =
 =
 =
=
 =
 =
 =
 =
 =
 =
 =
 =
=
J
K
L
M
N
O
P
Q
R
10
11
12
13
14
15
16
17
18
1+0
1+1
1+2
1+3
1+4
1+5
1+6
1+7
1+8
1
2
3
4
5
6
7
8
9
 =
 =
 =
 =
 =
 =
 =
 =
=
 =
 =
 =
 =
 =
 =
 =
 =
=
S
T
U
V
W
X
Y
Z
I
19
20
21
22
23
24
25
26
9
1+9
2+0
2+1
2+2
2+3
2+4
2+5
2+6
ME
1
2
3
4
5
6
7
8
9
 =
 =
 =
 =
 =
 =
 =
 =
=
 =
 =
 =
 =
 =
 =
 =
 =
=
I
ME
I
ME
I
ME
I
ME
I
9
18
9
18
9
18
9
18
9
=
1+8
=
1+8
=
1+8
=
1+8
=
=
9
=
9
=
9
=
9
=
I
ME
I
ME
I
ME
I
ME
1
9
9
9
9
9
9
9
9
9
I
ME
I
ME
I
ME
I
ME
1

 

 

"BY WRITING THE 26 LETTERS OF THE ALPHABET IN A CERTAIN ORDER

ONE MAY PUT DOWN ALMOST ANY MESSAGE"

 

 

A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
-
-
-
-
-
-
-
-
-
1+0
1+1
1+2
1+3
1+4
1+5
1+6
1+7
1+8
1+9
2+0
2+1
2+2
2+3
2+4
2+5
2+6
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z

 

 

A

HISTORY OF GOD

Karen Armstrong

The God of the Mystics

Page 250

"(The Book of Creation). There is no attempt to describe the creative process realistically; the account is unashamedly symbolic and shows God creating the world by means of language as though he were writing a book. But language has been entirely transformed and the message of creation is no longer clear. Each letter of the Hebrew alphabet is given a numerical value; by combining the letters with the sacred numbers, rearranging them in endless configurations, the mystic weaned his mind away from the normal connotations of words."  

 

 

THERE IS NO ATTEMPT MADE TO DESCRIBE THE CREATIVE PROCESS REALISTICALLY

THE ACCOUNT IS SYMBOLIC AND SHOWS GOD CREATING THE WORLD BY MEANS OF LANGUAGE

AS THOUGH WRITING A BOOK BUT LANGUAGE ENTIRELY TRANSFORMED

THE MESSAGE OF CREATION IS CLEAR EACH LETTER OF

THE

ALPHABET

IS

GIVEN

A

NUMERICAL

VALUE BY COMBINING THE LETTERS WITH THE SACRED NUMBERS

REARRANGING THEM IN ENDLESS CONFIGURATIONS

THE MYSTIC WEANED THE MIND AWAY FROM THE NORMAL CONNOTATIONS OF WORDS

 

 

A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
-
-
-
-
-
-
-
-
-
1+0
1+1
1+2
1+3
1+4
1+5
1+6
1+7
1+8
1+9
2+0
2+1
2+2
2+3
2+4
2+5
2+6
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z

 

 

 

FINGERPRINTS OF THE GODS

A QUEST FOR THE BEGINNING AND THE END

Graham Hancock 1995

Chapter 32

Speaking to the Unborn

Page 285

"It is understandable that a huge range of myths from all over the ancient world should describe geological catastrophes in graphic detail. Mankind survived the horror of the last Ice Age, and the most plausible source for our enduring traditions of flooding and freezing, massive volcanism and devastating earthquakes is in the tumultuous upheavals unleashed during the great meltdown of 15,000 to 8000 BC. The final retreat of the ice sheets, and the consequent 300-400 foot rise in global sea levels, took place only a few thousand years before the beginning of the historical period. It is therefore not surprising that all our early civilizations should have retained vivid memories of the vast cataclysms that had terrified their forefathers.
Much harder to explain is the peculiar but distinctive way the myths of cataclysm seem to bear the intelligent imprint of a guiding hand.l Indeed the degree of convergence between such ancient stories is frequently remarkable enough to raise the suspicion that they must all have been 'written' by the same 'author'.
Could that author have had anything to do with the wondrous deity, or superhuman, spoken of in so many of the myths we have reviewed, who appears immediately after the world has been shattered by a horrifying geological catastrophe and brings comfort and the gifts of civilization to the shocked and demoralized survivors?
White and bearded, Osiris is the Egyptian manifestation of this / Page 286 / universal figure, and it may not be an accident that one of the first acts he is remembered for in myth is the abolition of cannibalism among the primitive inhabitants of the Nile Valley.2 Viracocha, in South America, was said to have begun his civilizing mission immediately after a great flood; Quetzalcoatl, the discoverer of maize, brought the benefits of crops, mathematics, astronomy and a refined culture to Mexico after the Fourth Sun had been overwhelmed by a destroying deluge.
Could these strange myths contain a record of encounters between scattered palaeolithic tribes which survived the last Ice Age and an as yet unidentified high civilization which passed through the same epoch?
And could the myths be attempts to communicate?

A message in the bottle of time"

'Of all the other stupendous inventions,' Galileo once remarked,

what sublimity of mind must have been his who conceived how to communicate his most secret thoughts to any other person, though very distant either in time or place, speaking with those who are in the Indies, speaking to those who are not yet born, nor shall be this thousand or ten thousand years? And with no greater difficulty than the various arrangements of two dozen little signs on paper? Let this be the seal of all the admirable inventions of men.3

If the 'precessional message' identified by scholars like Santillana, von Dechend and Jane Sellers is indeed a deliberate attempt at communication by some lost civilization of antiquity, how come it wasn't just written down and left for us to find? Wouldn't that have been easier than encoding it in myths? Perhaps.
Nevertheless, suppose that whatever the message was written on got destroyed or worn away after many thousands of years? Or suppose that the language in which it was inscribed was later forgotten utterly (like the enigmatic Indus Valley script, which has been studied closely for more than half a century but has so far resisted all attempts at decoding)? It must be obvious that in such circumstances a written / Page 287 / legacy to the future would be of no value at all, because nobody would be able to make sense of it.
What one would look for, therefore, would be a universal language, the kind of language that would be comprehensible to any technologically advanced society in any epoch, even a thousand or ten thousand years into the future. Such languages are few and far between, but mathematics is one of them - and the city of Teotihuacan may be the calling-card of a lost civilization written in the eternal language of mathematics.
Geodetic data, related to the exact positioning of fixed geographical points and to the shape and size of the earth, would also remain valid and recognizable for tens of thousands of years, and might be most conveniently expressed by means of cartography (or in the construction of giant geodetic monuments like the Great Pyramid of Egypt, as we shall see).
Another 'constant' in our solar system is the language of time: the great but regular intervals of time calibrated by the inch-worm creep of precessional motion. Now, or ten thousand years in the future, a message that prints out numbers like 72 or 2160 or 4320 or 25,920 should be instantly intelligible to any civilization that has evolved a modest talent for mathematics and the ability to detect and measure the almost imperceptible reverse wobble that the sun appears to make along the ecliptic against the background of the fixed stars..."

"What one would look for, therefore, would be a universal language, the kind of language that would be comprehensible to any technologically advanced society in any epoch, even a thousand or ten thousand years into the future. Such languages are few and far between, but mathematics is one of them"

"WRITTEN IN THE ETERNAL LANGUAGE OF MATHEMATICS"

 

 

-
ALL IS NUMBER
-
-
-
3
ALL
25
7
7
2
IS
28
10
1
6
NUMBER
73
28
1
11
ALL IS NUMBER
126
45
9
1+1
-
1+2+6
4+5
-
2
ALL IS NUMBER
9
9
9

 

 

-
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
-
-
5
9
-
-
-
1
-
-
-
-
-
5
-
-
-
-
-
+
=
20
2+0
=
2
=
2
=
2
-
-
-
14
9
-
-
-
19
-
-
-
-
-
14
-
-
-
-
-
+
=
56
5+6
=
11
1+1
2
=
2
-
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
-
3
-
-
4
5
9
-
1
3
-
3
1
-
7
3
1
7
5
+
=
52
5+2
=
7
=
7
=
7
-
-
21
-
-
22
5
18
-
1
12
-
12
1
-
7
21
1
7
5
+
=
133
1+3+3
=
7
=
7
=
7
-
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
-
21
14
9
22
5
18
19
1
12
-
12
1
14
7
21
1
7
5
+
=
189
1+8+9
=
18
1+8
9
=
9
-
-
3
5
9
4
5
9
1
1
3
-
3
1
5
7
3
1
7
5
+
=
72
7+2
=
9
=
9
=
9
-
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
-
-
-`
-
-
-
-
1
1
-
-
-`
1
-
-
-
1
-
-
-
-
1
occurs
x
4
=
4
=
4
2
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
2
TWO
-
-
-
-
-
-
-
-
3
-
-
-
-
-
-
-
3
-
3
-
-
-
3
-
-
-
-
-
3
occurs
x
4
=
12
1+2
3
-
-
-
-
-
4
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
4
occurs
x
1
=
4
=
4
-
-
-
5
-
-
5
-
-
-
-
-
-
-
5
-
-
-
-
5
-
-
5
occurs
x
4
=
20
2+0
2
6
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
6
SIX
6
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
7
-
-
7
-
-
-
7
occurs
x
2
=
14
1+4
5
8
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
8
EIGHT
8
-
-
-
-
-
-
-
-
-
9
-
-
9
-
-
-
-
-
-
-
-
-
-
-
-
-
-
9
occurs
x
2
=
18
1+8
9
16
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
29
-
-
17
-
72
-
27
1+6
1+7
-
-
9
-
-
9
-
-
-
-
-
-
-
-
-
-
-
-
-
-
2+9
-
-
1+7
-
7+2
-
2+7
7
8
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
11
-
-
8
-
9
-
9
-
-
3
5
9
4
5
9
1
1
3
-
3
1
5
7
3
1
7
5
-
-
1+1
-
-
-
-
-
-
-
7
8
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
2
-
-
8
-
9
-
9

 

 

17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
-
5
9
-
-
-
1
-
-
-
-
-
5
-
-
-
-
-
+
=
20
2+0
=
2
=
2
=
2
-
-
14
9
-
-
-
19
-
-
-
-
-
14
-
-
-
-
-
+
=
56
5+6
=
11
1+1
2
=
2
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
3
-
-
4
5
9
-
1
3
-
3
1
-
7
3
1
7
5
+
=
52
5+2
=
7
=
7
=
7
-
21
-
-
22
5
18
-
1
12
-
12
1
-
7
21
1
7
5
+
=
133
1+3+3
=
7
=
7
=
7
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
21
14
9
22
5
18
19
1
12
-
12
1
14
7
21
1
7
5
+
=
189
1+8+9
=
18
1+8
9
=
9
-
3
5
9
4
5
9
1
1
3
-
3
1
5
7
3
1
7
5
+
=
72
7+2
=
9
=
9
=
9
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
-
-
-
-
-
-
-
-
-
-
-`
-
-
-
-
1
1
-
-
-`
1
-
-
-
1
-
-
-
-
1
occurs
x
4
=
4
=
4
-
3
-
-
-
-
-
-
-
3
-
3
-
-
-
3
-
-
-
-
-
3
occurs
x
4
=
12
1+2
3
-
-
-
-
4
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
4
occurs
x
1
=
4
=
4
-
-
5
-
-
5
-
-
-
-
-
-
-
5
-
-
-
-
5
-
-
5
occurs
x
4
=
20
2+0
2
-
-
-
-
-
-
-
-
-
-
-
-
-
-
7
-
-
7
-
-
-
7
occurs
x
2
=
14
1+4
5
-
-
-
9
-
-
9
-
-
-
-
-
-
-
-
-
-
-
-
-
-
9
occurs
x
2
=
18
1+8
9
17
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
29
-
-
17
-
72
-
27
1+7
-
-
9
-
-
9
-
-
-
-
-
-
-
-
-
-
-
-
-
-
2+9
-
-
1+7
-
7+2
-
2+7
8
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
11
-
-
8
-
9
-
9
-
3
5
9
4
5
9
1
1
3
-
3
1
5
7
3
1
7
5
-
-
1+1
-
-
-
-
-
-
-
8
U
N
I
V
E
R
S
A
L
-
L
A
N
G
U
A
G
E
-
-
2
-
-
8
-
9
-
9

 

 

-
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
9
1
-
5
-
-
-
-
-
+
=
15
1+5
=
6
=
6
=
6
-
-
-
-
-
-
9
19
-
14
-
-
-
-
-
+
=
42
4+2
=
6
=
6
=
6
-
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
-
1
3
3
-
-
-
-
-
3
4
2
5
9
+
=
30
3+0
=
3
=
3
=
3
-
-
1
12
12
-
-
-
-
-
21
13
2
5
18
+
=
84
8+4
=
12
1+2
3
=
3
-
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
-
1
12
12
-
9
19
-
14
21
13
2
5
18
+
=
126
1+2+6
=
9
=
9
=
9
-
-
1
3
3
-
9
1
-
5
3
4
2
5
9
+
=
45
4+5
=
9
=
9
=
9
-
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
-
1
-
-
-
-
1
-
-
-
-
-
-
-
-
-
1
occurs
x
2
=
2
=
2
-
-
-
-
-
-
-
-
-
-
-
-
2
-
-
-
-
2
occurs
x
1
=
2
=
2
-
-
-
3
3
-
-
-
-
-`
3
-
-
-
-
-
-
3
occurs
x
3
=
9
=
9
-
-
-
-
-
-
-
-
-
-
-
4
-
-
-
-
-
4
occurs
x
1
=
4
=
4
-
-
-
-
-
-
-
-
-
5
-
-
-
5
-
-
-
5
occurs
x
2
=
10
1+0
1
6
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
6
SIX
6
-
-
-
-
-
7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
7
SEVEN
7
-
-
-
-
-
8
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
8
EIGHT
8
-
-
-
-
-
-
-
-
-
-
-
9
-
-
-
-
-
-
-
9
-
-
9
occurs
x
2
=
18
1+8
9
21
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
24
-
-
11
-
45
-
27
2+1
1+1
-
-
-
-
9
-
-
-
-
-
-
-
9
-
-
2+4
-
-
1+1
-
4+5
-
2+7
3
2
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
6
-
-
2
-
9
-
9

 

 

11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
9
1
-
5
-
-
-
-
-
+
=
15
1+5
=
6
=
6
=
6
-
-
-
-
-
9
19
-
14
-
-
-
-
-
+
=
42
4+2
=
6
=
6
=
6
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
1
3
3
-
-
-
-
-
3
4
2
5
9
+
=
30
3+0
=
3
=
3
=
3
-
1
12
12
-
-
-
-
-
21
13
2
5
18
+
=
84
8+4
=
12
1+2
3
=
3
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
1
12
12
-
9
19
-
14
21
13
2
5
18
+
=
126
1+2+6
=
9
=
9
=
9
-
1
3
3
-
9
1
-
5
3
4
2
5
9
+
=
45
4+5
=
9
=
9
=
9
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
-
-
-
-
-
-
-
-
-
1
-
-
-
-
1
-
-
-
-
-
-
-
-
-
1
occurs
x
2
=
2
=
2
-
-
-
-
-
-
-
-
-
-
-
2
-
-
-
-
2
occurs
x
1
=
2
=
2
-
-
3
3
-
-
-
-
-`
3
-
-
-
-
-
-
3
occurs
x
3
=
9
=
9
-
-
-
-
-
-
-
-
-
-
4
-
-
-
-
-
4
occurs
x
1
=
4
=
4
-
-
-
-
-
-
-
-
5
-
-
-
5
-
-
-
5
occurs
x
2
=
10
1+0
1
-
-
-
-
-
9
-
-
-
-
-
-
-
9
-
-
9
occurs
x
2
=
18
1+8
9
11
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
24
-
-
11
-
45
-
27
1+1
-
-
-
-
9
-
-
-
-
-
-
-
9
-
-
2+4
-
-
1+1
-
4+5
-
2+7
2
A
L
L
-
I
S
-
N
U
M
B
E
R
-
-
6
-
-
2
-
9
-
9

 

 

-
ALL IS NUMBER
-
-
-
3
ALL
25
7
7
2
IS
28
10
1
6
NUMBER
73
28
1
11
ALL IS NUMBER
126
45
9
1+1
-
1+2+6
4+5
-
2
ALL IS NUMBER
9
9
9

 

 

 

 

 

A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
-
-
-
-
-
-
-
-
-
1+0
1+1
1+2
1+3
1+4
1+5
1+6
1+7
1+8
1+9
2+0
2+1
2+2
2+3
2+4
2+5
2+6
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z

 

 

 

WITH EPISODIC SENSE OF DE JAVU THE FAR YONDER SCRIBE AND OFT TIMES SHADOWED

SUBSTANCES WATCHED IN FINE AMAZE

THE

ZED ALIZ ZED

IN SWIFT REPEAT SCATTER THE SACRED NUMBERS AMONGST THE LETTERS OF THEIR PROGRESS

AT THE THROW OF THE NINTH RAM WHEN IN CONJUNCTION SET THE FAR YONDER SCRIBE MADE

RECORD OF THE FALL

 

 

NUMBER

9

THE SEARCH FOR THE SIGMA CODE

Cecil Balmond 1998

Cycles and Patterns

Page 165

Patterns

"The essence of mathematics is to look for patterns.

Our minds seem to be organised to search for relationships and sequences. We look for hidden orders.

These intuitions seem to be more important than the facts themselves, for there is always the thrill at finding something, a pattern, it is a discovery - what was unknown is now revealed. Imagine looking up at the stars and finding the zodiac!

Searching out patterns is a pure delight.

Suddenly the counters fall into place and a connection is found, not necessarily a geometric one, but a relationship between numbers, pictures of the mind, that were not obvious before. There is that excitement of finding order in something that was otherwise hidden.

And there is the knowledge that a huge unseen world lurks behind the facades we see of the numbers themselves."

 

 

4

ZERO

64

28

1
3

ONE
34
16
7
3

TWO
58
13
4
5

THREE
56
29
2
4

FOUR
60
24
6
4

FIVE
42
24
6
3

SIX
52
16
7
5

SEVEN
65
20
2
5

EIGHT
49
31
4
4

NINE
42
24
6
40
-
522
225
45
4+0
-
5+2+2
2+2+5
4+5
4
-
9
9
9

 

 

26
NUMERICAL VALUE OF ENGLISH ALPHABET A TO Z
351
126
9

 

 

3
3
-
A+B+C
6
6
6
2
-
2
D+E
9
9
9
3
3
-
F+G+H
21
21
3
1
-
1
I
9
9
9
3
3
-
J+K+L
33
6
6
2
-
2
M+N
27
9
9
2
2
-
O+P
31
13
4
3
-
3
QRS
54
18
9
3
-
3
TUV
63
9
9
3
-
3
WXY
72
18
9
1
1
-
Z
26
8
8
26
12
14
First Total
351
126
81
2+6
1+2
1+4
Add to Reduce
3+5+1
1+2+6
8+1
8
3
5
Reduce to Deduce
9
9
9

 

 

3
A+B+C
6
6
6
-
D+E
-
-
-
3
F+G+H
21
21
3
-
I
-
-
-
3
J+K+L
33
6
6
-
M+N
-
-
-
2
O+P
31
13
4
-
QRS
-
-
-
-
TUV
-
-
-
-
WXY
-
-
-
1
Z
26
8
8
12
First Total
117
54
27
2+6
Add to Reduce
1+1+7
5+4
2+7
8
Reduce to Deduce
9
9
9

 

 

-
A+B+C
-
-
-
2
D+E
9
9
9
-
F+G+H
-
-
-
1
I
9
9
9
-
J+K+L
-
-
-
2
M+N
27
9
9
-
O+P
-
-
-
3
QRS
54
18
9
3
TUV
63
9
9
3
WXY
72
18
9
-
Z
-
-
-
14
First Total
234
72
54
1+4
Add to Reduce
2+3+4
7+2
5+4
5
Reduce to Deduce
9
9
9

 

 

9
A
B
C
D
E
F
G
H
I
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
8
9
+
=
17
1+7
=
8
-
8
-
-
-
-
-
-
-
-
8
9
+
=
17
1+7
=
8
-
8
9
A
B
C
D
E
F
G
H
I
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
-
-
+
=
28
2+8
=
10
1+0
1
-
1
2
3
4
5
6
7
-
-
+
=
28
2+8
=
10
1+0
1
9
A
B
C
D
E
F
G
H
I
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
+
=
45
4+5
=
9
-
9
-
1
2
3
4
5
6
7
8
9
+
=
45
4+5
=
9
-
9
9
A
B
C
D
E
F
G
H
I
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
-
+
=
1
occurs
x
1
=
1
-
-
2
-
-
-
-
-
-
-
+
=
2
occurs
x
1
=
2
-
-
-
3
-
-
-
-
-
-
+
=
3
occurs
x
1
=
3
-
-
-
-
4
-
-
-
-
-
+
=
4
occurs
x
1
=
4
-
-
-
-
-
5
-
-
-
-
+
=
5
occurs
x
1
=
5
-
-
-
-
-
-
6
-
-
-
+
=
6
occurs
x
1
=
6
-
-
-
-
-
-
-
7
-
-
+
=
7
occurs
x
1
=
7
-
-
-
-
-
-
-
-
8
-
+
=
8
occurs
x
1
=
8
-
-
-
-
-
-
-
-
-
9
+
=
9
occurs
x
1
=
9
9
A
B
C
D
E
F
G
H
I
-
-
45
-
-
9
-
45
-
-
-
-
-
-
-
-
-
9
-
-
4+5
-
-
-
-
4+5
9
A
B
C
D
E
F
G
H
I
-
-
9
-
-
9
-
9
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
-
-
-
9
A
B
C
D
E
F
G
H
I
-
-
9
-
-
9
-
9

 

 

9
J
K
L
M
N
O
P
Q
R
-
-
-
-
-
-
-
-
-
-
-
-
-
5
6
-
-
-
+
=
11
1+1
=
2
-
2
-
-
-
-
-
14
15
-
-
-
+
=
11
1+7
=
2
-
2
9
J
K
L
M
N
O
P
Q
R
-
-
-
-
-
-
-
-
-
1
2
3
4
-
-
7
8
9
+
=
34
3+4
=
7
-
7
-
10
11
12
13
-
-
16
17
18
+
=
97
9+7
=
16
1+6
7
9
J
K
L
M
N
O
P
Q
R
-
-
-
-
-
-
-
-
-
10
11
12
13
14
15
16
17
18
+
=
126
1+2+6
=
9
-
9
-
1+0
1+1
1+2
1+3
1+4
1+5
1+6
1+7
1+8
-
-
-
-
-
-
-
-
9
1
2
3
4
5
6
7
8
9
+
=
45
4+5
=
9
-
9
-
J
K
L
M
N
O
P
Q
R
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
-
+
=
1
occurs
x
1
=
1
-
-
2
-
-
-
-
-
-
-
+
=
2
occurs
x
1
=
2
-
-
-
3
-
-
-
-
-
-
+
=
3
occurs
x
1
=
3
-
-
-
-
4
-
-
-
-
-
+
=
4
occurs
x
1
=
4
-
-
-
-
-
5
-
-
-
-
+
=
5
occurs
x
1
=
5
-
-
-
-
-
-
6
-
-
-
+
=
6
occurs
x
1
=
6
-
-
-
-
-
-
-
7
-
-
+
=
7
occurs
x
1
=
7
-
-
-
-
-
-
-
-
8
-
+
=
8
occurs
x
1
=
8
-
-
-
-
-
-
-
-
-
9
+
=
9
occurs
x
1
=
9
9
J
K
L
M
N
O
P
Q
R
-
-
45
-
-
9
-
45
-
-
-
-
-
-
-
-
-
9
-
-
4+5
-
-
-
-
4+5
9
J
K
L
M
N
O
P
Q
R
-
-
9
-
-
9
-
9
 
1
2
3
4
5
6
7
8
9
-
-
-
-
-
-
-
-
9
J
K
L
M
N
O
P
Q
R
-
-
9
-
-
9
-
9

 

 

8
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
1
-
-
-
-
6
-
8
+
=
15
1+5
=
6
-
6
-
19
-
-
-
-
24
-
26
+
=
69
6+9
=
15
-
6
8
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
2
3
4
5
-
7
-
+
=
21
2+1
=
3
-
3
-
-
20
21
22
23
-
25
-
+
=
111
1+1+1
=
3
-
3
8
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
19
20
21
22
23
24
25
26
+
=
180
1+8+0
=
9
-
9
-
1+9
2+0
2+1
2+2
2+3
2+4
2+5
2+6
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
+
=
36
3+6
=
9
-
9
8
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
+
=
1
occurs
x
1
=
1
-
-
2
-
-
-
-
-
-
+
=
2
occurs
x
1
=
2
-
-
-
3
-
-
-
-
-
+
=
3
occurs
x
1
=
3
-
-
-
-
4
-
-
-
-
+
=
4
occurs
x
1
=
4
-
-
-
-
-
5
-
-
-
+
=
5
occurs
x
1
=
5
-
-
-
-
-
-
6
-
-
+
=
6
occurs
x
1
=
6
-
-
-
-
-
-
-
7
-
+
=
7
occurs
x
1
=
7
-
-
-
-
-
-
-
-
8
+
=
8
occurs
x
1
=
8
8
S
T
U
V
W
X
Y
Z
-
-
36
-
-
8
-
36
-
-
-
-
-
-
-
-
-
-
-
3+6
-
-
-
-
3+6
8
S
T
U
V
W
X
Y
Z
-
-
9
-
-
8
-
9
-
1
2
3
4
5
6
7
8
-
-
-
-
-
-
-
-
8
S
T
U
V
W
X
Y
Z
-
-
9
-
-
8
-
9

 

 

26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
8
9
-
-
-
-
5
6
-
-
-
1
-
-
-
-
6
-
8
+
=
43
4+3
=
7
-
7
-
7
-
-
-
-
-
-
-
-
8
9
-
-
-
-
14
15
-
-
-
19
-
-
-
-
24
-
26
+
=
115
1+1+5
=
7
-
7
-
7
26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
-
-
1
2
3
4
-
-
7
8
9
-
2
3
4
5
-
7
-
+
=
83
8+3
=
11
1+1
2
-
2
-
1
2
3
4
5
6
7
-
-
10
11
12
13
-
-
16
17
18
-
20
21
22
23
-
25
-
+
=
236
2+3+6
=
11
1+1
2
-
2
26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
+
=
351
3+5+1
=
9
-
9
-
9
-
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
+
=
126
1+2+6
=
9
-
9
-
9
26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
+
=
1
occurs
x
3
=
3
-
3
-
-
2
-
-
-
-
-
-
-
-
2
-
-
-
-
-
-
-
-
2
-
-
-
-
-
-
+
=
2
occurs
x
3
=
6
-
6
-
-
-
3
-
-
-
-
-
-
-
-
3
-
-
-
-
-
-
-
-
3
-
-
-
-
-
+
=
3
occurs
x
3
=
9
-
9
-
-
-
-
4
-
-
-
-
-
-
-
-
4
-
-
-
-
-
-
-
-
4
-
-
-
-
+
=
4
occurs
x
3
=
12
1+2
3
-
-
-
-
-
5
-
-
-
-
-
-
-
-
5
-
-
-
-
-
-
-
-
5
-
-
-
+
=
5
occurs
x
3
=
15
1+5
6
-
-
-
-
-
-
6
-
-
-
-
-
-
-
-
6
-
-
-
-
-
-
-
-
6
-
-
+
=
6
occurs
x
3
=
18
1+8
9
-
-
-
-
-
-
-
7
-
-
-
-
-
-
-
-
7
-
-
-
-
-
-
-
-
7
-
+
=
7
occurs
x
3
=
21
2+1
3
-
-
-
-
-
-
-
-
8
-
-
-
-
-
-
-
-
8
-
-
-
-
-
-
-
-
8
+
=
8
occurs
x
3
=
24
2+4
6
-
-
-
-
-
-
-
-
-
9
-
-
-
-
-
-
-
-
9
-
-
-
-
-
-
-
-
+
=
9
occurs
x
2
=
18
1+8
9
26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
45
-
-
26
-
-
-
54
-
-
-
-
-
-
-
-
-
9
-
-
-
-
-
-
-
-
9
-
-
-
-
-
-
-
-
-
-
4+5
-
-
2+6
-
-
-
5+4
26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
9
-
-
8
-
-
-
9
-
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
9
1
2
3
4
5
6
7
8
-
-
-
-
-
-
-
-
-
-
26
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
-
-
9
-
-
8
-
-
-
9

 

 

-
ALL IS NUMBER
-
-
-
3
ALL
25
7
7
2
IS
28
10
1
6
NUMBER
73
28
1
11
ALL IS NUMBER
126
45
9
1+1
-
1+2+6
4+5
-
2
ALL IS NUMBER
9
9
9

 

 

THE CITY OF REVELATION

John Michell 1972

Gnostic Numbers 

Page 118

"Exactly how they came by their science of numbers is not certain, but they appear to have made the discovery that the numerical code of the Hebrew cabala and those of other mystical systems throughout the world were all degenerate versions of the same once universal system of knowledge that returns within the reach of human perception at certain intervals in time. As the revealed books of the Old Testament were written in a code to be interpreted by reference to number, so were the revelations of the gnostic prophets expressed in words and phrases formed on a system of proportion, which gave life and power to the Christian myth, while allowing initiates to gain a further understanding of the balance of forces that produce the world of phenomena."  

Page 121 / How it was ever supposed that the Hebrew alphabet of twenty- two letters, together with various geometrical symbols might serve to represent the entire moving pattern of the universe is not now easy to understand; but, since all ancient philosophy, religion, magic, the arts and sciences were based on the concept of a correspondence between numbers and cosmic law, it is impossible to appreciate the history of the past without some actual experience of the fundamental truth behind this approach to cosmology. Plato gives a remarkable account in Cratylos of the origin of language and letters. The philosopher is asked whether there is any particular significance in names, for surely they are simply a matter of convention and one is more or less as good as another. After all, foreigners call things by different names and appear to manage just as well as the Greeks in this respect. The answer given is that despite appearances the matter is by no means so simple. Words are the tools of expression, and the making of these, as of any other tools, is the task of a skilled craftsman, in this case the lawgiver. Language has grown corrupt over the ages, and names have deviated from their original perfect forms, which are those used by the gods. But all names were originally formed on certain principles, through knowledge of which it is possible to discover the archetypal meaning of words in current use. 'So perhaps the man who knows about names considers their value and is not confused if some letter is added, transposed or subtracted, or even if the force of the name is expressed in quite different letters.' This is Plato's clearest reference to the mystical science of the cabala, in which letters, words and whole phrases may be substituted for others of the same numerical value. The force of a name is to be found in its number, and can be expressed through any combination of letters, provided the sum of the letters amounts to the appropriate number by gematria.

 

THE MAGIC ALPHABET

 

A
=
1
-
9
ABCDEFGHI
45
45
45
-
-
-
-
-
-
-
-
-
-
J
=
1
-
9
JKLMNOPQR
126
45
45
-
-
-
-
-
-
-
-
-
-
S
=
1
-
8
STUVWXYZ
180
45
36
-
-
-
-
-
-
-
-
-
-
-
-
-
-
351
135
126
-
1
2
3
4
5
6
7
8
9
A
=
1
1
1
A
1
1
1
-
1
-
-
-
-
-
-
-
-
B
=
2
2
1
B
2
2
2
-
-
2
-
-
-
-
-
-
-
C
=
3
3
1
C
3
3
3
-
-
-
3
-
-
-
-
-
-
D
=
4
4
1
D
4
4
4
-
-
-
-
4
-
-
-
-
-
E
=
5
5
1
E
5
5
5
-
-
-
-
-
5
-
-
-
-
F
=
6
6
1
F
6
6
6
-
-
-
-
-
-
6
-
-
-
G
=
7
7
1
G
7
7
7
-
-
-
-
-
-
-
7
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
-
-
-
8
-
I
=
9
9
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
45
-
-
-
45
45
45
-
-
-
-
-
-
-
-
-
-
J
=
1
10
1
J
10
1
1
-
1
-
-
-
-
-
-
-
-
K
=
2
11
1
K
11
2
2
-
-
2
-
-
-
-
-
-
-
L
=
3
12
1
L
12
3
3
-
-
-
3
-
-
-
-
-
-
M
=
4
13
1
M
13
4
4
-
-
-
-
4
-
-
-
-
-
N
=
5
14
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
O
=
6
15
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
P
=
7
16
1
P
16
7
7
-
-
-
-
-
-
-
7
-
-
Q
=
8
17
1
Q
17
8
8
-
-
-
-
-
-
-
-
8
-
R
=
9
18
1
R
18
9
9
-
-
-
-
-
-
-
-
-
9
45
-
-
-
126
45
45
-
-
-
-
-
-
-
-
-
-
S
=
1
19
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
T
=
2
20
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
U
=
3
21
1
U
21
3
3
-
-
-
3
-
-
-
-
-
-
V
=
4
22
1
V
22
4
4
-
-
-
-
4
-
-
-
-
-
W
=
5
23
1
W
23
5
5
-
-
-
-
-
5
-
-
-
-
X
=
6
24
1
X
24
6
6
-
-
-
-
-
-
6
-
-
-
Y
=
7
25
1
Y
25
7
7
-
-
-
-
-
-
-
7
-
-
Z
=
8
26
1
Z
26
8
8
-
-
-
-
-
-
-
-
8
-
36
-
-
-
180
45
36
-
-
-
-
-
-
-
-
-
-
126
-
-
-
-
-
-
-
3
6
9
12
15
18
21
24
18
-
-
1+2+6
-
9
ABCDEFGHI
45
45
45
-
-
-
-
1+2
1+5
1+8
2+1
2+4
1+8
-
-
9
-
9
JKLMNOPQR
126
45
45
-
3
6
9
3
6
9
3
6
9
-
-
-
-
8
STUVWXYZ
180
45
36
-
-
-
-
-
-
-
-
-
-
-
-
9
-
26
ADD TO REDUCE
351
135
126
-
3
6
9
3
6
9
3
6
9
-
-
-
-
2+6
REDUCE TO DEDUCE
3+5+1
1+3+5
1+2+6
-
-
-
-
-
-
-
-
-
-
-
-
9
-
8
ESSENCE OF NUMBER
9
9
9
-
3
6
9
3
6
9
3
6
9

 

 

A
=
1
-
9
ABCDEFGHI
45
45
45
-
-
-
-
-
-
-
-
-
-
J
=
1
-
9
JKLMNOPQR
126
45
45
-
-
-
-
-
-
-
-
-
-
S
=
1
-
8
STUVWXYZ
180
45
36
-
-
-
-
-
-
-
-
-
-
-
-
-
-
351
135
126
-
1
2
3
4
5
6
7
8
9
A
=
1
1
1
A
1
1
1
-
1
-
-
-
-
-
-
-
-
B
=
2
2
1
B
2
2
2
-
-
2
-
-
-
-
-
-
-
C
=
3
3
1
C
3
3
3
-
-
-
3
-
-
-
-
-
-
D
=
4
4
1
D
4
4
4
-
-
-
-
4
-
-
-
-
-
E
=
5
5
1
E
5
5
5
-
-
-
-
-
5
-
-
-
-
F
=
6
6
1
F
6
6
6
-
-
-
-
-
-
6
-
-
-
G
=
7
7
1
G
7
7
7
-
-
-
-
-
-
-
7
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
-
-
-
8
-
I
=
9
9
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
J
=
1
10
1
J
10
1
1
-
1
-
-
-
-
-
-
-
-
K
=
2
11
1
K
11
2
2
-
-
2
-
-
-
-
-
-
-
L
=
3
12
1
L
12
3
3
-
-
-
3
-
-
-
-
-
-
M
=
4
13
1
M
13
4
4
-
-
-
-
4
-
-
-
-
-
N
=
5
14
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
O
=
6
15
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
P
=
7
16
1
P
16
7
7
-
-
-
-
-
-
-
7
-
-
Q
=
8
17
1
Q
17
8
8
-
-
-
-
-
-
-
-
8
-
R
=
9
18
1
R
18
9
9
-
-
-
-
-
-
-
-
-
9
S
=
1
19
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
T
=
2
20
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
U
=
3
21
1
U
21
3
3
-
-
-
3
-
-
-
-
-
-
V
=
4
22
1
V
22
4
4
-
-
-
-
4
-
-
-
-
-
W
=
5
23
1
W
23
5
5
-
-
-
-
-
5
-
-
-
-
X
=
6
24
1
X
24
6
6
-
-
-
-
-
-
6
-
-
-
Y
=
7
25
1
Y
25
7
7
-
-
-
-
-
-
-
7
-
-
Z
=
8
26
1
Z
26
8
8
-
-
-
-
-
-
-
-
8
-
126
-
-
-
-
-
-
-
3
6
9
12
15
18
21
24
18
-
-
1+2+6
-
9
ABCDEFGHI
45
45
45
-
-
-
-
1+2
1+5
1+8
2+1
2+4
1+8
-
-
9
-
9
JKLMNOPQR
126
45
45
-
3
6
9
3
6
9
3
6
9
-
-
-
-
8
STUVWXYZ
180
45
36
-
-
-
-
-
-
-
-
-
-
-
-
9
-
26
ADD TO REDUCE
351
135
126
-
3
6
9
3
6
9
3
6
9
-
-
-
-
2+6
REDUCE TO DEDUCE
3+5+1
1+3+5
1+2+6
-
-
-
-
-
-
-
-
-
-
-
-
9
-
8
ESSENCE OF NUMBER
9
9
9
-
3
6
9
3
6
9
3
6
9

 

 

A
=
1
-
9
ABCDEFGHI
45
45
45
-
-
-
-
-
-
-
-
-
-
J
=
1
-
9
JKLMNOPQR
126
45
45
-
-
-
-
-
-
-
-
-
-
S
=
1
-
8
STUVWXYZ
180
45
36
-
-
-
-
-
-
-
-
-
-
-
-
-
-
351
135
126
-
1
2
3
4
5
6
7
8
9
A
=
1
1
1
A
1
1
1
-
1
-
-
-
-
-
-
-
-
J
=
1
10
1
J
10
1
1
-
1
-
-
-
-
-
-
-
-
S
=
1
19
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
B
=
2
2
1
B
2
2
2
-
-
2
-
-
-
-
-
-
-
K
=
2
11
1
K
11
2
2
-
-
2
-
-
-
-
-
-
-
T
=
2
20
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
C
=
3
3
1
C
3
3
3
-
-
-
3
-
-
-
-
-
-
L
=
3
12
1
L
12
3
3
-
-
-
3
-
-
-
-
-
-
U
=
3
21
1
U
21
3
3
-
-
-
3
-
-
-
-
-
-
D
=
4
4
1
D
4
4
4
-
-
-
-
4
-
-
-
-
-
M
=
4
13
1
M
13
4
4
-
-
-
-
4
-
-
-
-
-
V
=
4
22
1
V
22
4
4
-
-
-
-
4
-
-
-
-
-
E
=
5
5
1
E
5
5
5
-
-
-
-
-
5
-
-
-
-
N
=
5
14
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
W
=
5
23
1
W
23
5
5
-
-
-
-
-
5
-
-
-
-
F
=
6
6
1
F
6
6
6
-
-
-
-
-
-
6
-
-
-
O
=
6
15
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
X
=
6
24
1
X
24
6
6
-
-
-
-
-
-
6
-
-
-
G
=
7
7
1
G
7
7
7
-
-
-
-
-
-
-
7
-
-
P
=
7
16
1
P
16
7
7
-
-
-
-
-
-
-
7
-
-
Y
=
7
25
1
Y
25
7
7
-
-
-
-
-
-
-
7
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
-
-
-
8
-
Q
=
8
17
1
Q
17
8
8
-
-
-
-
-
-
-
-
8
-
Z
=
8
26
1
Z
26
8
8
-
-
-
-
-
-
-
-
8
-
I
=
9
9
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
R
=
9
18
1
R
18
9
9
-
-
-
-
-
-
-
-
-
9
126
-
-
-
-
-
-
-
3
6
9
12
15
18
21
24
18
-
-
1+2+6
-
9
ABCDEFGHI
45
45
45
-
-
-
-
1+2
1+5
1+8
2+1
2+4
1+8
-
-
9
-
9
JKLMNOPQR
126
45
45
-
3
6
9
3
6
9
3
6
9
-
-
-
-
8
STUVWXYZ
180
45
36
-
-
-
-
-
-
-
-
-
-
-
-
9
-
26
ADD TO REDUCE
351
135
126
-
3
6
9
3
6
9
3
6
9
-
-
-
-
2+6
REDUCE TO DEDUCE
3+5+1
1+3+5
1+2+6
-
-
-
-
-
-
-
-
-
-
-
-
9
-
8
ESSENCE OF NUMBER
9
9
9
-
3
6
9
3
6
9
3
6
9

 

 

LETTERS TRANSPOSED INTO NUMBER

RE-ARRANGED IN NUMERICAL ORDER

 

S
=
1
-
8
STUVWXYZ
180
36
36
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
-
-
-
-
-
-
-
S
=
1
19
1
S
19
1
1
-
1
-
-
-
-
-
-
-
-
T
=
2
20
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
U
=
3
21
1
U
21
3
3
-
-
-
3
-
-
-
-
-
-
V
=
4
22
1
V
22
4
4
-
-
-
-
4
-
-
-
-
-
W
=
5
23
1
W
23
5
5
-
-
-
-
-
5
-
-
-
-
X
=
6
24
1
X
24
6
6
-
-
-
-
-
-
6
-
-
-
Y
=
7
25
1
Y
25
7
7
-
-
-
-
-
-
-
7
-
-
Z
=
8
26
1
Z
26
8
8
-
-
-
-
-
-
-
-
8
-
36
-
8
STUVWXYZ
180
36
36
-
1
2
3
4
5
6
7
8
9
-
-
3+6
-
-
-
1+8+0
3+6
3+6
-
-
-
-
-
-
-
-
-
-
-
-
9
-
8
STUVWXYZ
9
9
9
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
9
-
8
STUVWXYZ
9
9
9
-
1
2
3
4
5
6
7
8
9

 

STUVWXYZ 180 ZYXWVUTS

STUVWXYZ 36 ZYXWVUTS

STUVWXYZ 9 ZYXWVUTS

 

 

JUST SIX NUMBERS

Martin Rees

1
999

OUR COSMIC HABITAT

PLANETS STARS AND LIFE

Page 24

A

proton

is

1,836 times heavier than an electron, and the number 1,836

would have the same connotations to any 'intelligence'

Page 24 / 25
"A manifestly artificial signal- even if it were as boring as lists of prime numbers, or the digits of 'pi' - would imply that 'intelli- gence' wasn't unique to the Earth and had evolved elsewhere. The nearest potential sites are so far away that signals would take many years in transit. For this reason alone, transmission would be primarily one-way. There would be time to send a measured response, but no scope for quick repartee!
Any remote beings who could communicate with us would have some concepts of mathematics and logic that paralleled our own. And they would also share a knowledge of the basic particles and forces that govern our universe. Their habitat may be very different (and the biosphere even more different) from ours here on Earth; but they, and their planet, would be made of atoms just like those on Earth. For them, as for us, the most important particles would be protons and electrons: one electron orbiting a proton makes a hydrogen atom, and electric currents and radio transmitters involve streams of electrons. A proton is 1,836 times heavier than an electron, and the number 1,836 would have the same connotations to any 'intelligence' "able and motivated to transmit radio signals. All the basic forces and natural laws would be the same. Indeed, this uniformity - without which our universe would be a far more baffling place - seems to extend to the remotest galaxies that astronomers can study. (Later chapters in this book will, however, speculate about other 'universes', forever beyond range of our telescopes, where different laws may prevail.)
Clearly, alien beings wouldn't use metres, kilograms or seconds. But we could exchange information about the ratios of two masses (such as thc ratio of proton and electron masses) or of two lengths, which are 'pure numbers' that don't depend on what units are used: the statement that one rod is ten times as long as another is true (or false) whether we measure lengths / in feet or metres or some alien units

 

A

proton

is

1,836 times heavier than an electron, and the number 1,836

would have the same connotations to any 'intelligence'

 

E
=
5
-
8
EIGHTEEN
73
46
1
T
=
2
-
9
THIRTYSIX
152
53
8
-
-
7
4
17
First Total
225
99
9
-
-
-
-
1+7
Add to Reduce
2+2+5
9+9
-
Q
-
7
-
8
Second Total
9
18
9
-
-
-
-
-
Reduce to Deduce
-
1+8
-
Q
-
7
-
8
Essence of Number
9
9
9

 

 

3
SUN
54
9
9
5
EARTH
52
25
7
4
MOON
57
21
3
12
First Total
163
55
19
1+2
Add to Reduce
1+6+3
5+5
6+2
3
Second Total
10
10
10
-
Reduce to Deduce
1+0
1+0
1+0
3
Essence of Number
1
1
1

 

 

THE CODE BOOK

The Science of Secrecy from Ancient Egypt to Quantum Cryptography

Simon Singh 1999

Page 16

Significantly, the religious scholars did not stop their scrutiny at the level of words. They also analysed individual letters and in particular they /Page 17/ discovered that some letters are more common than others. The letters a and I are the most common in Arabic, partly because of the definite article al-, whereas the letter j appears only a tenth as frequently. This apparently innocuous observation would lead to the first great breakthrough in cryptanalysis.
Although it is not known who first realised that the variation in the frequencies of letters could be exploited in order to break ciphers, the earliest known description of the technique is by the ninth-century scientist Abu Yasilf Ya`qub ibn Is-haq ibn as-Sabbah ibn 'omran ibn Ismail al-Kindi. Known as 'the philosopher of the Arabs', al-Kindi was the author of 290 books on medicine, astronomy, mathematics, linguistics and music. His greatest treatise, which was rediscovered only in 1987 in the Sulaimaniyyah Ottoman Archive in Istanbul, is entitled A Manuscript air Deciphering Cryptographic Messages; the first page is shown in Figure 6. Although it contains detailed discussions on statistics, Arabic phonetics and Arabic syntax, al-Kindi's revolutionary system of cryptanalysis is enapsulated in two short paragraphs:
One way to solve an encrypted message, if we know its language, is to find a different plaintext of the same language long enough to fill one sheet or so, and then we count the occurrences of each letter. We call the most liequently occurring letter the 'first', the next most occurring letter the `second', the following most occurring letter the 'third', and so on, until we amount for all the different letters in the plaintext sample.
Then we look at the ciphertext we want to solve and we also classify its symbols. We find the most occurring symbol and change it to the form of 'the 'first' letter of the plaintext sample, the next most common symbol is cbanged to the form of the 'second' letter, and the following most common gambol is changed to the form of the 'third' letter, and so on, until we account for all symbols of the cryptogram we want to solve.
ms's explanation is easier to explain in terms of the English alphabet. Most of all, it is necessary to study a lengthy piece of normal English text, perhaps several, in order to establish the frequency of each letter of the alphabet. In English, e is the most common letter, followed by t, then a, and so on, as given in Table 1. Next, examine the ciphertext in question, and work out the frequency of each letter.

 

Page 199 "...e, the most commonly used letter of the English alphabet

 

ABCDEFGHIJKLMNOPQRSTUVWXYZ

ABCD5FGHIJKLMNOPQRSTUVWXYZ

ABCDEFGHIJKLMNOPQRSTUVWXYZ

 

 

THE CODE BOOK

The Science of Secrecy from Ancient Egypt to Quantum Cryptography

Simon Singh 1999

Page 245

Even though we are dealing with computers and numbers, and not machines and letters, the encryption still proceeds by the age old principle of substitution and transposition, in which elements of the message are substituted for other elements, or their positions are switched, or both

.

S
=
1
-
12
SUBSTITUTION
189
63
9
T
=
2
-
13
TRANSPOSITION
189
81
9

 

/Page 246/ Every encipherment, no matter how complex, can be broken down into combinations of these simple operations.

 

S
=
1
-
12
SUBSTITUTION
189
63
9

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
SUBSTITUTION
-
-
-
-
-
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
-
-
-
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
U
=
3
-
1
U
12
3
3
-
-
-
3
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
O
=
6
-
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
-
-
45
-
12
SUBSTITUTION
189
63
45
-
2
8
6
4
5
6
7
8
18
-
-
4+5
-
1+2
-
1+8+9
6+3
4+5
-
-
-
-
-
-
-
-
-
1+8
-
9
-
3
SUBSTITUTION
18
9
9
-
2
8
6
4
5
6
7
8
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
-
-
-
9
-
3
SUBSTITUTION
9
9
9
-
2
8
6
4
5
6
7
8
9

 

S
=
1
-
12
SUBSTITUTION
189
63
9

 

-
-
-
-
-
-
-
-
-
-
1
2
3
5
6
9
-
-
-
-
-
SUBSTITUTION
-
-
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
U
=
3
-
1
U
12
3
3
-
-
-
3
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
O
=
6
-
1
O
15
6
6
-
-
-
-
-
6
-
N
=
5
-
1
N
14
5
5
-
-
-
-
5
-
-
-
-
45
-
12
SUBSTITUTION
189
63
45
-
2
8
6
5
6
18
-
-
4+5
-
1+2
-
1+8+9
6+3
4+5
-
-
-
-
-
-
1+8
-
9
-
3
SUBSTITUTION
18
9
9
-
2
8
6
5
6
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
9
-
3
SUBSTITUTION
9
9
9
-
2
8
6
5
6
9

 

S
=
1
-
12
SUBSTITUTION
189
63
9

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
SUBSTITUTION
-
-
-
-
-
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
-
-
-
-
U
=
3
-
1
U
12
3
3
-
-
-
3
-
-
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
-
-
45
-
12
SUBSTITUTION
189
63
45
-
2
8
6
4
5
6
7
8
18
-
-
4+5
-
1+2
-
1+8+9
6+3
4+5
-
-
-
-
-
-
-
-
-
1+8
-
9
-
3
SUBSTITUTION
18
9
9
-
2
8
6
4
5
6
7
8
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
-
-
-
9
-
3
SUBSTITUTION
9
9
9
-
2
8
6
4
5
6
7
8
9

 

S
=
1
-
12
SUBSTITUTION
189
63
9

 

-
-
-
-
-
-
-
-
-
-
1
2
3
5
6
9
-
-
-
-
-
SUBSTITUTION
-
-
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
-
U
=
3
-
1
U
12
3
3
-
-
-
3
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
5
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
-
6
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
-
-
45
-
12
SUBSTITUTION
189
63
45
-
2
8
6
5
6
18
-
-
4+5
-
1+2
-
1+8+9
6+3
4+5
-
-
-
-
-
-
1+8
-
9
-
3
SUBSTITUTION
18
9
9
-
2
8
6
5
6
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
9
-
3
SUBSTITUTION
9
9
9
-
2
8
6
5
6
9

 

 

THE CODE BOOK

The Science of Secrecy from Ancient Egypt to Quantum Cryptography

Simon Singh 1999

Page 245

Even though we are dealing with computers and numbers, and not machines and letters, the encryption still proceeds by the age old principle of substitution and transposition, in which elements of the message are substituted for other elements, or their positions are switched, or both.

 

S
=
1
-
12
SUBSTITUTION
189
63
9
T
=
2
-
13
TRANSPOSITION
189
81
9

 

Page 246

Every encipherment, no matter how complex, can be broken down into combinations of these simple operations.

 

T
=
2
-
13
TRANSPOSITION
189
81
9

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
TRANSPOSITION
-
-
-
-
-
-
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
-
-
-
9
A
=
1
-
1
A
1
1
1
-
1
-
-
-
-
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
P
=
7
-
1
P
16
7
7
-
-
-
-
-
-
-
7
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
O
=
6
-
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
-
-
45
-
13
TRANSPOSITION
189
81
63
-
3
4
3
4
10
12
7
8
27
-
-
4+5
-
1+3
-
1+8+9
8+1
6+3
-
-
-
-
-
1+0
1+2
-
-
2+7
-
9
-
4
TRANSPOSITION
18
9
9
-
3
4
3
4
1
3
7
8
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
-
-
-
9
-
4
TRANSPOSITION
9
9
9
-
3
4
3
4
1
3
7
8
9

 

T
=
2
-
13
TRANSPOSITION
189
81
9

 

-
-
-
-
-
-
-
-
-
-
1
2
5
6
7
9
-
-
-
-
-
TRANSPOSITION
-
-
-
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
9
A
=
1
-
1
A
1
1
1
-
1
-
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
5
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
P
=
7
-
1
P
16
7
7
-
-
-
-
-
7
-
O
=
6
-
1
O
15
6
6
-
-
-
-
6
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
O
=
6
-
1
O
15
6
6
-
-
-
-
6
-
-
N
=
5
-
1
N
14
5
5
-
-
-
5
-
-
-
-
-
45
-
13
TRANSPOSITION
189
81
63
-
3
4
10
12
7
27
-
-
4+5
-
1+3
-
1+8+9
8+1
6+3
-
-
-
1+0
1+2
-
2+7
-
9
-
4
TRANSPOSITION
18
9
9
-
3
4
1
3
7
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
9
-
4
TRANSPOSITION
9
9
9
-
3
4
1
3
7
9

 

T
=
2
-
13
TRANSPOSITION
189
81
9

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
TRANSPOSITION
-
-
-
-
-
-
-
-
-
-
-
-
-
A
=
1
-
1
A
1
1
1
-
1
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
-
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
P
=
7
-
1
P
16
7
7
-
-
-
-
-
-
-
7
-
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
-
-
-
9
-
-
45
-
13
TRANSPOSITION
189
81
63
-
3
4
3
4
10
12
7
8
27
-
-
4+5
-
1+3
-
1+8+9
8+1
6+3
-
-
-
-
-
1+0
1+2
-
-
2+7
-
9
-
4
TRANSPOSITION
18
9
9
-
3
4
3
4
1
3
7
8
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
-
-
-
9
-
4
TRANSPOSITION
9
9
9
-
3
4
3
4
1
3
7
8
9

 

T
=
2
-
13
TRANSPOSITION
189
81
9

 

-
-
-
-
-
-
-
-
-
-
1
2
5
6
7
9
-
-
-
-
-
TRANSPOSITION
-
-
-
-
-
-
-
-
-
-
A
=
1
-
1
A
1
1
1
-
1
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
S
=
1
-
1
S
19
10
1
-
1
-
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
T
=
2
-
1
T
20
2
2
-
-
2
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
5
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
5
-
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
6
-
-
O
=
6
-
1
O
15
6
6
-
-
-
-
6
-
-
P
=
7
-
1
P
16
7
7
-
-
-
-
-
7
-
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
I
=
9
-
1
I
9
9
9
-
-
-
-
-
-
9
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
9
-
-
45
-
13
TRANSPOSITION
189
81
63
-
3
4
10
12
7
27
-
-
4+5
-
1+3
-
1+8+9
8+1
6+3
-
-
-
1+0
1+2
-
2+7
-
9
-
4
TRANSPOSITION
18
9
9
-
3
4
1
3
7
9
-
-
-
-
-
-
1+8
-
-
-
-
-
-
-
-
-
-
9
-
4
TRANSPOSITION
9
9
9
-
3
4
1
3
7
9

 

 

D
=
4
-
-
DICTIONARY
-
-
-
-
-
-
-
1
D
4
4
4
-
-
-
-
1
I
9
9
9
-
-
-
-
1
C
3
3
3
-
-
-
-
1
T
20
2
2
-
-
-
-
1
I
9
9
9
-
-
-
-
1
O
15
6
6
-
-
-
-
1
N
14
5
5
-
-
-
-
1
A
1
1
1
-
-
-
-
1
R
18
9
9
-
-
-
-
1
Y
25
7
7
D
=
4
Q
10
DICTIONARY
118
55
55
-
-
-
-
1+0
-
1+1+8
5+5
5+5
D
=
4
Q
1
DICTIONARY
10
10
10
-
-
-
-
-
-
1+0
1+0
1+0
D
=
4
Q
1
DICTIONARY
1
1
1

 

 

D
=
4
-
-
DICTIONARY
-
-
-
-
-
-
-
1
A
1
1
1
-
-
-
-
1
T
20
2
2
-
-
-
-
1
C
3
3
3
-
-
-
-
1
D
4
4
4
-
-
-
-
1
N
14
5
5
-
-
-
-
1
O
15
6
6
-
-
-
-
1
Y
25
7
7
-
-
-
-
1
I
9
9
9
-
-
-
-
1
I
9
9
9
-
-
-
-
1
R
18
9
9
D
=
4
Q
10
DICTIONARY
118
55
55
-
-
-
-
1+0
-
1+1+8
5+5
5+5
D
=
4
Q
1
DICTIONARY
10
10
10
-
-
-
-
-
-
1+0
1+0
1+0
D
=
4
Q
1
DICTIONARY
1
1
1

 

 

D
=
4
-
-
DICTIONARY
-
-
-
-
-
-
-
1
D
4
4
4
-
-
-
-
1
I
9
9
9
-
-
-
-
1
C+T
23
5
5
-
-
-
-
1
I
9
9
9
-
-
-
-
1
O+N+A
30
12
3
-
-
-
-
1
R
18
9
9
-
-
-
-
1
Y
25
7
7
D
=
4
Q
10
DICTIONARY
118
55
46
-
-
-
-
1+0
-
1+1+8
5+5
4+6
D
=
4
Q
1
DICTIONARY
10
10
10
-
-
-
-
-
-
1+0
1+0
-
D
=
4
Q
1
DICTIONARY
1
1
1

 

 

T
=
2
Q
3
THE
33
15
6
E
=
5
Q
7
ENGLISH
74
38
2
D
=
4
Q
10
DICTIONARY
118
55
1
-
-
11
Q
20
Add to Reduce
225
108
9
Q
Q
1+1
-
2+0
Reduce to Deduce
1+1+8
1+0+8
-
-
-
2
Q
2
Essence of Number
9
9
9

 

 

ABCDEFGH I JKLMNOPQ R STUVWXYZ = 351 = ZYXWVUTS R QPONMLKJ I HGFEDCBA

ABCDEFGH I JKLMNOPQ R STUVWXYZ = 126 = ZYXWVUTS R QPONMLKJ I HGFEDCBA

ABCDEFGH I JKLMNOPQ R STUVWXYZ = 9 = ZYXWVUTS R QPONMLKJ I HGFEDCBA

 

 

www.merriam-webster.com/dictionary/algorithm

a procedure for solving a mathematical problem (as of finding the greatest common divisor) in a finite number of steps that frequently involves repetition of an ...

algorithm [ˈælgəˌrɪðəm]
n
1. (Mathematics) a logical arithmetical or computational procedure that if correctly applied ensures the solution of a problem Compare heuristic
2. (Mathematics) Logic Maths a recursive procedure whereby an infinite sequence of terms can be generated Also called algorism
[changed from algorism, through influence of Greek arithmos number]
algorithmic adj
aal·go·rithm (lg-rm)
n.
A step-by-step problem-solving procedure, especially an established, recursive computational procedure for solving a problem in a finite number of steps.
algorithmically adv

algorithm (lg-rthm)
A finite set of unambiguous instructions performed in a prescribed sequence to achieve a goal, especially a mathematical rule or procedure used to compute a desired result. Algorithms are the basis for most computer programming.

Noun 1. algorithm - a precise rule (or set of rules) specifying how to solve some problem
algorithmic program, algorithmic rule
formula, rule - (mathematics) a standard procedure for solving a class of mathematical problems; "he determined the upper bound with Descartes' rule of signs"; "he gave us a general formula for attacking polynomials"
sorting algorithm - an algorithm for sorting a list
stemming algorithm, stemmer - an algorithm for removing inflectional and derivational endings in order to reduce word forms to a common stem algorithm
any methodology for solving a certain kind of problem.
See also: Mathematics

 

 

Algorithm
From Wikipedia, the free encyclopedia

Flow chart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" (or true) (more accurately the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
In mathematics and computer science, an algorithm (i/ˈælɡərɪðəm/) is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning.

More precisely, an algorithm is an effective method expressed as a finite list[1] of well-defined instructions[2] for calculating a function.[3] Starting from an initial state and initial input (perhaps empty),[4] the instructions describe a computation that, when executed, will proceed through a finite [5] number of well-defined successive states, eventually producing "output"[6] and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.[7]

Though al-Khwārizmī's algorism referred to the rules of performing arithmetic using Hindu-Arabic numerals and the systematic solution of linear and quadratic equations, a partial formalization of what would become the modern algorithm began with attempts to solve the Entscheidungsproblem (the "decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability"[8] or "effective method";[9] those formalizations included the Gödel–Herbrand–Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's "Formulation 1" of 1936, and Alan Turing's Turing machines of 1936–7 and 1939. Giving a formal definition of algorithms, corresponding to the intuitive notion, remains a challenging problem.[10]

Informal definition
For a detailed presentation of the various points of view around the definition of "algorithm" see Algorithm characterizations. For examples of simple addition algorithms specified in the detailed manner described in Algorithm characterizations, see Algorithm examples.
While there is no generally accepted formal definition of "algorithm," an informal definition could be "a set of rules that precisely defines a sequence of operations."[11] For some people, a program is only an algorithm if it stops eventually; for others, a program is only an algorithm if it stops before a given number of calculation steps.[12]

A prototypical example of an algorithm is Euclid's algorithm to determine the maximum common divisor of two integers; an example (there are others) is described by the flow chart above and as an example in a later section.

Boolos & Jeffrey (1974, 1999) offer an informal meaning of the word in the following quotation:

No human being can write fast enough, or long enough, or small enough† ( †"smaller and smaller without limit ...you'd be trying to write on molecules, on atoms, on electrons") to list all members of an enumerably infinite set by writing out their names, one after another, in some notation. But humans can do something equally useful, in the case of certain enumerably infinite sets: They can give explicit instructions for determining the nth member of the set, for arbitrary finite n. Such instructions are to be given quite explicitly, in a form in which they could be followed by a computing machine, or by a human who is capable of carrying out only very elementary operations on symbols.[13]

The term "enumerably infinite" means "countable using integers perhaps extending to infinity." Thus, Boolos and Jeffrey are saying that an algorithm implies instructions for a process that "creates" output integers from an arbitrary "input" integer or integers that, in theory, can be chosen from 0 to infinity. Thus an algorithm can be an algebraic equation such as y = m + n—two arbitrary "input variables" m and n that produce an output y. But various authors' attempts to define the notion indicate that the word implies much more than this, something on the order of (for the addition example):
Precise instructions (in language understood by "the computer")[14] for a fast, efficient, "good"[15] process that specifies the "moves" of "the computer" (machine or human, equipped with the necessary internally contained information and capabilities)[16] to find, decode, and then process arbitrary input integers/symbols m and n, symbols + and = ... and "effectively"[17] produce, in a "reasonable" time,[18] output-integer y at a specified place and in a specified format.
The concept of algorithm is also used to define the notion of decidability. That notion is central for explaining how formal systems come into being starting from a small set of axioms and rules. In logic, the time that an algorithm requires to complete cannot be measured, as it is not apparently related with our customary physical dimension. From such uncertainties, that characterize ongoing work, stems the unavailability of a definition of algorithm that suits both concrete (in some sense) and abstract usage of the term.

[edit] Formalization

Algorithms are essential to the way computers process data. Many computer programs contain algorithms that detail the specific instructions a computer should perform (in a specific order) to carry out a specified task, such as calculating employees' paychecks or printing students' report cards. Thus, an algorithm can be considered to be any sequence of operations that can be simulated by a Turing-complete system. Authors who assert this thesis include Minsky (1967), Savage (1987) and Gurevich (2000):

Minsky: "But we will also maintain, with Turing . . . that any procedure which could "naturally" be called effective, can in fact be realized by a (simple) machine. Although this may seem extreme, the arguments . . . in its favor are hard to refute".[19]

Gurevich: "...Turing's informal argument in favor of his thesis justifies a stronger thesis: every algorithm can be simulated by a Turing machine ... according to Savage [1987], an algorithm is a computational process defined by a Turing machine".[20]

Typically, when an algorithm is associated with processing information, data is read from an input source, written to an output device, and/or stored for further processing. Stored data is regarded as part of the internal state of the entity performing the algorithm. In practice, the state is stored in one or more data structures.

For some such computational process, the algorithm must be rigorously defined: specified in the way it applies in all possible circumstances that could arise. That is, any conditional steps must be systematically dealt with, case-by-case; the criteria for each case must be clear (and computable).

Because an algorithm is a precise list of precise steps, the order of computation will always be critical to the functioning of the algorithm. Instructions are usually assumed to be listed explicitly, and are described as starting "from the top" and going "down to the bottom", an idea that is described more formally by flow of control.

So far, this discussion of the formalization of an algorithm has assumed the premises of imperative programming. This is the most common conception, and it attempts to describe a task in discrete, "mechanical" means. Unique to this conception of formalized algorithms is the assignment operation, setting the value of a variable. It derives from the intuition of "memory" as a scratchpad. There is an example below of such an assignment.

For some alternate conceptions of what constitutes an algorithm see functional programming and logic programming.

[edit] Expressing algorithms

Algorithms can be expressed in many kinds of notation, including natural languages, pseudocode, flowcharts, programming languages or control tables (processed by interpreters). Natural language expressions of algorithms tend to be verbose and ambiguous, and are rarely used for complex or technical algorithms. Pseudocode, flowcharts and control tables are structured ways to express algorithms that avoid many of the ambiguities common in natural language statements. Programming languages are primarily intended for expressing algorithms in a form that can be executed by a computer, but are often used as a way to define or document algorithms.

There is a wide variety of representations possible and one can express a given Turing machine program as a sequence of machine tables (see more at finite state machine, state transition table and control table), as flowcharts (see more at state diagram), or as a form of rudimentary machine code or assembly code called "sets of quadruples" (see more at Turing machine).

Representations of algorithms can be classed into three accepted levels of Turing machine description:[21]
1 High-level description:
"...prose to describe an algorithm, ignoring the implementation details. At this level we do not need to mention how the machine manages its tape or head." 2 Implementation description:
"...prose used to define the way the Turing machine uses its head and the way that it stores data on its tape. At this level we do not give details of states or transition function." 3 Formal description:
Most detailed, "lowest level", gives the Turing machine's "state table". For an example of the simple algorithm "Add m+n" described in all three levels see Algorithm examples.
[edit] Implementation

Most algorithms are intended to be implemented as computer programs. However, algorithms are also implemented by other means, such as in a biological neural network (for example, the human brain implementing arithmetic or an insect looking for food), in an electrical circuit, or in a mechanical device.

[edit] Computer algorithms

Flowchart examples of the canonical Böhm-Jacopini structures: the SEQUENCE (rectangles descending the page), the WHILE-DO and the IF-THEN-ELSE. The three structures are made of the primitive conditional GOTO (IF test=true THEN GOTO step xxx) (a diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks result in complex diagrams (cf Tausworthe 1977:100,114).
In computer systems, an algorithm is basically an instance of logic written in software by software developers to be effective for the intended "target" computer(s), in order for the target machines to produce output from given input (perhaps null).

"Elegant" (compact) programs, "good" (fast) programs : The notion of "simplicity and elegance" appears informally in Knuth and precisely in Chaitin:
Knuth: ". . .we want good algorithms in some loosely defined aesthetic sense. One criterion . . . is the length of time taken to perform the algorithm . . .. Other criteria are adaptability of the algorithm to computers, its simplicity and elegance, etc"[22] Chaitin: " . . . a program is 'elegant,' by which I mean that it's the smallest possible program for producing the output that it does"[23]
Chaitin prefaces his definition with: "I'll show you can't prove that a program is 'elegant'"—such a proof would solve the Halting problem (ibid).

Algorithm versus function computable by an algorithm: For a given function multiple algorithms may exist. This will be true, even without expanding the available instruction set available to the programmer. Rogers observes that "It is . . . important to distinguish between the notion of algorithm, i.e. procedure and the notion of function computable by algorithm, i.e. mapping yielded by procedure. The same function may have several different algorithms".[24]

Unfortunately there may be a tradeoff between goodness (speed) and elegance (compactness)—an elegant program may take more steps to complete a computation than one less elegant. An example of using Euclid's algorithm will be shown below.

Computers (and computors), models of computation: A computer (or human "computor"[25]) is a restricted type of machine, a "discrete deterministic mechanical device"[26] that blindly follows its instructions.[27] Melzak's and Lambek's primitive models[28] reduced this notion to four elements: (i) discrete, distinguishable locations, (ii) discrete, indistinguishable counters[29] (iii) an agent, and (iv) a list of instructions that are effective relative to the capability of the agent.[30]

Minsky describes a more congenial variation of Lambek's "abacus" model in his "Very Simple Bases for Computability".[31] Minsky's machine proceeds sequentially through its five (or six depending on how one counts) instructions unless either a conditional IF–THEN GOTO or an unconditional GOTO changes program flow out of sequence. Besides HALT, Minsky's machine includes three assignment (replacement, substitution)[32] operations: ZERO (e.g. the contents of location replaced by 0: L ← 0), SUCCESSOR (e.g. L ← L+1), and DECREMENT (e.g. L ← L − 1).[33] Rarely will a programmer have to write "code" with such a limited instruction set. But Minsky shows (as do Melzak and Lambek) that his machine is Turing complete with only four general types of instructions: conditional GOTO, unconditional GOTO, assignment/replacement/substitution, and HALT.[34]

Simulation of an algorithm: computer (computor) language: Knuth advises the reader that "the best way to learn an algorithm is to try it . . . immediately take pen and paper and work through an example".[35] But what about a simulation or execution of the real thing? The programmer must translate the algorithm into a language that the simulator/computer/computor can effectively execute. Stone gives an example of this: when computing the roots of a quadratic equation the computor must know how to take a square root. If they don't then for the algorithm to be effective it must provide a set of rules for extracting a square root.[36]

This means that the programmer must know a "language" that is effective relative to the target computing agent (computer/computor).

But what model should be used for the simulation? Van Emde Boas observes "even if we base complexity theory on abstract instead of concrete machines, arbitrariness of the choice of a model remains. It is at this point that the notion of simulation enters".[37] When speed is being measured, the instruction set matters. For example, the subprogram in Euclid's algorithm to compute the remainder would execute much faster if the programmer had a "modulus" (division) instruction available rather than just subtraction (or worse: just Minsky's "decrement").

Structured programming, canonical structures: Per the Church-Turing thesis any algorithm can be computed by a model known to be Turing complete, and per Minsky's demonstrations Turing completeness requires only four instruction types—conditional GOTO, unconditional GOTO, assignment, HALT. Kemeny and Kurtz observe that while "undisciplined" use of unconditional GOTOs and conditional IF-THEN GOTOs can result in "spaghetti code" a programmer can write structured programs using these instructions; on the other hand "it is also possible, and not too hard, to write badly structured programs in a structured language".[38] Tausworthe augments the three Böhm-Jacopini canonical structures:[39] SEQUENCE, IF-THEN-ELSE, and WHILE-DO, with two more: DO-WHILE and CASE.[40] An additional benefit of a structured program will be one that lends itself to proofs of correctness using mathematical induction.[41]

Canonical flowchart symbols[42]: The graphical aide called a flowchart offers a way to describe and document an algorithm (and a computer program of one). Like program flow of a Minsky machine, a flowchart always starts at the top of a page and proceeds down. Its primary symbols are only 4: the directed arrow showing program flow, the rectangle (SEQUENCE, GOTO), the diamond (IF-THEN-ELSE), and the dot (OR-tie). The Böhm-Jacopini canonical structures are made of these primitive shapes. Sub-structures can "nest" in rectangles but only if a single exit occurs from the superstructure. The symbols and their use to build the canonical structures are shown in the diagram.

 

 

EVOLVE LOVE EVOLVE

LOVES SOLVE LOVES

EVOLVE LOVE EVOLVE

 

 

Algorithm - Wikipedia, the free encyclopedia en.wikipedia.org/wiki/Algorithm

In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and ...

 

A
=
1
-
9
ALGORITHM
103
49
4
A
=
1
-
10
ALGORITHMS
122
59
5
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
A
=
1
-
-
ALGORITHMS
-
-
-
-
-
-
-
1
A
1
1
1
-
-
-
-
1
L
12
3
3
-
-
-
-
1
G
7
7
7
-
-
-
-
1
O
15
6
6
-
-
-
-
1
R
18
9
9
-
-
-
-
1
I
9
9
9
-
-
-
-
1
T
20
2
2
-
-
-
-
1
H
8
8
8
-
-
-
-
1
M+S
32
14
5
A
=
1
-
10
ALGORITHMS
122
59
50
-
-
-
-
1+0
-
1+2+2
5+9
5+0
A
=
1
-
1
ALGORITHMS
5
14
5
-
-
-
-
-
-
-
1+4
-
A
=
1
-
1
ALGORITHMS
5
5
5

 

 

-
10
A
L
G
O
R
I
T
H
M
S
-
-
-
-
-
-
-
-
-
-
-
-
-
6
-
9
-
8
-
1
+
=
24
2+4
=
6
=
6
-
-
-
-
-
15
-
9
-
8
-
19
+
=
51
5+1
=
6
=
6
-
10
A
L
G
O
R
I
T
H
M
S
-
-
-
-
-
-
-
-
-
-
1
3
7
-
9
-
2
-
4
-
+
=
26
2+6
=
8
=
8
-
-
1
12
7
-
18
-
20
-
13
-
+
=
71
7+1
=
8
=
8
-
10
A
L
G
O
R
I
T
H
M
S
-
-
-
-
-
-
-
-
-
-
1
12
7
15
18
9
20
8
13
19
+
=
122
1+2+2
=
5
1+0
5
-
-
1
3
7
6
9
9
2
8
4
1
+
=
50
5+0
=
5
1+0
5
-
10
A
L
G
O
R
I
T
H
M
S
-
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
-
-
-
1
-
-
1
occurs
x
2
=
2
-
-
-
-
-
-
-
-
2
-
-
-
-
-
2
occurs
x
1
=
2
-
-
-
3
-
-
-
-
-
-
-
-
-
-
3
occurs
x
1
=
3
-
-
-
-
-
-
-
-
-
-
4
-
-
-
4
occurs
x
1
=
4
5
-
-
-
-
-
-
-
-
-
-
-
-
-
5
FIVE
5
-
-
-
-
-
-
-
-
6
-
-
-
-
-
-
-
-
6
occurs
x
1
=
6
-
-
-
-
7
-
-
-
-
-
-
-
-
-
7
occurs
x
1
=
7
-
-
-
-
-
-
-
-
-
8
-
-
-
-
8
occurs
x
1
=
8
-
-
-
-
-
-
9
9
-
-
-
-
-
-
9
occurs
x
1
=
9
5
10
A
L
G
O
R
I
T
H
M
S
-
-
27
-
-
10
-
41
-
1+0
-
-
-
-
9
9
-
-
-
-
-
-
2+7
-
-
1+0
-
4+1
5
1
A
L
G
O
R
I
T
H
M
S
-
-
9
-
-
1
-
5
-
-
1
3
7
6
9
9
2
8
4
1
-
-
-
-
-
-
-
-
5
1
A
L
G
O
R
I
T
H
M
S
-
-
9
-
-
1
-
5

 

 

A
=
1
-
10
ALGORITHMS
122
59
5
A
=
1
-
9
ALGORITHM
103
49
4
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
ALGORITHM
-
-
-
A
=
1
-
1
A
1
1
1
L
=
3
-
1
L
12
3
3
G
=
7
-
1
G
7
7
7
O
=
6
-
1
O
15
6
6
R
=
9
-
1
R
18
9
9
I
=
9
-
1
I
9
9
9
T
=
2
-
1
T
20
2
2
H
=
8
-
1
H
8
8
8
M
=
4
-
1
M
13
4
4
-
-
49
-
9
ALGORITHM
103
49
49
-
-
4+9
-
-
-
1+0+3
4+9
4+9
-
-
13
-
9
ALGORITHM
103
13
13
-
-
1+3
-
-
-
-
1+3
1+3
-
-
4
-
9
ALGORITHM
103
4
4

 

 

A
=
1
-
10
ALGORITHMS
122
59
5
A
=
1
-
9
ALGORITHM
103
49
4
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
ALGORITHM
-
-
-
A
=
1
-
1
A
1
1
1
T
=
2
-
1
T
20
2
2
L
=
3
-
1
L
12
3
3
M
=
4
-
1
M
13
4
4
5
-
5
-
-
5
-
-
5
O
=
6
-
1
O
15
6
6
G
=
7
-
1
G
7
7
7
H
=
8
-
1
H
8
8
8
R
=
9
-
1
R
18
9
9
I
=
9
-
1
I
9
9
9
-
-
49
-
9
ALGORITHM
103
49
49
-
-
4+9
-
-
-
1+0+3
4+9
4+9
-
-
13
-
9
ALGORITHM
103
13
13
-
-
1+3
-
-
-
-
1+3
1+3
-
-
4
-
9
ALGORITHM
103
4
4

 

 

A
=
1
-
10
ALGORITHMS
122
59
5
A
=
1
-
9
ALGORITHM
103
49
4
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
ALGORITHM
-
-
-
A
=
1
-
1
A
1
1
1
L
=
3
-
1
L
12
3
3
G
=
7
-
1
G
7
7
7
O
=
6
-
1
O
15
6
6
R
=
9
-
1
R
18
9
9
I
=
9
-
1
I
9
9
9
T
=
2
-
1
T
20
2
2
H
=
8
-
1
H
8
8
8
M
=
4
-
1
M
13
4
4
-
-
49
-
9
ALGORITHM
103
49
49
-
-
4+9
-
-
-
1+0+3
4+9
4+9
-
-
13
-
9
ALGORITHM
103
13
13
-
-
1+3
-
-
-
-
1+3
1+3
-
-
4
-
9
ALGORITHM
103
4
4

 

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
ALGORITHMS
-
-
-
-
-
-
-
-
-
-
-
-
-
A
=
1
1
1
A
1
1
1
-
1
-
-
-
-
-
-
-
-
L
=
3
2
1
L
12
3
3
-
-
-
3
-
-
-
-
-
-
G
=
7
3
1
G
7
7
7
-
-
-
-
-
-
-
7
-
-
O
=
6
4
1
O
15
6
6
-
-
-
-
-
-
6
-
-
-
R
=
9
5
1
R
18
9
9
-
-
-
-
-
-
-
-
-
9
I
=
9
6
1
I
9
9
9
-
-
-
-
-
-
-
-
-
9
T
=
2
7
1
T
20
2
2
-
-
2
-
-
-
-
-
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
-
-
-
8
-
M
=
4
9
1
M
13
4
4
-
-
-
-
4
-
-
-
-
-
S
=
1
10
1
S
1
1
1
-
1
-
-
-
-
-
-
-
-
-
-
50
-
10
ALGORITHMS
122
50
50
-
2
2
3
4
5
6
7
8
18
-
-
5+0
-
1+0
-
1+2+2
5+5
5+0
-
-
-
-
-
-
-
-
-
1+8
-
-
5
-
1
ALGORITHMS
5
5
5
-
2
2
3
4
5
6
7
8
9

 

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
6
7
8
9
-
-
-
-
-
ALGORITHMS
-
-
-
-
-
-
-
-
-
-
-
-
A
=
1
1
1
A
1
1
1
-
1
-
-
-
-
-
-
-
L
=
3
2
1
L
12
3
3
-
-
-
3
-
-
-
-
-
G
=
7
3
1
G
7
7
7
-
-
-
-
-
-
7
-
-
O
=
6
4
1
O
15
6
6
-
-
-
-
-
6
-
-
-
R
=
9
5
1
R
18
9
9
-
-
-
-
-
-
-
-
9
I
=
9
6
1
I
9
9
9
-
-
-
-
-
-
-
-
9
T
=
2
7
1
T
20
2
2
-
-
2
-
-
-
-
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
-
-
8
-
M
=
4
9
1
M
13
4
4
-
-
-
-
4
-
-
-
-
S
=
1
10
1
S
1
1
1
-
1
-
-
-
-
-
-
-
-
-
50
-
10
ALGORITHMS
122
50
50
-
2
2
3
4
6
7
8
18
-
-
5+0
-
1+0
-
1+2+2
5+5
5+0
-
-
-
-
-
-
-
-
1+8
-
-
5
-
1
ALGORITHMS
5
5
5
-
2
2
3
4
6
7
8
9

 

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
6
7
8
9
-
-
-
-
-
ALGORITHMS
-
-
-
-
-
-
-
-
-
-
-
-
-
A
=
1
1
1
A
1
1
1
-
1
-
-
-
5
-
-
-
-
S
=
1
10
1
S
1
1
1
-
1
-
-
-
5
-
-
-
-
T
=
2
7
1
T
20
2
2
-
-
2
-
-
5
-
-
-
-
L
=
3
2
1
L
12
3
3
-
-
-
3
-
5
-
-
-
-
M
=
4
9
1
M
13
4
4
-
-
-
-
4
5
-
-
-
-
O
=
6
4
1
O
15
6
6
-
-
-
-
-
5
6
-
-
-
G
=
7
3
1
G
7
7
7
-
-
-
-
-
5
-
7
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
5
-
-
8
-
R
=
9
5
1
R
18
9
9
-
-
-
-
-
5
-
-
-
9
I
=
9
6
1
I
9
9
9
-
-
-
-
-
5
-
-
-
9
-
-
50
-
10
ALGORITHMS
122
50
50
-
2
2
3
4
5
6
7
8
18
-
-
5+0
-
1+0
-
1+2+2
5+5
5+0
-
-
-
-
-
-
-
-
-
1+8
-
-
5
-
1
ALGORITHMS
5
5
5
-
2
2
3
4
5
6
7
8
9

 

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
6
7
8
9
-
-
-
-
-
ALGORITHMS
-
-
-
-
-
-
-
-
-
-
-
-
A
=
1
1
1
A
1
1
1
-
1
-
-
-
-
-
-
-
S
=
1
10
1
S
1
1
1
-
1
-
-
-
-
-
-
-
T
=
2
7
1
T
20
2
2
-
-
2
-
-
-
-
-
-
L
=
3
2
1
L
12
3
3
-
-
-
3
-
-
-
-
-
M
=
4
9
1
M
13
4
4
-
-
-
-
4
-
-
-
-
O
=
6
4
1
O
15
6
6
-
-
-
-
-
6
-
-
-
G
=
7
3
1
G
7
7
7
-
-
-
-
-
-
7
-
-
H
=
8
8
1
H
8
8
8
-
-
-
-
-
-
-
8
-
R
=
9
5
1
R
18
9
9
-
-
-
-
-
-
-
-
9
I
=
9
6
1
I
9
9
9
-
-
-
-
-
-
-
-
9
-
-
50
-
10
ALGORITHMS
122
50
50
-
2
2
3
4
6
7
8
18
-
-
5+0
-
1+0
-
1+2+2
5+5
5+0
-
-
-
-
-
-
-
-
1+8
-
-
5
-
1
ALGORITHMS
5
5
5
-
2
2
3
4
6
7
8
9

 

 

NUMBER

9

THE SEARCH FOR THE SIGMA CODE

Cecil Balmond 1998

Preface to the New Edition

Page 5
Twelve years ago a little boy entered my imagination as he hopped across the centuries and played with numbers. I began to see how the simple architecture of our decimal system could be constructed in secret ways — not a building project this time but an abstract one. On the surface of our arithmetic countless combinations of numbers take part in tedious and exacting calculations but underneath it all there is pattern, governed by a repeating code of integers. The Sigma Code reduces numbers to a single digit and the illusion of the many is seen to be but the reflection of a few. This is not a book on maths: this is a book for anyone who can carry out simple sums in their heads, and who won't be short-changed knowingly.
When Number 9 first came out I received mail from many who played with numbers. They chased patterns; some had special numbers and even mystical systems. I was tempted to write about numerology but resisted. I wanted to write about the intricacy of what the.. numbers actually do and leave the reader to wonder about the larger irrational that seems to hover around such constructions.
If I were writing this book today the numbers would have featured in a wider context of structuring nature's patterns, and also playing the role of animator in algorithms that create unique architectural forms and shapes. I would also include my previous research into other base systems. But this book was a first step which came from a child-like urge, like playing with building blocks, to build out of our numbers — just the simple 1, 2, 3, up to number 9.

 

RESEARCH R E SEARCH ER RESEARCH

 

 

THE LIGHT IS RISING NOW RISING IS THE LIGHT

 

 

NUMBER = 534259 = 1 = 534259 NUMBER

NUMBER = 234559 NUMBER

NUMBER = 534259 = 1 = 534259 NUMBER

 

 

NUMBERS = 5342591 = 2 = 5342591 NUMBERS

SBUMNER = 1234559 = SBUMNER

NUMBERS = 5342591 = 2 = 5342591 NUMBERS

 

-
-
-
-
Q
NUMBERS
-
Q
Q
-
1
2
3
4
5
6
7
8
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
6
7
8
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
6
7
8
-
M
=
4
-
1
M
13
4
4
-
-
-
-
4
-
6
7
8
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
6
7
8
-
E
=
5
-
1
E
5
5
5
-
-
-
-
-
5
6
7
8
-
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
6
7
8
9
S
=
1
-
1
S
19
1
1
-
1
-
-
-
-
6
7
8
-
-
-
29
4
7
NUMBERS
92
29
29
-
1
2
3
4
10
6
7
8
9
-
-
2+9
Q
-
Q
9+2
2+9
2+9
-
-
-
-
-
1+0
-
-
-
-
Q
-
11
-
7
NUMBERS
11
11
11
-
1
2
3
4
1
6
7
8
9
-
-
1+1
Q
-
Q
1+1
1+1
1+1
-
-
-
-
-
-
-
-
-
-
Q
-
2
-
7
NUMBERS
2
2
2
-
1
2
3
4
1
6
7
8
9

 

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
9
-
-
-
-
Q
NUMBERS
-
Q
Q
-
-
-
-
-
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
-
M
=
4
-
1
M
13
4
4
-
-
-
-
4
-
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
-
E
=
5
-
1
E
5
5
5
-
-
-
-
-
5
-
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
9
S
=
1
-
1
S
19
1
1
-
1
-
-
-
-
-
-
-
29
4
7
NUMBERS
92
29
29
-
1
2
3
4
10
9
-
-
2+9
Q
-
Q
9+2
2+9
2+9
-
-
-
-
-
1+0
-
Q
-
11
-
7
NUMBERS
11
11
11
-
1
2
3
4
1
9
-
-
1+1
Q
-
Q
1+1
1+1
1+1
-
-
-
-
-
-
-
Q
-
2
-
7
NUMBERS
2
2
2
-
1
2
3
4
1
9

 

 

-
-
-
-
-
-
-
-
-
-
1
2
3
4
5
3
-
-
-
-
Q
NUMBERS
-
Q
Q
-
-
-
-
-
-
-
S
=
1
-
1
S
19
1
1
-
1
-
-
-
-
-
B
=
2
-
1
B
2
2
2
-
-
2
-
-
-
-
U
=
3
-
1
U
21
3
3
-
-
-
3
-
-
-
M
=
4
-
1
M
13
4
4
-
-
-
-
4
-
-
N
=
5
-
1
N
14
5
5
-
-
-
-
-
5
-
E
=
5
-
1
E
5
5
5
-
-
-
-
-
5
-
R
=
9
-
1
R
18
9
9
-
-
-
-
-
-
9
-
-
29
4
7
NUMBERS
92
29
29
-
1
2
3
4
10
9
-
-
2+9
Q
-
Q
9+2
2+9
2+9
-
-
-
-
-
1+0
-
Q
-
11
-
7
NUMBERS
11
11
11
-
1
2
3
4
1
9
-
-
1+1
Q
-
Q
1+1
1+1
1+1
-
-
-
-
-
-
-
Q
-
2
-
7
NUMBERS
2
2
2
-
1
2
3
4
1
9

 

 

I = 9 9 = I
ME = 9 9 = ME
BRAIN + BODY = 9 9 = BODY + BRAIN
LIGHT + DARK = 9 9 = DARK + LIGHT
ENERGY + MASS = 9 9 = MASS +ENERGY
MIND + MATTER = 9 9 = MATTER + MIND
MAGNETIC + FIELD = 9 9 = FIELD + MAGNETIC
POSITIVE + NEGATIVE = 9 9 = NEGATIVE + POSITIVE
973 OM AZAZAZAZAZAZAZAZAZZAZAZAZAZAZAZAZAZAOM 973

 

 

-
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
-
1
3
7
5
2
9
1
+
=
28
2+8
=
10
1+0
1
-
-
1
12
7
5
2
18
1
+
=
46
4+6
=
10
1+0
1
-
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
-
1
3
7
5
2
9
1
+
=
28
2+8
=
10
1+0
1
-
-
1
12
7
5
2
18
1
+
=
46
4+6
=
10
1+0
1
-
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
-
1
12
7
5
2
18
1
+
=
46
4+6
=
10
1+0
1
-
-
1
3
7
5
2
9
1
+
=
28
2+8
=
10
1+0
1
-
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
1
-
-
1
occurs
x
2
=
2
-
-
-
-
-
-
2
-
-
-
-
2
occurs
x
1
=
2
-
-
-
3
-
-
-
-
-
-
-
3
occurs
x
1
=
3
4
-
-
-
-
-
-
-
-
-
-
4
FOUR
4
-
-
-
-
-
-
-
-
5
-
-
-
-
-
5
occurs
x
1
=
5
6
-
-
-
-
-
-
-
-
-
-
6
SIX
6
-
-
-
-
-
-
-
7
-
-
-
-
-
-
7
occurs
x
1
=
7
8
-
-
-
-
-
-
-
-
-
-
8
EIGHT
8
-
-
-
-
-
-
-
-
-
-
9
-
-
-
9
occurs
x
1
=
9
18
7
A
L
G
E
B
R
A
-
-
27
-
-
7
-
28
1+8
-
-
-
-
-
-
9
-
-
-
2+7
-
-
-
-
2+8
9
7
A
L
G
E
B
R
A
-
-
9
-
-
7
-
10
-
-
1
3
7
5
2
9
1
-
-
-
-
-
-
-
1+0
9
7
A
L
G
E
B
R
A
-
-
9
-
-
7
-
1

 

 

7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
1
3
7
5
2
9
1
+
=
28
2+8
=
10
1+0
1
-
1
12
7
5
2
18
1
+
=
46
4+6
=
10
1+0
1
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
1
3
7
5
2
9
1
+
=
28
2+8
=
10
1+0
1
-
1
12
7
5
2
18
1
+
=
46
4+6
=
10
1+0
1
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
1
12
7
5
2
18
1
+
=
46
4+6
=
10
1+0
1
-
1
3
7
5
2
9
1
+
=
28
2+8
=
10
1+0
1
7
A
L
G
E
B
R
A
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
1
-
-
1
occurs
x
2
=
2
-
-
-
-
-
2
-
-
-
-
2
occurs
x
1
=
2
-
-
3
-
-
-
-
-
-
-
3
occurs
x
1
=
3
-
-
-
-
5
-
-
-
-
-
5
occurs
x
1
=
5
-
-
-
7
-
-
-
-
-
-
7
occurs
x
1
=
7
-
-
-
-
-
-
9
-
-
-
9
occurs
x
1
=
9
7
A
L
G
E
B
R
A
-
-
27
-
-
7
-
28
-
-
-
-
-
-
9
-
-
-
2+7
-
-
-
-
2+8
7
A
L
G
E
B
R
A
-
-
9
-
-
7
-
10
-
1
3
7
5
2
9
1
-
-
-
-
-
-
-
1+0
7
A
L
G
E
B
R
A
-
-
9
-
-
7
-
1

 

 

ANTIDISESTABLISHMENTARIANISM

 

A
=
1
-
3
ANT
35
8
8
-
=
-
-
1
I
9
9
9
-
=
-
-
1
D
4
4
4
-
=
-
-
1
I
9
9
9
-
=
-
-
4
SEST
63
9
9
-
=
-
-
3
ABL
15
6
6
-
=
-
-
1
I
9
9
9
-
=
-
-
2
SH
27
9
9
-
=
-
-
2
ME
18
9
9
-
=
-
-
3
NTA
35
8
8
-
=
-
-
1
R
18
9
9
-
=
-
-
1
I
9
9
9
-
=
-
-
2
AN
15
6
6
-
=
-
-
1
I
9
9
9
-
=
-
-
2
SM
32
5
5
-
-
1
4
28
First Total
307
118
118
-
-
-
-
2+8
Add to Reduce
3+0+7
1+1+8
1+1+8
-
-
1
=
10
Second Total
10
10
10
-
-
-
-
1+0
Reduce to Deduce
1+0
1+0
1+0
-
-
1
-
1
Essence of Number
1
1
1

 

ANTIDISESTABLISHMENTARIANISM

 

28
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
-
-
-
-
-
-
-
-
-
-
5
-
9
-
9
1
-
1
-
-
-
-
9
1
8
-
-
5
-
-
-
9
-
5
9
1
-
+
=
43
4+3
=
7
=
7
=
7
-
-
14
-
9
-
9
19
-
19
-
-
-
-
9
19
8
-
-
14
-
-
-
9
-
14
9
19
-
+
=
115
1+1+5
=
7
=
7
=
7
28
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
-
-
-
-
-
-
-
-
-
1
-
2
-
4
-
-
5
-
2
1
2
3
-
-
-
4
5
-
2
1
9
-
1
-
-
-
4
+
=
83
8+3
=
11
1+1
2
=
2
-
1
-
20
-
4
-
-
5
-
20
1
2
12
-
-
-
13
5
-
20
1
18
-
1
-
-
-
13
+
=
236
2+3+6
=
11
1+1
2
=
2
28
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
-
-
-
-
-
-
-
-
-
1
14
20
9
4
9
19
5
19
20
1
2
12
9
19
8
13
5
14
20
1
18
9
1
14
9
19
13
+
=
307
3+0+7
=
10
1+0
1
=
1
-
1
5
2
9
4
9
1
5
1
2
1
2
3
9
1
8
4
5
5
2
1
9
9
1
5
9
1
4
+
=
118
1+1+8
=
10
1+0
1
=
1
28
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
-
-
-
-
-
-
-
-
-
1
-
-
-
-
-
1
-
1
-
1
-
-
-
1
-
-
-
-
-
1
-
-
1
-
-
1
-
+
=
1
occurs
x
8
=
8
=
8
-
-
-
2
-
-
-
-
-
-
2
-
2
-
-
-
-
-
-
-
2
-
-
-
-
-
-
-
-
+
=
2
occurs
x
4
=
8
=
8
-
-
-
-
-
-
-
-
-
-
-
-
-
3
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
=
3
occurs
x
1
=
3
=
3
-
-
-
-
-
4
-
-
-
-
-
-
-
-
-
-
-
4
-
-
-
-
-
-
-
-
-
-
4
+
=
4
occurs
x
3
=
12
1+2
3
-
-
5
-
-
-
-
-
5
-
-
-
-
-
-
-
-
-
5
5
-
-
-
-
-
5
-
-
-
+
=
5
occurs
x
5
=
25
2+5
7
6
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
=
6
-
-
-
-
-
-
-
7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
=
7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
8
-
-
-
-
-
-
-
-
-
-
-
-
+
=
8
occurs
x
1
=
8
=
8
-
-
-
-
9
-
9
-
-
-
-
-
-
-
9
-
-
-
-
-
-
-
9
9
-
-
9
-
-
+
=
9
occurs
x
6
=
54
5+4
9
13
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
45
-
-
26
-
118
-
46
-
1
-
-
-
-
-
1
-
1
-
1
-
-
-
1
-
-
-
-
-
1
-
-
1
-
-
1
-
-
-
4+5
-
-
2+6
-
1+1+8
-
4+6
13
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
9
-
-
8
-
10
-
10
-
1
5
2
9
4
9
1
5
1
2
1
2
3
9
1
8
4
5
5
2
1
9
9
1
5
9
1
4
-
-
-
-
-
-
-
1+0
-
1+0
13
A
N
T
I
D
I
S
E
S
T
A
B
L
I
S
H
M
E
N
T
A
R
I
A
N
I
S
M
-
-
9
-
-
8
-
1
-
1

 

 
 
Top
  
 
Evokation
  
Previous Page
Index
 Next Page