November 29th, 2012, 04:14 PM  #1 
Newbie Joined: Nov 2012 Posts: 25 Thanks: 0  Modulo Residue problem
Hello All, I am stuck with this problem. How can I prove the series {kb( mod d)}, k = 1, 2, . . . , d contains d different residues Can anyone please help me in this regard. I will be grateful. Thank you 
November 30th, 2012, 08:39 PM  #2  
Senior Member Joined: Aug 2012 Posts: 2,342 Thanks: 731  Re: Modulo Residue problem Quote:
 
December 1st, 2012, 04:26 AM  #3 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Modulo Residue problem
The condition you really need is gcd(b, d) = 1, since b = 0, d prime also fails.

December 1st, 2012, 08:57 AM  #4  
Senior Member Joined: Aug 2012 Posts: 2,342 Thanks: 731  Re: Modulo Residue problem Quote:
 
December 1st, 2012, 04:42 PM  #5 
Newbie Joined: Nov 2012 Posts: 25 Thanks: 0  Re: Modulo Residue problem
@ Maschke and CRGeathouse.. Thanks for the comments.. Yes i was missing the statement of gcd(d,b) = 1. 

Tags 
modulo, problem, residue 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Residue and modulo  KyVanchhay  Math Events  2  July 27th, 2013 09:00 PM 
Advanced modulo problem  Randompn  Number Theory  3  December 4th, 2012 11:11 AM 
Modulo problem  unm  Number Theory  7  December 3rd, 2012 01:42 PM 
Mistake with a simple residue problem!  omega  Complex Analysis  1  March 15th, 2012 07:19 AM 
residue  pascal4542  Complex Analysis  1  December 3rd, 2009 10:06 AM 