7 ∀ 6 4 ∀ 2 6 ∀ 3 8 ∀ 6 = = = = 7 1 2 1 2 0 ?
Define a binary operation ∀ such that the conditions above are fulfilled. Find function of this binary operation. And evaluate ? + 8 2 .
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.
Good, can you convert the binary operation into a permutation function: a P b ? Why or why not?
[Response to Challenge Master Note]
x ∀ y = y ! x ! = ( x − x + y ) ! x ! = ( x − ( x − y ) ) ! x ! = x P x − y
If we look at it algebraically, the conversion is valid (well-defined) for all reals x , y > ( − 1 ) by virtue of the famous analytical extension of the factorial function, which is Gamma function.
But if we look at it combinatorially, this conversion would be valid when the permutation function has a combinatorial meaning which happens iff 0 ≤ y ≤ x with the additional condition of x , y ∈ Z .
Problem Loading...
Note Loading...
Set Loading...
We find that the logic is that
x ∀ y = y ! x !
∴ 8 ∀ 6 = 6 ! 8 ! = 5 6 , ? = 5 6
⟹ ? + 6 4 = 5 6 + 6 4 = 1 2 0