How many ordered pairs are there with and
Details and assumptions
For an ordered pair of integers , the order of the integers matter. The ordered pair is different from the ordered pair .
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.
We consider a general solution to the problem of how many pairs ( x , y ) there are with x ∈ { 0 , 1 , 2 , … , n } , y ∈ { 0 , 2 , 4 , … , 2 n } and x < y . We consider two cases. Either n = 2 k or n = 2 k + 1 .
When n = 2 k , we count the number of possible x values for each y value. For 0 ≤ y ≤ 2 k there are y values of x that will give x < y . When y > 2 k , all n + 1 values of x will give x < y . In the first instance, there are 2 + 4 + ⋯ + 2 k = 4 n ( n + 2 ) pairs ( x , y ) which will satisfy the conditions and in the second there are 2 n ( n + 1 ) pairs. In total this gives 4 3 n 2 + 4 n pairs when n = 2 k .
When n = 2 k + 1 we count in a similar manner. When 0 < y ≤ 2 k there are y values of x with x < y . When y > 2 k there are n + 1 values of x with x < y . This gives 2 + 4 + ⋯ + n − 1 = 4 ( n + 1 ) ( n − 1 ) pairs for the first instance and 2 ( n + 1 ) ( n + 1 ) pairs for he second instance, for a total of 4 3 n 2 + 4 n + 1 pairs when n is odd.
We can combine the two formulae to get ⌊ 4 3 n 2 + 4 n + 1 ⌋ as the general value for each n . When n = 2 5 this gives 4 9 4 .