Register to reply 
Number theory: finding integer solution to an equation 
Share this thread: 
#19
Apr2712, 02:31 PM

P: 361




#20
Apr2712, 02:41 PM

P: 584

Case 1: if m Ξ 0(mod3) then m^2 Ξ 0(mod3) Case 2: if m Ξ 1(mod3) then m^2 Ξ 1(mod3) Case 3: if m Ξ 2(mod3) then m^2 Ξ 4(mod3) with is m^2 Ξ 1(mod3) So that means that m^2=3n . So that means the when m is divided by 3 you get either a remainder of 0,1, or 2 am i right? 


#21
Apr2712, 09:47 PM

Emeritus
Sci Advisor
HW Helper
Thanks
PF Gold
P: 11,774




#22
Apr2812, 01:14 AM

P: 361

What is the value of ##3n## mod 3?



#23
Apr2812, 03:23 AM

P: 584




Register to reply 
Related Discussions  
Number Theory least divisor of integer is prime number if integer is not prime  Calculus & Beyond Homework  2  
Integer solution to exponential diophantine equation  Linear & Abstract Algebra  2  
1 equation, 2 unknowns, need integer solution  Precalculus Mathematics Homework  6  
Number theory: confused about the phrase an integer of the form  Calculus & Beyond Homework  4  
Order of an Integer mod m (number theory help!)  Calculus & Beyond Homework  1 