Prove that n^2 – n is divisible by 2 for every positive integer n.
in Algebra 1 Answers by

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.

1 Answer

n2-n=n(n-1). If m is any integer, then, if even n=2m, this becomes 2m(2m-1) which is divisible by 2.

If odd n=2m+1, this becomes (2m+1)2m which is also divisible by 2.

Since all whole numbers are either odd or even n2-n is always divisible by 2.

by Top Rated User (1.2m points)

Related questions

1 answer
asked Jun 21, 2017 in Algebra 1 Answers by syed4all Level 1 User (160 points) | 1.2k views
1 answer
asked Jun 21, 2017 in Other Math Topics by syed4all Level 1 User (160 points) | 986 views
1 answer
asked Sep 20, 2013 in Other Math Topics by anonymous | 711 views
0 answers
asked Jun 18, 2013 in Word Problem Answers by anonymous | 1.1k views
1 answer
asked Sep 7, 2017 in Algebra 1 Answers by Devon | 645 views
2 answers
asked Aug 22, 2013 in Algebra 1 Answers by zaki | 684 views
1 answer
asked Oct 7, 2012 in Geometry Answers by anonymous | 891 views
1 answer
asked Sep 12, 2012 in Calculus Answers by anonymous | 1.0k views
1 answer
asked Jan 16, 2012 in Pre-Algebra Answers by anonymous | 862 views
2 answers
asked Jul 17, 2014 in Algebra 1 Answers by anonymous | 778 views
1 answer
asked Sep 30, 2013 in Algebra 1 Answers by anonymous | 733 views
1 answer
Welcome to MathHomeworkAnswers.org, where students, teachers and math enthusiasts can ask and answer any math question. Get help and answers to any math problem including algebra, trigonometry, geometry, calculus, trigonometry, fractions, solving expression, simplifying expressions and more. Get answers to math questions. Help is always 100% free!
87,516 questions
100,279 answers
2,420 comments
732,016 users