P. 1
Cellular.automata

Cellular.automata

|Views: 21|Likes:
Published by Vikash Ojha

More info:

Published by: Vikash Ojha on Jul 12, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/12/2013

pdf

text

original

a¥

mod bt

denotes a¥

reduced modulo bt

, or the remainder of a¥

after division by bt

.

(a¥

§

bt

)or gcd(a¥

§

bt

)denotes the greatest common divisor of a¥

and bt

. When a¥

and

bt

are polynomials, the result is taken to be a polynomial with unit leading coefficient

(monic).

a¥

$
bt

represents the statement that a¥

divides bt

(with no remainder).

a¥

n3

P

bt

indicates that a¥

n3

is the highest power of a¥

which divides bt

.

Exponentiation is assumed right associative, so that a¥

bu

c

denotes a¥

(bu

c

)

not (a¥

bu
)cv

.

p2

usually denotes a prime integer.

Ù

k

denotes an arbitrary commutative ring of k

elements.

Ú

k

denotes the ring of integers modulo k

.

degP(x

)denotes the highest power of x

which appears in P(x

).

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->