Prove (n(n+1)(2n+1))/6 is Integer - Div Alg

  • Context: Undergrad 
  • Thread starter Thread starter MAGICMATHS
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary

Discussion Overview

The discussion revolves around proving that the expression (n(n+1)(2n+1))/6 is an integer for natural numbers n greater than or equal to 1. Participants explore various methods, including the division algorithm and modular arithmetic, to establish the divisibility of the expression.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant suggests using the division algorithm to analyze n in the forms 6k, 6k+1, ..., 6k+5, but expresses difficulty in applying this method.
  • Another participant points out that the product (n)(n+1)(2n+1) is always divisible by both 2 and 3, implying that it should be divisible by 6.
  • A different participant argues that examining n modulo 6 is less effective than considering modulo 2 and modulo 3 separately, providing detailed reasoning for each case based on the properties of consecutive integers and their divisibility.
  • This participant breaks down the cases for n being in the forms 6k, 6k+1, 6k+2, 6k+3, 6k+4, and 6k+5, showing that in each case, the product is divisible by 6.
  • Several participants express appreciation for the insights shared, indicating that the discussion has helped clarify their understanding of the problem.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the most effective method for proving the statement. Multiple approaches are discussed, with some preferring modular arithmetic while others suggest the division algorithm.

Contextual Notes

The discussion includes various assumptions about the properties of integers and their divisibility, but these assumptions are not universally accepted or resolved among participants.

MAGICMATHS
Messages
7
Reaction score
0
How can i prove that if n>=1, (n(n+1)(2n+1))/6 is an integer. The hint is to use the division algorithm such that n has one of the forms 6k,6k+1,..6k+5 and to work each case...I tried changing n to 6k but i failed immeaditely :(
 
Physics news on Phys.org
MAGICMATHS said:
How can i prove that if n>=1, (n(n+1)(2n+1))/6 is an integer. The hint is to use the division algorithm such that n has one of the forms 6k,6k+1,..6k+5 and to work each case...I tried changing n to 6k but i failed immeaditely :(


Check that no matter what natural \,n\, is, the number \,(n)(n+1)(2n+1)\, is always divisible both by 2 and 3.

DonAntonio
 
Looking at n "modulo 6" seems an awkward way of doing this. Looking at "modulo 2" and "modulo 3" separately is far easier.

Specifically, of any two consectutive numbers, such as n and n+1, one of them must be even. Now, n must be of the form 3k (a multiple of 3), 3k+1, or 3k+ 2. If n is a multiple of 3 then we have factors of both 3 and 2 in the product and so the product is divisible by 6. If n= 3k+2, then n+ 1= 3k+2+1= 3k+ 3= 3(k+1) so n+1 is a multiple of 3. If n= 3k+1, then 2n+ 1= 6k+ 2+ 1= 6k+ 3= 3(2k+1).

But since you specifically say "6k, 6k+ 1" etc.:

If n= 6k the n itself is divisible by 6 so the product is.

If n= 6k+ 1 then n+ 1= 6k+ 2= 2(3k+1) so n+ 1 is divisible by 2 and 2n+ 1= 12k+ 2+ 1= 12k+3= 3(3k+ 1) is a multiple of 3 so the product of n and 2n+1 is divisible by 6.

If n= 6k+ 2= 2(3k+1), n is divisible by 2. n+1= 6k+ 2+1= 6k+3= 3(2k+1) so n+1 is divisible by 3 and the product of n and n+1 is divisible by 6.

If n= 6k+ 3= 3(2k+1), n is divisible by 3. n+ 1= 6k+ 3+ 1= 6k+ 4= 2(3k+ 2) so n+ 1 is divisible by 2 and the product of n and n+1 is divisible by 6.

If n= 6k+ 4= 2(3k+ 2), n is divisible by 2. 2n+1= 12k+ 8+ 1= 12k+ 9= 3(4k+ 3) so n+1 is divisible by 3 and the product of n and n+1 is divisible by 6.

If n= 6k+ 5, n+ 1= 6k+ 6= 6(k+ 1) is divisible by 6.
 
Thanks DonAntonio, that's a very good clue which i did not think about. :)
 
Thanks HallsofIvy, youve made my work very easy now. :)
 

Similar threads

  • · Replies 30 ·
2
Replies
30
Views
4K
Replies
3
Views
2K
  • · Replies 25 ·
Replies
25
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
12
Views
4K
Replies
48
Views
6K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K