My first problem - Are any of the numbers equal to each other?

Let a , b , c , d a, b, c, d be integers such that the statements: a c d \frac{a}{cd} > 1 b \frac{1}{b} , d c < 0 < b a d\leq c<0<b\leq a are true, and a a b b a b + c a b d a b a b + c d \frac{a^{ab}b^{ab}+c^{ab}d^{ab}}{ab+cd} is not an integer.

How many permutations of integers a , b , c a, b, c and d d are there?


The answer is 12.

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

Tomislav Franov
Apr 12, 2020

Notice that I called the problem "Are any of the numbers equal to each other?" as a kind of a hint, to eliminate the possibility of falsely deducing that there are 24 permutations, since if any of the numbers are by any chance equal to each other, there will be duplicates. This is the case here. Let's start by simplifying the inequality a c d \frac{a}{cd} > 1 b \frac{1}{b} . We can multiply the equation by the denominators if and only if they are both strictly greater than 0 0 . We can see from there that if both c c , and d d are negative, c d cd must be positive. So, by multiplying, we get a b > c d ab>cd . Now, let a b = x ab=x and c d = y cd=y . We know that x , y > 0 x, y>0 , x > y x>y , and that they both are integers. Substituting that into the fraction from the exercise condition, we get x x + y x x + y \frac{x^{x}+y^{x}}{x+y} . Since it mustn't be an integer, the numerator mustn't be divisible by the denominator. If x = 1 x=1 , the numerator is equal to the denominator, which isn't allowed. If x x is greater or equal to 3, the numerator can be factored to ( x + y ) ( x x 1 y x x 2 + . . . ± y x 1 ) (x+y)(x^{x-1}-yx^{x-2}+...\pm y^{x-1}) , allowing it to be cancelled with the denominator, which also isn't allowed. So x x must be equal to 2. Since x > y x>y and both are greater than 0, y must be equal to 1. Substituting back in, we have to solve the diophantine equations a b = 2 ab=2 and c d = 1 cd=1 . The possible solutions for the first equation are ( a , b ) = ( ± 1 , ± 2 (a,b)=(\pm 1,\pm 2 ), and using the conditions from earlier - x , y > 0 x, y>0 , x > y x>y we end up with a = 2 , b = 1 a=2, b=1 . Likewise, the possible solutions for the second equations are ( c , d ) = ( ± 1 , ± 1 (c,d)=(\pm 1,\pm 1 ), and by eliminating we get c = 1 c=-1 , and d = 1 d=-1 . So now we see that c and d are equal to each other. Because of that, the possible number of permutations is 4 ! 2 ! \frac{4!}{2!} , or 12.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...