Register to reply

Proving with Congruence of intergers

by doggie_Walkes
Tags: congruence, intergers, proving
Share this thread:
doggie_Walkes
#1
Nov21-09, 12:17 PM
P: 20
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?
Phys.Org News Partner Mathematics news on Phys.org
Professor quantifies how 'one thing leads to another'
Team announces construction of a formal computer-verified proof of the Kepler conjecture
Iranian is first woman to win 'Nobel Prize of maths' (Update)
robert Ihnot
#2
Nov21-09, 12:31 PM
PF Gold
P: 1,059
This can be worked out by considering all the cases from 0 to 4 mod 5.
Mark44
#3
Nov21-09, 12:54 PM
Mentor
P: 21,258
Double posted.


Register to reply

Related Discussions
Congruence of Intergers and modular arthimetic General Math 6
Solutions to na=0 (mod m) Linear & Abstract Algebra 4
Prove there is at least 1 friday the 13th between march and october Precalculus Mathematics Homework 3
Solution to the general congruence Linear & Abstract Algebra 2
Congruence help Linear & Abstract Algebra 5