Proving Divisibility Property for Odd Integers: 24 l a(a2-1)

In summary, the conversation discusses how to prove the statement "if a is an odd integer, then 24 l a(a2-1)" without using modulo. The first attempt involves using 2n+1=a for all integer n, but the conversation stumbles when trying to divide by 24. The expert then suggests looking at the factors of a(a2-1) and how they relate to the divisibility of 8 and 3. The conversation also explores the divisibility of 4 and 2 and how it relates to 8. Eventually, the expert gives a hint to consider three consecutive integers and how one may be divisible by 4. After some back and forth, the expert concludes that the product of two
  • #1
annoymage
362
0

Homework Statement



prove the following

if a is an odd integer, then, 24 l a(a2-1)

(i'm not familiar with modulo yet, i think it can help, but let don't use it yet ;P)

Homework Equations



n/a

The Attempt at a Solution



i stumbled when using 2n+1=a for all integer n, because i will only get (2n)(4n2+4n), i can't see how it can divided by 24, should i think of any other equivalent classes of odd integer?? or any other clue? T_T help
 
Physics news on Phys.org
  • #2
For 24 to divide a(a2-1), convince yourself that this happens exactly when 8 and 3 divide evenly.
 
  • #3
i don't understand T_T, do you mean i need to find 8 l "something" , 3 l "something"

like 8 l a and 3 l a2-1 then 24 l a(a2-1), something like that??
 
  • #4
I meant 24 | a(a2-1) if and only if 8 | a(a2-1) and 3 | a(a2-1).
 
  • #5
hmm, if that's the case i can proof 3 l a(a2-1)
, 4 l a(a2-1) , and 2 l a(a2-1)
will imply 8 l a(a2-1) and 3 l a(a2-1), then 24 l a(a2-1) for all odd integer a

but now this troubled me how to proof a l d and c l d then ac l d , wait let me think, don't go offline, hoho
 
  • #6
Well, proving for 4 and 2 doesn't imply 8. Why not?
 
  • #7
i'm sorry, I'm not really good with english

before i continue, "Well, proving for 4 and 2 doesn't imply 8. Why not?" I'm not sure if this a question, or you implying that 4 and 2 does imply 8,

if you're implying, i follow your logic, then 4 and 2 does imply 8,

but now i want to verify is all a,b,c,d in Z follow this logic

if a l d and c l d then ac l d

i cannot proof this T_T, should i proof by contradiction maybe, wait, i'll try ;P
 
  • #8
wait I'm confused with myself
 
  • #9
No, I mean 4 and 2 actually don't imply 8. Can you think of the reason why not?
 
  • #10
ugh, i can't find counter example (should i use proof by contradiction?),

and you said 8 and 3 does imply 24, should i use (8 and 3 and (not 24)), is a contradiction??
 
  • #11
You really haven't explained why you think anything divides a(a^2-1). Why do you think 3 divides it? Why do you think 4 divides it? Let's start this over again.
 
  • #12
lets let's start again,

i mentioned

4 l a(a^2-1) for all odd integer

proof,

a=2n+1 for all integer n , then,

