Do it like Gauss, Part 2

Algebra Level 5

A Gaussian Integer is a complex number of the form z = a + b i z=a+bi , where a a and b b are integers. How many Gaussian Integers z z divide 1000, in the sense that 1000 = z × w 1000=z\times{w} for some Gaussian Integer w w ?


The answer is 448.

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.

1 solution

The Gaussian prime factorization of 10 10 is ( 1 i ) 2 ( 1 + 2 i ) ( 2 + i ) , (1 - i)^{2}(1 + 2i)(2 + i), which is unique up to multiplication by the units ± 1 , ± i . \pm 1, \pm i.

Thus the prime factorization of 1000 = 1 0 3 1000 = 10^{3} is ( 1 i ) 6 ( 1 + 2 i ) 3 ( 2 + i ) 3 , (1 - i)^{6}(1 + 2i)^{3}(2 + i)^{3}, again unique up to multiplication by the 4 4 units. Thus just as we would calculate the number of divisors of a "regular" integer by way of its prime factorization, with the additional multiplicative term of 4 4 to account for the four units, we find that the number of Gaussian divisors of 1000 1000 is

4 × ( 6 + 1 ) × ( 3 + 1 ) × ( 3 + 1 ) = 448 . 4 \times (6 + 1) \times (3 + 1) \times (3 + 1) = \boxed{448}.

Another beautiful and perfect solution; thank you! As I said earlier: You do it better than Gauss... you write like Euler.

Just to get to the bottom of things, can you please tell us a bit more about the uniqueness of the prime factorization?

Otto Bretscher - 6 years ago

Log in to reply

Thanks! I believe that Gauss addressed the matter of "uniqueness" in his second monograph, (1832). An informative discussion is given here . I'm still trying to digest all this information myself, but it should prove to be a good starting point.

Brian Charlesworth - 6 years ago

Log in to reply

I made mistakes, but here is a solution to young people: As z.w = 100 it foloows that | z| divide 1000;

I used a brute force method based on the fact that 1000/(a+bi)=1000(a-bi)/(a^2+b^2). It checks every integer combination of (a,b) from -1000 to 1000 but I keep coming up with 208 every time! Your answer makes sense to me, but what combinations could my program be missing?

Garrett Clarke - 6 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...