More fun in 2015, Part 42

How many Gaussian integers divide 2015?


The answer is 128.

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

Mark Hennings
Dec 27, 2015

We can decompose 2015 2015 into non-associate irreducible elements of Z [ i ] \mathbb{Z}[i] as follows: 2015 = ( 2 + i ) ( 2 i ) ( 3 + 2 i ) ( 3 2 i ) 31 2015 \; = \; (2 + i)(2 - i)(3 + 2i)(3 - 2i)31 recalling that prime/irreducible elements of Z [ i ] \mathbb{Z}[i] are Gaussian integers of the form a + i b a+ib where a 2 + b 2 = 2 a^2 + b^2 = 2 or a 2 + b 2 = p a^2 + b^2 = p is prime with p 1 p \equiv 1 modulo 4 4 , or else are prime integers p p which are congruent to 3 3 modulo 4 4 . Since the Gaussian integers contain the 4 4 units 1 , i , 1 , i 1,i,-1,-i , and since 2015 2015 is a product of 5 5 non-associate prime factors, we deduce that 2015 2015 has a total of 4 × 2 5 = 128 4 \times 2^5 = 128 factors in Z [ i ] \mathbb{Z}[i] .

Yes, exactly! The factors of 2015 are the Gaussian integers of the form u ( 2 + i ) m ( 2 i ) n ( 3 + 2 i ) p ( 3 2 i ) q 3 1 r u(2+i)^m(2-i)^n(3+2i)^p(3-2i)^q31^r , where u u is one of the four units and the five exponents are all either 0 or 1. There are 4 2 5 = 128 4*2^5=128 such numbers , as you say.

The theory is analogous to the (good old) integers, except that we now have four units instead of two (namely , ± 1 \pm 1 ).

Otto Bretscher - 5 years, 5 months ago

Log in to reply

Yeah finally solved it . Just had to reveal the other problem ;)

But still great problem @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...