Let R ( a , b ) be defined over the positive real numbers as the remainder when a is divided by b ; that is, if a = q b + r where q is an integer and 0 ≤ r < b , then R ( a , b ) = r . For example, R ( 2 2 , 2 ) = 0 because 2 2 2 = 2 which has no remainder, while R ( 2 , 2 ) = 2 − 2 because 2 2 = 1 + 2 2 − 2 .
Let f ( x ) = x 2 − 8 x + 1 7 . How many real values of x satisfy R ( f ( x ) , x ) = 0 over the interval 1 ≤ x ≤ 2 0 1 5 ?
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.
Nice problem.
To generalize divisibility, we shouldn't require a and b to be positive. It is sufficient for b to be non-zero.
Log in to reply
If you are going to allow b to be negative, are you going to specify that 0 ≤ r < ∣ b ∣ , or will r be negative when b is negative? There is a natural extension of division for a < 0 , but I am not so sure for b < 0 .
Log in to reply
Yes, the remainder is defined as
0
≤
r
<
∣
∣
b
∣
∣
, where
∣
∣
⋅
∣
∣
is the norm function. The
Division Algorithm
can be generalized to Euclidean domain.
For the real numbers, the norm function is given by the absolute value, hence
∣
b
∣
.
For the complex numbers, the norm function is given by the absolute value
∣
x
+
i
y
∣
=
x
2
+
y
2
.
For polynomials, the norm function is given by the degree of the polynomial, which is why we have
de
g
r
<
de
g
b
.
Log in to reply
@Calvin Lin – So actually the remainder should satisfy ∥ r ∥ < ∥ b ∥ , if you are going to use Euclidean norm as the distance function.
Actually this is all rather artificial; requiring that the quotient be an integer is nothing to do with Euclidean domains. Any field is a Euclidean domain since we can write x = q y + r , with r = 0 , for any real x , y where y is nonzero!
Entertaining problem!
We want x x 2 − 8 x + 1 7 to be an integer, or, equivalently, we want f ( x ) = x + x 1 7 to be an integer. The function f ( x ) is decreasing for 1 ≤ x ≤ 1 7 and then increasing, with f ( 1 7 ) ≈ 8 . 2 5 . The function attains the 10 integer values f ( 1 ) = 1 8 to 9 on the way down and then the 2007 integer values 9 to 2015 on the way up, for a total of 2 0 1 7 .
Good clear explanation. We are essentially asking for the number of values of the form \frac{ (8+n) \pm \sqrt{ (8+n)^2 - 4 \times 17 } { 2} to be between 1 and 2015.
We want x 2 − 8 x + 1 7 x = n x for some positive integer n The roots of x 2 − ( n + 8 ) x + 1 7 = 0 are x ± = 2 1 ( n + 8 ± ( n + 8 ) 2 − 6 8 ) , Elementary algebra shows that x − ≥ 1 provided that n ≤ 1 0 , and that x + ≤ 2 0 1 5 provided that n ≤ 2 0 1 7 . Thus there are 1 0 + 2 0 0 7 = 2 0 1 7 solutions to the problem.
same method.you must mention why n≥1, show by discriminant test.
Problem Loading...
Note Loading...
Set Loading...
In order for R ( f ( x ) , x ) = 0 , x f ( x ) has to be an integer.
We know that f ( x ) > 0 for x ∈ R , and since x will be positive in our domain, x f ( x ) will be positive over our entire domain.
If we define g ( x ) = x f ( x ) , we get:
g ( x ) = x − 8 + x 1 7
Looking at g ( x ) , we can tell that it is continuous over our interval, and will decrease to some minimum value and then increase from there.
Plugging in some values for g ( x ) , we get
g ( 1 ) = 1 0 g ( 4 ) = 4 1 g ( 2 0 1 5 ) = 2 0 0 7 + 2 0 1 5 1 7
From all of the above information, we know that over the interval 1 ≤ x ≤ 2 0 1 5 , g ( x ) will decrease from 1 0 to some value 0 < g ( a ) < 1 , thus passing through all the integers between 1 0 and 1 . It will also increase from some value 0 < g ( a ) < 1 to g ( 2 0 1 5 ) = 2 0 0 7 + 2 0 1 5 1 7 , thus passing through all the integers from 1 to 2 0 0 7 .
This means g ( x ) will pass through 1 0 + 2 0 0 7 = 2 0 1 7 integers total, and thus our answer is:
2 0 1 7