Let be positive integers. If , find the number of distinct ordered pairs that satisfy the equation .
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.
The given expression can be written as:
i a + 1 + i b + 1 = 2
As we know from imaginary unit powers, i k (with k positive integer) can only be
i , − i , − 1 o r 1
Then, the only solution for the expression i a + 1 + i b + 1 = 2
is i a + 1 = i b + 1 = 1
Yet from imaginary unit powers, i k = 1 if and only if k is multiple of 4. Then, we can write a + 1 = 4 n Where n is positive integer. Couting all possible values for 1 ≤ a ≤ 1 0 0 , we have 2 5 possible values for a . Similarly, we have 2 5 values for b .
We want the number of ordered pairs ( a , b ) . Cartesian Product (Rule of Product):
2 5 p o s s i b i l i t i e s f o r a 2 5 p o s s i b i l i t i e s f o r b ⇒ 2 5 X 2 5 = 6 2 5 ordered pairs.