No Divisors Between an Integer and Twice it

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

Homework Help Overview

The discussion revolves around a problem in number theory concerning natural numbers, specifically the relationship between an integer \( x \) and twice another integer \( n \). The original poster attempts to demonstrate that if \( n < x < 2n \), then \( x \) cannot divide \( 2n \). Participants are exploring the implications of this assertion and considering how it might be generalized to all integers.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Some participants question the assumption that \( k \) must be limited to specific values, suggesting that a broader consideration of \( k \) might yield different insights. Others propose examining the implications of directly substituting \( x \) in terms of \( n \) and \( k \) to clarify the inequalities involved.

Discussion Status

The discussion is ongoing, with participants providing insights and questioning the assumptions made in the original reasoning. There is a focus on refining the logic and exploring different approaches to the problem without reaching a consensus on a definitive method or conclusion.

Contextual Notes

Participants are navigating the constraints of the problem, particularly the conditions under which \( x \) and \( n \) are defined, and the implications of these definitions on the divisibility of \( 2n \). There is an acknowledgment of the need for rigor in the arguments presented.

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.
 

Similar threads

Replies
7
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K