Q1. Using Euclideanalgorithm find GCD(21, 1500). Show you
work
.Q2. Using Extended Euclidean algorithm find the...
Q1. Using Euclideanalgorithm find GCD(21, 1500). Show you
work
.Q2. Using Extended Euclidean algorithm find the multiplicative
inverse of 8 in mod 45 domain .Show your work including the
table.
Q3. Determine φ(2200). (Note that 1,2,3,5, 7, ... etc.are the
primes). Show your work.
Q4. Find the multiplicative inverse of 14 in GF(31) domain using
Fermat’s little theorem. Show your work
Q5. Using Euler’s theorem to find the following exponential:
4200mod 27. Show how you have employed Euler’s theorem here
Execute the BDMO Algorithm with p = 3 on the following
1-dimensional, Euclidean data:
1, 45,...
Execute the BDMO Algorithm with p = 3 on the following
1-dimensional, Euclidean data:
1, 45, 80, 24, 56, 71, 17, 40, 66, 32, 48, 96, 9, 41, 75, 11,
58, 93, 28, 39, 77
The clustering algorithms is k-means with k = 3. Only the
centroid of a cluster, along with its count, is needed to represent
a cluster.
Using your clusters from the above, produce the best centroids
in response to a query asking for a clustering of...