mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2007-11-17, 04:08   #1
ShiningArcanine
 
ShiningArcanine's Avatar
 
Dec 2005

22×23 Posts
Default Chinese Remainder Problem

http://library.thinkquest.org/22494/...ic/ari_pr1.htm

According to the solutions page, the second problem has no solution. I do not quite understand how they arrived at the second to last sentence of their proof and a C program I wrote for solving such problems says that 59 is the answer. Doing some quick calculations, it would seem that:

59 mod 2 = 1
59 mod 3 = 2
59 mod 4 = 3
59 mod 5 = 4
59 mod 6 = 5

Which makes 59 satisfy the conditions for having solved the problem, which I believe makes 59 + 60k give solutions of the problem for all numbers in Z. Does anyone know how they arrived at their second to last sentence?

Last fiddled with by ShiningArcanine on 2007-11-17 at 04:10
ShiningArcanine is offline   Reply With Quote
Old 2007-11-17, 05:10   #2
Peter Hackman
 
Peter Hackman's Avatar
 
Oct 2007
linköping, sweden

22×5 Posts
Default

They arrived at the soultion by a horrible mistake.

The solution form suggested assumes that the moduli are relatively prime in pairs; however, (4,6)=2. (And 2 divides 5-3=2, so the data are indeed compatible).
Peter Hackman is offline   Reply With Quote
Old 2007-11-17, 10:01   #3
Peter Hackman
 
Peter Hackman's Avatar
 
Oct 2007
linköping, sweden

22·5 Posts
Default

Quote:
Originally Posted by Peter Hackman View Post
They arrived at the soultion by a horrible mistake.

The solution form suggested assumes that the moduli are relatively prime in pairs; however, (4,6)=2. (And 2 divides 5-3=2, so the data are indeed compatible).
And, of course, the problem is perfectly trivial if you replace all right members by -1.
Peter Hackman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sorting on chinese remainder theorem alpertron Math 23 2017-12-15 16:46
Complexity of Chinese Remainder Theorem carpetpool Miscellaneous Math 4 2017-02-09 19:26
Basic Number Theory 6: functions and the Chinese Remainder Theorem Nick Number Theory Discussion Group 4 2016-10-31 22:26
Implementing Chinese Remainder Theorem in C ShiningArcanine Software 3 2007-11-17 05:55
division/remainder algorithm (trial factoring) TheJudger Math 4 2007-10-18 19:01

All times are UTC. The time now is 02:55.


Sat Oct 1 02:55:24 UTC 2022 up 44 days, 23 mins, 0 users, load averages: 1.28, 1.45, 1.38

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