Prove log_2(m) is not an integer.

  • Thread starter Thread starter SithsNGiggles
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary

Homework Help Overview

The problem involves proving by contradiction that for a positive integer m with an odd divisor greater than 1, the expression log_2(m) is not an integer. The context is rooted in number theory and properties of logarithms.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants discuss the interpretation of the condition that m has an odd divisor greater than 1 and its implications for the nature of m. Some explore the relationship between m and powers of 2, while others consider the factorization of m into odd and even components.

Discussion Status

The discussion has progressed with participants articulating their understanding of the problem and clarifying the implications of the given conditions. Some have proposed reasoning that connects the properties of m with the logarithmic expression, while others are still grappling with the initial concepts.

Contextual Notes

Participants note that the problem requires a proof by contradiction and involves understanding the nature of odd divisors and powers of 2. There is an emphasis on the definitions and properties of integers and logarithms in the context of the problem.

SithsNGiggles
Messages
183
Reaction score
0

Homework Statement


Let [itex]m[/itex] be a positive integer that has an odd divisor greater than [itex]1[/itex]. Prove (by contradiction) that [itex]\log_2{m}[/itex] is not an integer.

Homework Equations



The Attempt at a Solution


I'm not sure where to begin here. The book I'm working with provides a similar example, but it was more specific and straightforward than this one (prove [itex]\log_2{19}[/itex] isn't an integer).

I think I'm having the most trouble with grasping the part saying "m has an odd divisor greater than 1." How do I interpret that?
 
Physics news on Phys.org
SithsNGiggles said:
I think I'm having the most trouble with grasping the part saying "m has an odd divisor greater than 1." How do I interpret that?

m is divisible by an odd prime (since all odd numbers greater than 1 are either prime or products of odd primes).
 
"m has an odd divisor greater than 1" simply means that m is NOT a power of 2.
Given any number, we can factor out all factors of 2 to get the form [itex]2^n x[/itex] where x has no factors of 2 (and so is odd) and n is an integer. If x= 1, of course, that is a power of 2. If x> 1, it is not.

If [itex]y= log_2(m)[/itex] then [itex]m= 2^y[/itex]. If y were an integer, then m would be a power of 2.
 
pasmith said:
m is divisible by an odd prime (since all odd numbers greater than 1 are either prime or products of odd primes).

HallsofIvy said:
If [itex]y= log_2(m)[/itex] then [itex]m= 2^y[/itex]. If y were an integer, then m would be a power of 2.

Ah, I think I get it now. Here's the proof:

Assume [itex]\log_2{m}[/itex] is an integer. Let [itex]y = \log_2{m}[/itex].
Then, [itex]2^y = m[/itex].

Since [itex]y[/itex] is assumed to be an integer, [itex]m[/itex] is a power of 2. This contradicts the fact that [itex]m[/itex] has an odd divisor greater than 1. Therefore, [itex]\log_2{m}[/itex] is not an integer.

Thanks for the help!
 

Similar threads

Replies
9
Views
3K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K