Lazy Liz doesn't like absolute values notation, and often drops them from her equations. She always writes
∣ a − b ∣ = a − b .
How many of the 1 1 × 1 1 ordered pairs of integers ( a , b ) , each of which are between 0 and 10 inclusive, are there, such that
∣ a − b ∣ = a − b ?
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.
Hey. Could I ask why you use 11 choose 2 ?
Log in to reply
Given any 2 distinct numbers out of the 11, there is only 1 way to arrange it such that a > b .
We must have a ≥ b .
There are 121 possibilities, on which 11 are a = b , so 1 2 1 − 1 1 = 1 1 0 possibilities with as much where a < b as where a > b , so we divide 110 by 2 and get 55 possibilities where a > b . Total is 1 1 + 5 5 = 6 6
If we create a 1 1 × 1 1 matrix such that its entry is 0 if r o w n u m b e r > = c o l u m n n u m b e r and 1 otherwise, then total number of 0 's in the matrix is 2 1 1 2 − 1 1 + 1 1 = 6 6 .
this is very interesting could you show it graphically?
Problem Loading...
Note Loading...
Set Loading...
We know that ∣ a − b ∣ = a − b if and only if a − b is non-negative, hence a ≥ b .
For a > b , there are ( 2 1 1 ) pairs.
For a = b , there are 11 pairs.
Hence, there are 66 pairs in total.
Note: Alternatively, we can list out the cases according to the value of a , and get 1 + 2 + 3 + … + 1 1 = 6 6 .