All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Remainders (Posted on 2006-04-15) Difficulty: 4 of 5
A={the set of all positive integers leaving a remainder of 4 when divided by 45}
B={the set of all positive integers leaving a remainder of 45 when divided by 454}
C={the set of all positive integers leaving a remainder of 454 when divided by 4545}
D={the set of all positive integers leaving a remainder of 4545 when divided by 45454}

Find the smallest number in the intersection of
1)Sets A and B;
2)Sets A and B and C;
3)Sets A and B and C and D.

See The Solution Submitted by Jer    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: computer solution | Comment 3 of 4 |
(In reply to computer solution by Charlie)

Excellent, Charlie! I have checked your answers and they are in the intersections and are minimal.  The minimality follows from the Generalized Chinese Remainder Theorem (see Wikipedia article on Chinese Remainder Theorem). Since the moduli 45, 454, 4545, and 45454 are not all pairwise coprime, the ordinary Chinese Remainder Theorem does not apply to other than part 1, but the generalized theorem does.
  Posted by Richard on 2006-04-16 16:02:32

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information