Is (n+1)(2n+1) Always a Multiple of 6 for All Natural Numbers n?

  • Context: Graduate 
  • Thread starter Thread starter inverse
  • Start date Start date
  • Tags Tags
    Arithmetic
Click For Summary

Discussion Overview

The discussion revolves around whether the expression (n+1)(2n+1) is always a multiple of 6 for all natural numbers n. Participants explore this question using congruences and case analysis, focusing on the mathematical reasoning behind divisibility by 6.

Discussion Character

  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant presents a case analysis based on congruences modulo 3, suggesting that for different forms of n (3k, 3k+1, 3k+2), the expression can be analyzed for divisibility by 6.
  • Another participant challenges the first participant's analysis, claiming that the case for n=3k does not yield a multiple of 6 and questions the validity of the conclusions drawn for the other cases.
  • The second participant also notes that the case for n=3k+1 is a multiple of 6 only if k is even, prompting further exploration of this condition.
  • Some participants express confusion regarding the original question and request clarification, indicating that the formulation may not have been clear.
  • There is a mention of incomplete reasoning regarding the divisibility by 2, suggesting that the analysis may need further development.

Areas of Agreement / Disagreement

Participants do not appear to reach a consensus, as there are competing views on the validity of the case analysis and the conditions under which the expression is divisible by 6.

Contextual Notes

There are limitations in the clarity of the original question and potential errors in the mathematical reasoning presented, particularly regarding the completeness of the proof for divisibility by 2.

inverse
Messages
26
Reaction score
0
Hello,

The formulation of the question says:

Show, using congruences and disjunction of cases, which,for all natural n є Ninteger, the integern (n+1) (2n+1) is a multiple of 6.

Simultaneously, themultiple of 3 is a multiple of 2 (number), then it is divisible by 6

3 cases are possible by applying the congruence module 3:

If [itex]n=3k \Longrightarrow n 3k\left ( n+1 \right )[/itex][itex]\left ( 2n+1 \right )=3k'[/itex]

If [itex]n=3k+1 \Longrightarrow 2n+1=6k+3[/itex] [itex]3k\left ( n+1 \right )\left ( 2k+1 \right )=3k''[/itex]

If [itex]n=3k+2 \Longrightarrow n+1=3k+3[/tex] and [tex]3n\left ( k+1 \right )\left ( 2n+1 \right )=3k'''[/tex][/itex][tex] <br /> Thank you very much for your attention[/tex]
 
Physics news on Phys.org
inverse said:
Hello,

The formulation of the question says:

Show, using congruences and disjunction of cases, which,for all natural n є Ninteger, the integern (n+1) (2n+1) is a multiple of 6.

Simultaneously, themultiple of 3 is a multiple of 2 (number), then it is divisible by 6

3 cases are possible by applying the congruence module 3:

If [itex]n=3k \Longrightarrow n 3k\left ( n+1 \right )[/itex][itex]\left ( 2n+1 \right )=3k'[/itex]

If [itex]n=3k+1 \Longrightarrow 2n+1=6k+3[/itex] [itex]3k\left ( n+1 \right )\left ( 2k+1 \right )=3k''[/itex]

If [itex]n=3k+2 \Longrightarrow n+1=3k+3[/tex] and [tex]3n\left ( k+1 \right )\left ( 2n+1 \right )=3k'''[/tex][/itex][tex] <br /> Thank you very much for your attention[/tex]
[tex] <br /> <br /> <br /> You should be more careful before you send over a post, and that's what the "preview post" button exists for.<br /> <br /> You want to know for what positive integers n, the number [itex]\,(n+1)(2n+1)[/itex] is a multiple of 6.<br /> <br /> Your division in cases is fine, but for example: [tex]n=3k\Longrightarrow (n+1)(2n+1)=(3k+1)(6k+1)[/tex] which is never a multiple of 6 (I just can't understand what you did in this case)<br /> <br /> Simmilarly for the next case, [tex]n=3k+1\Longrightarrow (n+1)(2n+1)=(3k+2)(6k+3)[/tex] which is multiple of 6 iff [itex]\,k\,[/itex] is even (why?).<br /> <br /> Now try to do correctly the last case by yourself.<br /> <br /> DonAntonio[/tex]
 
I cannot understand what are you asking me, can you ask the question again?
thanks
 
inverse said:
I cannot understand what are you asking me, can you ask the question again?
thanks
Don asked you to check your first post for errors and typos using the preview button. Looks like you should have corrected the typos as he only saw the last two factors since you left out a space between "integers" and "n". By the way you did not show that the product is divisible by 2, so your work is incomplete.
 

Similar threads

Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 4 ·
Replies
4
Views
8K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
7
Views
4K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 61 ·
3
Replies
61
Views
10K
  • · Replies 17 ·
Replies
17
Views
5K