Suppose we have a congruence equation like $$m_1+2m_2+3m_3+4m_4+5m_5+10 \equiv 0 \pmod{60}.$$ How do we show that there exist $(m_1', m_2',m_3',m_4',m_5') \in \mathbb Z_{\geq 0}^5$ such that $m_i' < m_i$ and $m_1'+2m_2'+3m_3'+4m_4'+5m_5'+10 = 60$.
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
It seems from the comments that what OP wants is for $m_1+2m_2+\cdots+5m_5+10$ to be a proper multiple of 60. But there are still trivial counterexamples. E.g., if $m_1=6050$ and $m_i=0$ for $i=2,3,4,5$, then $$m_1+2m_2+3m_3+4m_4+5m_5+10=6060$$ is a proper multiple of 60, but there is no non-negative integer $m_2'\lt m_2$, so we don't even have to consider the rest of the conditions. If you don't like $m_1\ge60$, then just take $m_1=m_2=m_3=0$, $m_4=15$, $m_5=10$, and the same trivial objection applies. For the fourth, and last, time, I implore OP to think the question through and see if it can't be edited to ask something sensible. |
|||||||||||
|