A Problem of Power

What can we say is always true about the sum of two numbers x n x^n and x m x^m where n , m n,m and x x are all integers with n , m 0 n,m\geq 0 and x > 1 x>1 ?

None of these choices A perfect square A power of x x Never divisible by x x A multiple of x x An even number

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

What yo need to consider is the case when either n or m is 0:

In this case we have x^m+1 which is odd when x is even, not a multiple of x we can see that it's not a perfect square or a power of x just by subbing in some values (e.g. x=2, m=2 x^m+1=5 which isn't square nor is this a power of x).

All that is left is to show that there are values of n and m such that the sum is divisible by x, again we can do this by substitution. x=2,m=1,n=2 ==> 2^2+2^2=6 and 6 is a multiple of 2.

The only remaining option is none of these

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...