Residue Problem: Seeking Alternative Solutions

In summary, the individual is seeking assistance with a problem (#3) that can be found at a specific link. They are also open to alternative approaches to the problem. However, the image of the problem and their solution is difficult to read and it is suggested that they use a different formatting method for clearer presentation. They are also reminded that there is a more suitable forum for homework questions.
  • #1
Fisicks
85
0
The problem (#3) can be found here:http://img198.imageshack.us/i/img002lf.jpg/"
It would be helpful if someone could look over my solution (found here:http://img525.imageshack.us/i/img001of.jpg/" )
and also it would be helpful if anyone had a different approach to this problem.

Thanks
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
Fisicks said:
The problem (#3) can be found here:http://img198.imageshack.us/i/img002lf.jpg/"
It would be helpful if someone could look over my solution (found here:http://img525.imageshack.us/i/img001of.jpg/" )
and also it would be helpful if anyone had a different approach to this problem.

Thanks

The image of the problem is too poor to read. Ditto for your answer. Suggest that you learn to use Latex or at least try typing out you query directly so it would be readable. If you show more consideration for your readers, there could be a better response.
Note also there is a more appropriate forum for "homework" questions.
 
Last edited by a moderator:
  • #3
Thanks for your help, you made the problem so clear to me.
 

FAQ: Residue Problem: Seeking Alternative Solutions

What is the Complete Residue problem?

The Complete Residue problem is a mathematical problem that involves finding the smallest positive integer that leaves a given set of remainders when divided by a set of integers. It is also known as the Chinese Remainder Theorem.

Why is the Complete Residue problem important?

The Complete Residue problem has many practical applications in fields such as cryptography, coding theory, and number theory. It allows for efficient and secure communication and data storage.

How do you solve the Complete Residue problem?

The Complete Residue problem can be solved using the Chinese Remainder Theorem, which involves finding the greatest common divisor of the given set of integers and using modular arithmetic to find the solution.

Are there any limitations or restrictions to the Complete Residue problem?

Yes, the Complete Residue problem can only be solved if the given set of integers are pairwise coprime, meaning that they have no common factors other than 1. If this condition is not met, there is no unique solution.

Can the Complete Residue problem be solved for any set of integers?

No, the Complete Residue problem can only be solved for a specific set of integers. If the set of integers is changed, the solution will also change. However, there are algorithms that can be used to find the solution for any given set of integers.

Similar threads

Back
Top