inverse
- 26
- 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 n=3k \Longrightarrow n 3k\left ( n+1 \right )\left ( 2n+1 \right )=3k'
If n=3k+1 \Longrightarrow 2n+1=6k+3 3k\left ( n+1 \right )\left ( 2k+1 \right )=3k''
If n=3k+2 \Longrightarrow n+1=3k+3[/tex] and 3n\left ( k+1 \right )\left ( 2n+1 \right )=3k&#039;&#039;&#039;<br /> <br /> Thank you very much for your attention
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 n=3k \Longrightarrow n 3k\left ( n+1 \right )\left ( 2n+1 \right )=3k'
If n=3k+1 \Longrightarrow 2n+1=6k+3 3k\left ( n+1 \right )\left ( 2k+1 \right )=3k''
If n=3k+2 \Longrightarrow n+1=3k+3[/tex] and 3n\left ( k+1 \right )\left ( 2n+1 \right )=3k&#039;&#039;&#039;<br /> <br /> Thank you very much for your attention