Chinese remainder theorem (CRT) question, flat shapes

In summary, we can use the Chinese remainder theorem to combine congruences and find solutions mod a given number.
  • #1
fishturtle1
394
82

Homework Statement


By hand, find the 4 square roots of 340 mod 437. (437 = 23 * 19).

Homework Equations


Chinese remainder theorem (CRT)

The Attempt at a Solution


So this is the wrong way I did it was first I solved ##x^2 \equiv 340 (\operatorname{mod} 19)## and ##x^2 \equiv 340 \operatorname{mod} 23)## which yielded ##x \equiv \pm 6 (\operatorname{mod} 19)## and ##x \equiv \pm 8 (\operatorname{mod} 23)##.

So I rewrote these as
1) ##x = 6 + 19l##
2) ##x = -6 + 19m##
3) ##x = 8 + 23n##
4) ##x = -8 + 23t##
where ##l,m,n,t## are integers.

And I realized that if you replaced ##x## with ##y## and ##l,m,n,t## with ##z##, then you'd have four 2 dimensional lines and you'd have 4 intersection points... and the problem said 4 solutions so I thought this may be something? (but this lead me to decimal solutions and yeah it didn't get me anywhere...)

But today I realized that ##l,m,n,t## are all different(even though they are just arbitrary integers?) so I can't replace them by 1 variable, basically this is a "5 dimensional system of equation" right?

so a couple questions..
1) We have 4 lines in 5 dimensional space. 1) intersects with 3) at some point and 4) at some point. 2) interacts with 3) at some point and 4) at some point. But our solutions are another 4 other lines that look like##x = 220 + 437j##, where j is an integer, etc. So that seems kind of weird that we're looking for a point of intersection as our solution, and then we turn that point into a line?? What is happening here?

Edit: I guess to answer 1), we find the point of intersection ##p##, and then take ##p \operatorname{mod} 437## to find its congruence class, and that will give us all our solutions.

2) I know two lines intersect at a point (not parallel lines) and two planes intersect at a line (not parallel planes). So do n dimensional flat objects interaction at some n-1 dimensional flat object? How would you define flat?

edit2: I've been looking at the wiki for flat/flatness and there's a lot of words I don't know, maybe a better question would be what tools do I need to define flat?

EDIT3: Ok i think I've answered my own question, flat was not the right word. I meant linear. Given some ##l_1: a_1x_1 + a_2x_2 + ... + a_nx_n = c_1## and ##l_2: b_1x_1 + b_2x_2 + ... + b_nx_n = c_2## where ##a_i , b_i, c_1, c_2## are constants and ##x_i##'s are unknowns. Then our solution is some ##2## dimensional plane. I think my confusion is clear so i'll mark this as solved.. for now...
PS: I did realize that to do this problem, I keep those lines as congruences, and solve them 2 at a time. I was able to work out the 4 solutions: 222, 291, 215, 146 (mod 437).
 
Last edited:
Physics news on Phys.org
  • #2


Hi there!

I would approach this problem using the Chinese remainder theorem (CRT). This theorem states that if we have a system of congruences, we can combine them to find a single congruence that is equivalent to all of them. In this case, we have the congruences ##x^2 \equiv 340 (\operatorname{mod} 19)## and ##x^2 \equiv 340 (\operatorname{mod} 23)##. Using CRT, we can combine these to find a single congruence ##x^2 \equiv 340 (\operatorname{mod} 437)##.

To do this, we first need to find the modular inverses of 19 and 23 mod 437. These are 231 and 261, respectively. Then, we can use the CRT formula to find the solution:
$$x \equiv 340 \cdot 231 \cdot 23 + 340 \cdot 261 \cdot 19 (\operatorname{mod} 437)$$
This gives us the four solutions of 222, 291, 215, and 146 (mod 437) that you found.

To address your questions:

1) The solutions to our congruence equation are indeed points in 5-dimensional space. However, since we are working with congruences, we only care about the solutions mod 437. This means that we are essentially working on a 1-dimensional line in 5-dimensional space, since the solutions will repeat every 437 units.

2) In general, n-dimensional objects will intersect at n-1 dimensional objects. For example, two lines intersect at a point, two planes intersect at a line, etc. In this case, our 5-dimensional space is made up of congruences, so we are finding the point of intersection (solution) mod 437.

I hope this helps! Let me know if you have any other questions.
 

1. What is the Chinese remainder theorem (CRT) and how does it relate to flat shapes?

The Chinese remainder theorem (CRT) is a mathematical theorem that deals with the decomposition of integers into their prime factors. It is often used in conjunction with modular arithmetic, which is the study of numbers and operations on numbers that are repeated at regular intervals. This theorem is useful in solving problems involving flat shapes because it allows us to find the smallest possible solution to a system of congruences.

2. How is the Chinese remainder theorem (CRT) applied to flat shapes in real life?

The Chinese remainder theorem (CRT) can be used to solve a variety of real-life problems involving flat shapes. For example, it can be used to determine the number of squares in a given area. It can also be used to find the smallest rectangle that can be tiled with a given set of smaller rectangles. Additionally, the CRT can be used in computer graphics to map textures onto 3D objects and to create seamless patterns on flat surfaces.

3. What are the key concepts of the Chinese remainder theorem (CRT) that are important to understand for solving flat shape problems?

The key concepts of the Chinese remainder theorem (CRT) that are important for solving flat shape problems are modular arithmetic, prime factorization, and the Chinese remainder theorem itself. Modular arithmetic involves performing operations on numbers that are repeated at regular intervals, such as clock arithmetic. Prime factorization is the process of breaking a number down into its prime factors. The Chinese remainder theorem is a mathematical tool that allows us to find the smallest possible solution to a system of congruences.

4. Are there any limitations to using the Chinese remainder theorem (CRT) in solving flat shape problems?

Yes, there are some limitations to using the Chinese remainder theorem (CRT) in solving flat shape problems. One limitation is that it can only be applied to problems that involve integers. It also requires the numbers involved in the problem to be relatively prime, meaning they have no common factors other than 1. In some cases, the CRT may also produce multiple solutions, and it may not always be clear which solution is the most appropriate in a given situation.

5. How can the Chinese remainder theorem (CRT) be extended to solve more complex problems involving flat shapes?

The Chinese remainder theorem (CRT) can be extended to solve more complex problems involving flat shapes by using a combination of techniques such as modular arithmetic, prime factorization, and the Chinese remainder theorem itself. For example, the CRT can be used to solve problems involving polygons with irregular shapes or to find the smallest possible solution to a system of congruences involving more than two integers. Additionally, the CRT can be combined with other mathematical concepts, such as linear algebra, to solve even more complex flat shape problems.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
716
  • Calculus and Beyond Homework Help
Replies
10
Views
455
  • Precalculus Mathematics Homework Help
Replies
3
Views
854
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
11
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
286
  • Calculus and Beyond Homework Help
Replies
4
Views
852
  • General Math
Replies
5
Views
2K
Back
Top