Purchase Solution

Working with congruent and incongruent solutions.

Not what you're looking for?

Ask Custom Question

For which integers c, 0<=c<=1001, does the congruence 154x=c(mod1001) have a solution?
When there are solutions how many incongruent solutions are there?

Purchase this Solution
Solution Summary

Cogruent and incongruent solutions are discussed for a given expression.

Solution Preview

Since 154=77*2 and 1001=77*13
154x=c (mod 1001) <=> ...

Solution provided by:
Changping Wang, MA
Education
  • BSc , Wuhan Univ. China
  • MA, Shandong Univ.
Recent Feedback
  • "Your solution, looks excellent. I recognize things from previous chapters. I have seen the standard deviation formula you used to get 5.154. I do understand the Central Limit Theorem needs the sample size (n) to be greater than 30, we have 100. I do understand the sample mean(s) of the population will follow a normal distribution, and that CLT states the sample mean of population is the population (mean), we have 143.74. But when and WHY do we use the standard deviation formula where you got 5.154. WHEN & Why use standard deviation of the sample mean. I don't understand, why don't we simply use the "100" I understand that standard deviation is the square root of variance. I do understand that the variance is the square of the differences of each sample data value minus the mean. But somehow, why not use 100, why use standard deviation of sample mean? Please help explain."
  • "excellent work"
  • "Thank you so much for all of your help!!! I will be posting another assignment. Please let me know (once posted), if the credits I'm offering is enough or you ! Thanks again!"
  • "Thank you"
  • "Thank you very much for your valuable time and assistance!"
Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Probability Quiz

Some questions on probability

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

View More Free Quizzes
Related BrainMass Solutions

  • Mutually incongruent solutions of7x is congruent to5 (mod11)

    23510 Linear Congruences Set of Mutually Incongruent Solutions Find a complete set of mutually incongruent

  • Linear Congruences

    16597 Linear Congruences ( Part I)Incongruent Solutions Find the solutions of (a) 4x is congruent to 3(mod 7) (b) 9x is congruent to 11(mod 26)

  • Quadratic congruences

    ., x2 +x + 1 with aoxn + a1xn-1 + a2xn-2 + --------------+ an, we get ao = 1, p = 7 and 7 † 1 Hence the congruence x2 + x + 1 ≡ 0 (mod 7) has at most two mutually incongruent solutions

  • Congruence with Incongruent Solutions

    534882 Congruence with Incongruent Solutions Let n be an integer greater than 2. For which values of n (if any) does the congruence 12x ≡ 8 (mod n) have exactly two incongruent solutions (mod n)? Justify your answer.

  • Question on Segment Reporting

    (Journal of Accounting Research) The results of segmented reporting provides analysts internally with perceived results of information that is more reliable "when external and internal segments were congruent then when they were incongruent, and when

  • Psychological Distress

    This is what Rogers refers to as the incongruent person (versus the congruent person).

  • Solutions of the systems of congruences

    This solution is comprised of a detailed explanation for finding all solutions of each of the systems of congruences.

  • Linear Congruences

    16598 Linear Congruences: Example Problems Find the solutions of (1) 153x is congruent to 6 (mod 12) (2) x + 1 is congruent to 3 (mod 7)

  • Congruence Functions Solved

    The congruence ax b (mod n) has a solution if and only if b is divisible by d, where d = (a, n). If d | b, then there are d distinct solutions modulo n, and these solutions are congruent modulo n / d.

View More Related Solutions