Absolute Subtraction Mistake

Algebra Level 2

Lazy Liz doesn't like absolute values notation, and often drops them from her equations. She always writes

a b = a b . |a-b| = a-b.

How many of the 11 × 11 11 \times 11 ordered pairs of integers ( a , b ) (a, b) , each of which are between 0 and 10 inclusive, are there, such that

a b = a b ? |a-b| = a-b?


The answer is 66.

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.

3 solutions

Calvin Lin Staff
May 13, 2014

We know that a b = a b |a-b| = a-b if and only if a b a-b is non-negative, hence a b a \geq b .

For a > b a > b , there are ( 11 2 ) { 11 \choose 2 } pairs.
For a = b 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 a , and get 1 + 2 + 3 + + 11 = 66 1 + 2 + 3 + \ldots + 11 = 66 .

Hey. Could I ask why you use 11 choose 2 ?

Brian Yen - 4 years, 1 month ago

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 a > b .

Calvin Lin Staff - 4 years, 1 month ago
Laurent Shorts
Feb 25, 2017

We must have a b a\geq b .

There are 121 possibilities, on which 11 are a = b a=b , so 121 11 = 110 121-11=110 possibilities with as much where a < b a<b as where a > b a>b , so we divide 110 by 2 and get 55 possibilities where a > b a>b . Total is 11 + 55 = 66 11+55=\boxed{66}

Sujoy Roy
Dec 19, 2016

If we create a 11 × 11 11\times 11 matrix such that its entry is 0 0 if r o w n u m b e r > = c o l u m n n u m b e r row\: number>=column\: number and 1 1 otherwise, then total number of 0 0 's in the matrix is 1 1 2 11 2 + 11 = 66 \frac{11^2-11}{2}+11=\boxed{66} .

this is very interesting could you show it graphically?

Bruno Martel - 2 months, 3 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...