In RNS, a set of moduli which are all

relatively prime and independent of one another are given.

For these public utility facility sites such as depots, public transport interchanges and telephone exchange, the Task Force recommended the Government to explore whether those sites with larger footprint and in

relatively prime location had the development potential, including that for topside development.

(ii) we have a factorization of e(H) = uv, where u is the maximal divisor of e(H)

relatively prime to [k.sub.1] and is also the maximal divisor of e(H)

relatively prime to [k.sub.2];for any divisor d of u, [ord.sub.d][k.sub.1] = [ord.sub.d][k.sub.2].

To prove the statement iv) is equivalent to demonstrate that: If PX = K(x - 1) and PX = K(-xy + 1) have solutions over Z[[Q.sub.8]] where P = [[p.sub.ij]] is an m x n matrix with m [less than or equal to] n, and all m x m minors of [epsilon](P) = [[epsilon]([p.sub.ij])] are

relatively prime, then the system PX = K has a solution over Z[[Q.sub.8]].

The quantities ([lambda]ab) and H([lambda]) are

relatively prime. Consider the equations

Every even number greater than 2 can be expressed as the sum of two

relatively prime numbers.

Then every monic polynomial f(X) in R[X] of degree

relatively prime to p has OA.

Bruin applied elliptic Chabauty method and other methods to prove that the only solutions of [x.sup.8] + [y.sup.3] = [z.sup.2] are non-zero

relatively prime integers ([+ or - ]1, 2, [+ or -]3) and ([+ or -]43, 96222, [+ or -]30042907).

The reason this trick works is that 13 is a prime number and is therefore "

relatively prime" to any number that is not a multiple of 13.

The source of the problem was that there were two motions in the rolling piston animation (inner and outer circle-rotations), and the periods of these two motions were

relatively prime. To resolve this, we noted that we can change [theta] and [empty set] by changing the radius of the inner and outer circles.

In RSA the cipher text C is obtained for the plaintext message M [member of] [z.sup.*.sub.N] as C = [M.sup.e] mod N, where N is the product of two large prime numbers of same length, e is the public key chosen such that it is

relatively prime with the Euler totient function [phi](N) and 1 < e < [phi](N).

A special case of the Euler's function can be used to find the number of integers that are

relatively prime to [2.sup.n].