<s>
In	O
a	O
pseudorandom	B-Algorithm
number	I-Algorithm
generator	I-Algorithm
(	O
PRNG	O
)	O
,	O
a	O
full	B-Algorithm
cycle	I-Algorithm
or	O
full	O
period	O
is	O
the	O
behavior	O
of	O
a	O
PRNG	O
over	O
its	O
set	O
of	O
valid	O
states	O
.	O
</s>
<s>
In	O
particular	O
,	O
a	O
PRNG	O
is	O
said	O
to	O
have	O
a	O
full	B-Algorithm
cycle	I-Algorithm
if	O
,	O
for	O
any	O
valid	O
seed	B-Algorithm
state	I-Algorithm
,	O
the	O
PRNG	O
traverses	O
every	O
valid	O
state	O
before	O
returning	O
to	O
the	O
seed	B-Algorithm
state	I-Algorithm
,	O
i.e.	O
,	O
the	O
period	O
is	O
equal	O
to	O
the	O
cardinality	O
of	O
the	O
state	O
space	O
.	O
</s>
<s>
The	O
restrictions	O
on	O
the	O
parameters	O
of	O
a	O
PRNG	O
for	O
it	O
to	O
possess	O
a	O
full	B-Algorithm
cycle	I-Algorithm
are	O
known	O
only	O
for	O
certain	O
types	O
of	O
PRNGs	O
,	O
such	O
as	O
linear	B-Algorithm
congruential	I-Algorithm
generators	I-Algorithm
and	O
linear-feedback	B-Architecture
shift	I-Architecture
registers	I-Architecture
.	O
</s>
<s>
Given	O
a	O
random	B-Algorithm
number	I-Algorithm
seed	I-Algorithm
that	O
is	O
greater	O
or	O
equal	O
to	O
zero	O
,	O
a	O
total	O
sample	O
size	O
greater	O
than	O
1	O
,	O
and	O
an	O
increment	O
coprime	O
to	O
the	O
total	O
sample	O
size	O
,	O
a	O
full	B-Algorithm
cycle	I-Algorithm
can	O
be	O
generated	O
with	O
the	O
following	O
logic	O
.	O
</s>
