Thread Closed

Proving with Congruence of intergers

 
Share Thread
Nov21-09, 12:17 PM   #1
 

Proving with Congruence of intergers


It just how do i prove that

b^3 +b^2 +1 does not divide by 5


Im thinking this way,
cause i know that b^3 +b^2 +1 is not congruent to 0(mod5)

therefore we use contradition to prove it. im just not sure how to use contradition? or maybe im looking at this in a completely bad light? maybe there is another method?
PhysOrg.com mathematics news on PhysOrg.com

>> Pendulum swings back on 350-year-old mathematical mystery
>> Bayesian statistics theorem holds its own - but use with caution
>> Math technique de-clutters cancer-cell data, revealing tumor evolution, treatment leads
Nov21-09, 12:31 PM   #2
 
Recognitions:
Gold Membership Gold Member
This can be worked out by considering all the cases from 0 to 4 mod 5.
Nov21-09, 12:54 PM   #3
 
Mentor
Double posted.
Thread Closed

Similar discussions for: Proving with Congruence of intergers
Thread Forum Replies
Congruence of Intergers and modular arthimetic General Math 6
solutions to na=0 (mod m) Linear & Abstract Algebra 4
Congruence Precalculus Mathematics Homework 3
solution to the general congruence Linear & Abstract Algebra 2
congruence help Linear & Abstract Algebra 5