Friday
December 19, 2014

Homework Help: Data Structures and Algorithms

Posted by Steven on Wednesday, July 24, 2013 at 5:46am.

Given integers R,M with M≠0, let S(R,M) denote the smallest positive integer x satisfying the congruence
Rx≡1(mod M)
if such an x exists. If such an x does not exist, put S(R,M)=0.

Each line of this text file contains a pair of space separated integers representing R and M, respectively.

Let L be the list of integers whose k-th element is the value of S(R,M), where R and M are taken from the k-th line of the text file.

Let T be the sum of all elements of L. What are the last three digits of T?

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

maths - Find the smallest n such that for any prime p, at least 20 numbers 1,2...
Math (algebra) - Suppose a and b are positive integers satisfying 1≤a&#...
Maths - Suppose a and b are positive integers satisfying 1≤a≤31, 1&#...
Math - N is an integer such that N≡179(mod233) and N≡233(mod179). ...
MATHS - Find the largest possible integer n such that there exists a non-...
algebra - Find the largest possible integer n such that there exists a non-...
math - there are three consecutive positive integers such that the sum of the ...
Math algebra - Let N be the sum of all positive integers q of the form q=p^k ...
Math - Let a be an integer, then there are integers X, Y such that aX+(a+1)Y=1. ...
Math - Find the smallest positive integer d such that d=105m+216n, where m & n ...

Search
Members