Divisibility Problem: Show That n=3

  • Thread starter Thread starter geoffrey159
  • Start date Start date
  • Tags Tags
    Divisibility
Click For Summary

Homework Help Overview

The problem involves showing that the only natural number \( n \) greater than 1 for which \( 2n-1 \) divides the product \( (3n^2-3n+1)(3n^2-3n+2) \) is 3. The discussion centers around the algebraic manipulation and reasoning within modular arithmetic.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to prove the statement using modular arithmetic and algebraic manipulation. They express uncertainty about the correctness of their proof and seek simpler methods. Other participants provide brief affirmations and inquire about alternative approaches.

Discussion Status

The discussion is ongoing, with some participants affirming the original poster's reasoning while others express curiosity about potentially simpler solutions. No consensus has been reached regarding alternative methods.

Contextual Notes

Participants are operating under the constraints of the problem statement, specifically focusing on natural numbers excluding 0 and 1. There is an implicit assumption regarding the divisibility conditions that are being explored.

geoffrey159
Messages
535
Reaction score
68

Homework Statement


Show that the only ##n \in \mathbb{N}-\{0,1\} ## such that ##2n-1|(3n^2-3n+1)(3n^2-3n+2)## is 3.

Homework Equations


## P_n = (3n^2-3n+1)(3n^2-3n+2) ##
Addition and multiplication in ## \mathbb{Z}/(2n-1)\mathbb{Z} ##

The Attempt at a Solution



Hello, I'm not 100% sure my proof is correct for this problem, can you check it please ? Do you see a simpler way of doing it ?

I want to show that in ## \mathbb{Z}/(2n-1)\mathbb{Z} ##, ## \hat {P_n} = \hat 0 \Rightarrow n = 3 ## .

First, I rewrite ## P_n = ( (2n-1)^2 + n(1-n) ) ( (2n-1)^2 + n(1-n) + 1 ) ##.

Using the fact that ## \hat 0 = \widehat {2n-1} ## and ## \hat n = \hat 1 - \hat n ##, I get that ##\hat {P_n} = \hat {n^2} ( \hat {n^2} + \hat 1) ##

Now, assuming that ## \hat {P_n} = \hat 0 ##, I get that
##\hat 0 = \hat{4} \hat {P_n} = \widehat{4n^4} + \widehat{4n^2} = \widehat{ (2n^2)^2 } + \widehat { (2n)^2 } = \widehat{ (2n)^2 } .\widehat{n^2} + \hat 1 . \hat 1 = \hat{n^2} + \hat 1 ##

Multiplying by ##\hat{2}## left and right :
##\hat 0 = \widehat{2n}.\hat{n} + \hat 2 = \hat n + \hat 2 = \hat 1 - \hat n + \hat 2 = \widehat{3 -n} ##

So ## 2n-1 | 3 - n ##. It is always true that ## 2n-1 | 0 ## so ## n = 3 ## is a solution. It is the only possibility because ##2n-1\ge |3 - n| ## so it does not divide ## 3 - n ## for any other ##n\in \mathbb{N}-\{0,1\}##
 
Physics news on Phys.org
Thank you !
 
Do you know a simpler way of solving this problem ?
 
I don't see one.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K