True or False?
If a n − b n is an integer for all natural n and distinct real numbers a , b , then a and b must be integers.
Clarification: a n − b n must be an integer for all natural values of n , not just a few values of n .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Very nice, but in Lemma 1 you should mention that k = 0 .
Log in to reply
Thanks. I've fixed it.
Log in to reply
What if a and b are not integers and a=b.?
Log in to reply
distinct real numbers a , b , .
That will result in k = 0 . To avoid this, I put "distinct" in the question.
a-b is an integer, then a=x+m, b=y+m, with x, y are integer and 0<=m<=1
a^{2} - b^{2} = (a-b) \times (a+b) is an integer => a+b is an integer also => m=0.5 or 0
a^{3} - b^{3} = (a-b) \times ( a^{2} + b^{2} + a \times b ) is integer also => m must be 0 => a and b must be integer
x y = z where x and z are integers does not imply that y is also an integer. It may also be a rational number. For example, 4 ∗ 2 1 = 2 does not mean that 1 / 2 is an integer.
I do not quite agree for instance taking the Binet formula for Fibonacci numbers and we split into two separate terms
a^n = [(1+Sqrt(5)/2) ^n ]/ Sqrt(5)
b^n = [(1-Sqrt(5)/2) ^n ]/ Sqrt(5)
If we substact a^n -b^n we get the Fn which is integer but a an b are not.
Log in to reply
What would a and b be in this instance?
Note that the denominator 5 doesn't have a exponent of n in it.
Log in to reply
I believe you can fix it by writing in the Binet formula [ Sqrt(5) ]^(1/n) and just plug it as the denominator inside the bracket, by making n=1 and we would get an and bn
Log in to reply
@Mariano PerezdelaCruz – Then it wouldn't work for all n . We need it to work for all n
(2.5)^2 -(1.5)^2 =6.25-2.25 =4 n=2 which is a natural number. a (2.5) is not equal to b (1.5). but 4 is an integer!!!!!!!!!!!
Log in to reply
The question states that a n − b n must be an integer for all natural n , not just one value of n .
For example if we take a and b as 3.5 and 4.5 and n=2 then answer will be an integer but a and b are not integers , so it is a ' may' condition and not 'must'.
Log in to reply
The question states that a n − b n must be an integer for all natural n , not just one value of n .
Log in to reply
In response to @Siddhartha Srivastava this would agree for n=2,4,16 Etc
Log in to reply
@Ritvik Arya – But it won't work for n = 3 . It has to work for all natural n . Not just a few specified values.
Log in to reply
@Siddhartha Srivastava – If one value satisfies then it is not must it is may
Log in to reply
@Ritvik Arya – The question is that if a n − b n is and integer for all n , then a and b must be integers.
If the initial statement (if a n − b n is and integer for all n ) is not true, as in the example you gave, then you can't say anything about the then statement.
You reasoning will only be correct if there exists some a , b such that a n − b n is an integer for all n
Just a comment. Are we saying that sqrt (2) is not a distinct real number? Because I was thinking (sqrt (3))^2-(sqrt(2))^2=1. I think we should use the term "rational" instead of "distinct".
In context, the word "distinct" meant that a = b , i.e. a and b are "distinct".
Your counter example only works for n = 2 . It obviously does not work for n = 1 and all other odd numbers.
Problem Loading...
Note Loading...
Set Loading...
Lemma 1:- If l p n k is an integer for a monotonically increasing sequence < p n > with p 1 = 1 and a non-zero integer k , then l is an integer.
Proof :- l can't be irrational, otherwise it would imply l k is irrational, contradiction. Then, for the sake of contradiction, suppose l is a non integral rational number q p where p , q are integers, q = 1 and g cd ( p , q ) = 1 . Then l p n k = q p n p p n k . Since g cd ( p n , q n ) = g cd ( p , q ) = 1 , we have q p n ∣ k ⟹ q p n ≤ k . But this is not possible as q p n is increasing. Therefore, our suppostion is wrong and l is an integer.
Now, ( a n − b n ) 2 + a 2 n − b 2 n = 2 a n ( a n − b n ) implies 2 a n ( a n − b n ) is an integer.
Also, [ ( 2 a n ) k ( a n − b n ) ] 2 + 2 k [ ( 2 a 2 n ) k ( a 2 n − b 2 n ) ] = ( 2 a n ) 2 k + 1 ( a n − b n ) implies that if ( 2 a n ) k ( a n − b n ) is an integer, then ( 2 a n ) 2 k + 1 ( a n − b n ) is an integer for natural n . Since the case k = 1 is true, we can conclude that ( 2 a n ) t n ( a n − b n ) is an integer for a monotonically increasing sequence < t n > with t 1 = 1
Then, by Lemma 1, 2 a n must be an integer for all natural numbers n . Applying Lemma 1 again,we see a must be an integer.
Now since a − b and a both are integers, b must also be an integer. Hence, if a n − b n is an integer for all natural n , then a and b must be integers.