MHB Problem Chinese remainder Theorem

Click For Summary
The problem involves finding solutions for the equation \(x=x(r,s,t)\) where the intersection of the sets defined by \(r\), \(s\), and \(t\) is equal to \(x+n\mathbb{N}\). Participants clarify that \(n\) is the least common multiple of 2, 3, and 5, which is 30. The discussion focuses on determining the set of solutions that satisfy this condition. Understanding the role of the least common multiple is crucial for solving the problem. The conversation emphasizes the importance of clearly defining parameters in mathematical problems.
Julio1
Messages
66
Reaction score
0
Find the set of solutions $x=x(r,s,t)$ such that $(r+2\mathbb{N})\cap (s+3\mathbb{N})\cap (t+5\mathbb{N})=x+n\mathbb{N}.$

Hello MHB :). Any hints for the problem?
 
Mathematics news on Phys.org
Hi Julio,

Could you specify what $n$ is? Is it $30$?
 
Euge said:
Hi Julio,

Could you specify what $n$ is? Is it $30$?

Hi Euge :).

Yes, $n=\text{lcm}(2,3,5)=30.$
 

Similar threads

A Name for a subset of real space being nowhere a manifold with boundary
  • · Replies 5 ·
Replies
5
Views
1K
I Relevant Literature for Noisy Linear Dynamical Systems
  • · Replies 1 ·
Replies
1
Views
2K
MHB Remainder converges uniformly to 0
  • · Replies 10 ·
Replies
10
Views
2K
MHB What is the remainder when m+n is divided by 1000 in a trigonometric challenge?
  • · Replies 2 ·
Replies
2
Views
1K
MHB Quotient remainder theorem problem.
  • · Replies 3 ·
Replies
3
Views
2K
MHB How Can the Chinese Remainder Theorem Be Applied to Diophantine Equations?
  • · Replies 1 ·
Replies
1
Views
2K
I Recursion theorem: application in proof
  • · Replies 2 ·
Replies
2
Views
2K
A Injective immersion and embedding
  • · Replies 2 ·
Replies
2
Views
346
I Modulo and Modulus in math and computer programming
  • · Replies 5 ·
Replies
5
Views
3K
Problem involving recursion theorem
  • · Replies 11 ·
Replies
11
Views
1K