Visualize a 10x10 table with numbers 0 through 9 along the top-header, representing numbers for "a."
Along the side-header, there are also numbers 0 through 9, representing numbers for "b."
There are 100 spaces inside the table. The top-left square represents (a,b) = (0,0) and the square to the right represents (a,b) = (1,0), and so on. Each of the 100 squares represents an ordered pair of (a,b).
Along the diagonal, the (a,b) pairs contain pairs where a=b.
The North-East triangle contains (a,b) pairs where a > b.
The number of pairs that are good (what we are looking for) where a >= b is 55.
To get that 55-number, count all the squares in the North-East triangle (above the diagonal) and add the number of squares in the diagonal. You will get 55 squares where a >=b.
Since there are 100 squares in total, and 55 squares represent what we are looking for, the probability of randomly selecting a square with a >=b is 55/100.
Or we could say: P(a>=b) = 55/100 = .55
EXTRA: Clever way to count the squares where a >= b.
Realize that if you cut the 10x10 square in half, via a line down the diagonal, you will cut each diagonal square in half. Half of 100 is 50. So that cut, down the diagonal gives us 50. Included in that 50 are half of the 10 diagonal squares, which represents 5 of our 50. (because 10 halves is 5).
But, we want all 10 diagonal squares to be included with the good squares, not just half of them.
The diagonal line, cut through the diagonal squares leaves 10-halves above, and 10-halves below.
If we add those 10-halves that were cut from the diagonal, we add 5 to get a total of 55.
If this is too abstract, just sketch the table and count the good squares!