(2n+1)((2n+1)^2-1 = 8n^3 + 12n^2 + 4 n = 4(2n^3+3n^2+1), and it can divides by 4,

hmm, and i don't remember how i got 3 l a(a^2-1),
 
  • #13
Here's a hint. (a^2-1)=(a+1)(a-1). So a(a^2-1)=(a-1)a(a+1). Now rethink this. You don't even need a lot of technical stuff to answer this.
 
  • #14
yea, just now i got it like this,

when a=3n , 3(n(3n+1)(3n-1))

when a=3n-1 , 3(n(3n-1)(3n-2))

when a=3n+1 , 3(n(3n+1)(3n+2)) for all integer n

so 3 l a(a^2-1), for all integer a, hence, 3 l a(a^2-1) for all odd integer,

is this alright?
 
  • #15
hmm , i just noticed that

4 l a(a^2-1) for all integer,

anyway, what next thing to do?
 
  • #16
annoymage said:
yea, just now i got it like this,

when a=3n , 3(n(3n+1)(3n-1))

when a=3n-1 , 3(n(3n-1)(3n-2))

when a=3n+1 , 3(n(3n+1)(3n+2)) for all integer n

so 3 l a(a^2-1), for all integer a, hence, 3 l a(a^2-1) for all odd integer,

is this alright?

I think it's ok. But maybe you are making this too hard. a-1,a,a+1 are three consecutive integers. Of course one is divisible by three. Now why is the product divisible by 8 if a is odd. Just say it in words.
 
  • #17
Dick said:
Now why is the product divisible by 8 if a is odd. Just say it in words.

more clue please ;P
 
  • #18
hmm, when a is odd,

even*odd*even is even?
 
  • #19
Ok, but you shouldn't need this. If a is odd then (a-1) and (a+1) are two consecutive even numbers. Might one be divisible by 4?
 
  • #20
i can see that it divisible by 4, but if you asking "why", i don't know how to answer T_T
 
  • #21
annoymage said:
i can see that it divisible by 4, but if you asking "why", i don't know how to answer T_T

I'm asking whether you can show one of a+1 and a-1 is itself divisible by 4. Not whether the product is divisible by 4. "Two consecutive even numbers" think about it.
 
  • #22
owh, hmm, i only can answer like this,

a+1 divisible by 4 only when a=4n-1 , for odd integer n

a-1 divisible by 4 only when a=4n+1, for odd integer n

T_T, i only running around in circle, perhaps more clue (if you're not offended by my stupidity)
 
  • #23
annoymage said:
owh, hmm, i only can answer like this,

a+1 divisible by 4 only when a=4n-1 , for odd integer n

a-1 divisible by 4 only when a=4n+1, for odd integer n

T_T, i only running around in circle, perhaps more clue (if you're not offended by my stupidity)

Can't any odd number be written as either 4n-1 or 4n+1?
 
  • #24
Dick said:
Can't any odd number be written as either 4n-1 or 4n+1?

my answer is no, because every odd number can be written either 4n-1 or 4n+1

hmm, then a+1,a-1 are conservative even integer, product of two conservative integer will divisible by 4, then (a+1)(a-1) must divisible by 4? is that argument correct and sufficient?
 
  • #25
annoymage said:
my answer is no, because every odd number can be written either 4n-1 or 4n+1

hmm, then a+1,a-1 are conservative even integer, product of two conservative integer will divisible by 4, then (a+1)(a-1) must divisible by 4? is that argument correct and sufficient?

Yes, the product of ANY two even numbers is divisible by 4. That's correct but not sufficient. You need to show the product of two CONSECUTIVE even numbers is divisible by 8.
 
  • #26
i just read what consecutive means ;P
anyway

let 2n, 2n+2 be two consecutive even integer, so the product are (n)4(n+1),

let 2a, 2a+1, be consecutive integer,

if n=2a, then 8 l 8a(n+1)

if n=2a+1, then 8 l 8(a+1)n

so, 8 divides either one of them,

now back to your question (8 l a(a+1)(a-1) when a is odd)

let a=2n+1 for some integer n

then (2n+1)(2n+2)(2n), then 8 l (2n+1)(2n+2)(2n) since 2n+2, 2n are 2 consecutive even integer, so the product must divisible by 8, is that correct and sufficient?

anyway back to the question,

i still don't know why 24 divides a(a+1)(a-1)

or

" 24 | a(a2-1) if and only if 8 | a(a2-1) and 3 | a(a2-1) " how this is true if a is odd,

more clue ;P
 
Last edited:
  • #27
That's a bit confusing, but I think you've got the idea. Let N be any number. You don't know why 8|N and 3|N if and only if 24|N? Think about the prime factorization of N.
 

Related to Proving Divisibility Property for Odd Integers: 24 l a(a2-1)

1. What is the divisibility property for odd integers?

The divisibility property for odd integers states that if a number is odd, it is always divisible by 1 and itself. In other words, if we have an odd integer a, then a is always divisible by 1 and a. This property is true for all odd numbers, including 24.

2. How can we prove the divisibility property for odd integers?

The divisibility property for odd integers can be proven using mathematical induction. This involves showing that the property holds for the smallest odd integer (in this case, 1) and then assuming that it holds for some arbitrary odd integer n. Then, we must show that the property also holds for n+2. If we can successfully show this, then we have proven the property for all odd integers.

3. What is the formula for proving the divisibility property for odd integers?

The formula for proving the divisibility property for odd integers is as follows: Let a be an odd integer. Then, a is divisible by 1 and a. In other words, a = 1 * n and a = a * 1, where n is some integer.

4. Can the divisibility property for odd integers be applied to even integers?

No, the divisibility property for odd integers only applies to odd integers. Even integers follow a different divisibility property, which states that they are divisible by 1, themselves, and 2.

5. Why is the divisibility property for odd integers important?

The divisibility property for odd integers is important because it helps us to easily determine if a number is odd or even. By understanding this property, we can quickly determine the divisibility of odd numbers and use it in more complex mathematical problems.

Similar threads

  • Calculus and Beyond Homework Help
Replies
9
Views
2K
  • Calculus and Beyond Homework Help
Replies
5
Views
5K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
16
Views
4K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Precalculus Mathematics Homework Help
Replies
5
Views
807
  • Calculus and Beyond Homework Help
Replies
12
Views
5K
  • Math Proof Training and Practice
Replies
3
Views
856
  • Calculus and Beyond Homework Help
Replies
10
Views
2K
Back
Top