No Divisors Between an Integer and Twice it

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Integer
Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


Suppose that ##x \in \mathbb{N}## is such that ##n < x < 2n##, where ##n## is another natural number. I want to conclude that it is impossible for ##x## to divide ##2n##. Also, is there a way to naturally generalize this to all integers?

Homework Equations

The Attempt at a Solution


Since ##x \in (n,2n)##< then ##x = n + \ell## for some natural number ##\ell \in (0,n)##. Now, suppose the contrary, that ##x## divides ##2n##. Then ##2n = k(n + \ell)## for some ##k \in \mathbb{Z}##. Immediately we can say that ##k## must be a positive integer. Rearranging the equation gives

##n(2-k) = k(n+\ell)##

If ##k## is either ##1## or ##2##, then we get ##n = \ell## or ##2 \ell = 0##, both of which are contradictions. If ##k > 2##, then the LHS will be negative but the RHS will be positive, a contradiction.

How do I make this a little more rigorous?
 
Last edited:
Physics news on Phys.org
Bashyboy said:

Homework Statement


Suppose that ##x \in \mathbb{N}## is such that ##n < x < 2n##, where ##n## is another natural number. I want to conclude that it is impossible for ##x## to divide ##2n##. Also, is there a way to naturally generalize this to all integers?

Homework Equations

The Attempt at a Solution


Since ##x \in (n,2n)##< then ##x = n + \ell## for some natural number ##\ell \in (0,n)##. Now, suppose the contrary, that ##x## divides ##2n##. Then ##2n = k(n + \ell)## for some ##k \in \mathbb{Z}##. Immediately we can say that ##k## must be a positive integer. Rearranging the equation gives

##n(2-k) = k(n+\ell)##

If ##k## is either ##1## or ##2##, then we get ##n = \ell## or ##2 \ell = 0##, both of which are contradictions. If ##k > 2##, then the LHS will be negative but the RHS will be positive, a contradiction.

How do I make this a little more rigorous?
##2n = k(n + \ell) \nRightarrow n(2-k) = k(n+\ell)## and I don't see why you may assume ##k \in \{1,2\}##.
However, I don't think ##\ell## is needed at all. What do you get by simply assuming ##xk=2n##?
 
fresh_42 said:
##2n = k(n + \ell) \nRightarrow n(2-k) = k(n+\ell)## and I don't see why you may assume ##k \in \{1,2\}##.
However, I don't think ##\ell## is needed at all. What do you get by simply assuming ##xk=2n##?

Whoops! Rearranging the equation should actually give ##n(2-k) = k \ell##. And I am not not assuming that ##k## always takes the values ##1## and ##2##: I was just considering special cases.

To answer your question, I don't know what ##xk=2n## implies.
 
Bashyboy said:
Whoops! Rearranging the equation should actually give ##n(2-k) = k \ell##. And I am not not assuming that ##k## always takes the values ##1## and ##2##: I was just considering special cases.

To answer your question, I don't know what ##xk=2n## implies.
I meant, if you substituted ##x## by ##\frac{2n}{k}## in your assumption ##n<x<2n##, you could divide the whole thing by ##n## and see where it get's you to.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top