SAT1000 - P880

Algebra Level pending

For function f ( x ) , g ( x ) f(x), g(x) which have the same domain D D , if there exists h ( x ) = k x + b h(x)=kx+b ( k , b k,b are constant), so that:

m ( 0 , + ) , x 0 D , x D x > x 0 , 0 < f ( x ) h ( x ) < m , 0 < h ( x ) g ( x ) < m , \forall m \in (0,+\infty), \exists x_0 \in D, \forall x \in D \wedge x>x_0, 0<f(x)-h(x)<m, 0<h(x)-g(x)<m,

Then line l l : y = k x + b y=kx+b is called the bipartite asymptote for curve y = f ( x ) y=f(x) and y = g ( x ) y=g(x) .

Here are four groups of functions which are defined at ( 1 , + ) (1,+\infty) :

  1. f ( x ) = x 2 , g ( x ) = x f(x)=x^2, g(x)=\sqrt{x} .

  2. f ( x ) = 1 0 x + 2 , g ( x ) = 2 x 3 x f(x)=10^{-x}+2, g(x)=\dfrac{2x-3}{x} .

  3. f ( x ) = x 2 + 1 x , g ( x ) = x ln x + 1 ln x f(x)=\dfrac{x^2+1}{x}, g(x)=\dfrac{x \ln x+1}{\ln x} .

  4. f ( x ) = 2 x 2 x + 1 , g ( x ) = 2 ( x 1 e x ) f(x)=\dfrac{2x^2}{x+1}, g(x)=2(x-1-e^{-x}) .

Which groups of curve y = f ( x ) y=f(x) and y = g ( x ) y=g(x) has a bipartite asymptote ?

How to submit:

Let p 1 , p 2 , p 3 , p 4 p_1, p_2, p_3, p_4 be the boolean value of the group 1 , 2 , 3 , 4 1,2,3,4 , if group k k has a bipartite asymptote , p k = 1 p_k=1 , else p k = 0 p_k=0 .

Then submit k = 1 4 p k 2 k 1 \displaystyle \sum_{k=1}^4 p_k \cdot 2^{k-1} .


Have a look at my problem set: SAT 1000 problems


The answer is 10.

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.

1 solution

The two curves defined by the functions f ( x ) f(x) and g ( x ) g(x) in groups 1 and 3 intersect and can't have the so called bipartite asymptote . Those in groups 2 and 4 never intersect. Hence they are the correct options.

Hence the required answer is 1 × 2 2 1 + 1 × 2 4 1 = 10 1\times 2^{2-1}+1\times 2^{4-1}=\boxed {10} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...