Math

posted by .

N is an integer such that N≡179(mod233) and N≡233(mod179).

Determine a three digit positive integer M such that N≡M(mod179×233).

Details and assumptions
You may use the fact that 179 and 233 are primes.

  • Math -

    412

  • Math -

    how did you do it?

  • Math -

    N = 179(mod 233)
    N = 233(mod 179)

    N = 179 + 233t

    179 + 233t = 233(mod 179)
    233t = 233 (mod 179)
    t = 1

    N = M = 179 + 233(1) = 412 (mod 179*233).

  • Math -

    108 is 36% of what number? Write and solve a proportion to solve the problem.

    108 is 36% of what number? Write and solve a proportion to solve the problem.

    108 is 36% of what number? Write and solve a proportion to solve the problem.

    108 is 36% of what number? Write and solve a proportion to solve the problem.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. CHEMISTRY

    8) The reaction CH3- N≡C → CH3- C≡N is a first-order reaction. At 230.3°C, k = 6.29 x 10^-4 s^- 1. If [CH3 -N≡ is 1.00 x 10^-3 initially, C] [CH3-N ≡ C] is __________ after 1.000 x 10^3 s. A) 5.33 x 10^-4 …
  2. chemistry

    The reaction CH3- N≡C → CH3- C≡N is a first-order reaction. At 230.3°C, k = 6.29 x 10^-4 s^- 1. If [CH3 -N≡ is 1.00 x 10^-3 initially, C] [CH3-N ≡ C] is __________ after 1.000 x 10^3 s. A) 5.33 x 10^-4 …
  3. Discrete Mathematics

    Prove that if n is an odd positive integer, then 1 ≡ n(power of 2) (mod 4).
  4. maths

    There are N ordered integer quadruples (a,b,c,d) subject to 0≤a,b,c,d≤99990 such that ad−bc≡1(mod99991). What are the last three digits of N?
  5. Math algebra

    Let N be the sum of all positive integers q of the form q=p^k with prime p, such that for at least four different integer values of x from 1 to q, x^3−3x≡123(modq). What are the last 3 digits of N?
  6. maths

    Find the smallest n such that for any prime p, at least 20 numbers 1,2, ..., n are quadratic residues not modulo p. k is quadratic residue modulo p if there exists an integer j such that j^2 ≡ k (mod p).
  7. Data Structures and Algorithms

    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 …
  8. DISCRETE MATHS

    Prove that if n is an odd positive integer, then 1 ≡ n2 (mod 4).
  9. Philosophy

    I need help with this proof for my philosophy class. This proof is supposed to be done via conditional proof, so it is supposed to use ACP and CP to derive the conclusion! This is an assignment that is submitted through Aplia, so I …
  10. prepositional calculus

    Convert the following formula to conjunctive normal form (clause form). a) a ≡ (b ≡ c) is the answer (a כ(( b כ c) ^ (c כ b))) ^ ((( b כ c) ^ (c כ b)) כ a) unsure thanks

More Similar Questions