How many Gaussian integers divide 2015?
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.
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 , where u is one of the four units and the five exponents are all either 0 or 1. There are 4 ∗ 2 5 = 1 2 8 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 ).
Log in to reply
Yeah finally solved it . Just had to reveal the other problem ;)
But still great problem @Otto Bretscher
Problem Loading...
Note Loading...
Set Loading...
We can decompose 2 0 1 5 into non-associate irreducible elements of Z [ i ] as follows: 2 0 1 5 = ( 2 + i ) ( 2 − i ) ( 3 + 2 i ) ( 3 − 2 i ) 3 1 recalling that prime/irreducible elements of Z [ i ] are Gaussian integers of the form a + i b where a 2 + b 2 = 2 or a 2 + b 2 = p is prime with p ≡ 1 modulo 4 , or else are prime integers p which are congruent to 3 modulo 4 . Since the Gaussian integers contain the 4 units 1 , i , − 1 , − i , and since 2 0 1 5 is a product of 5 non-associate prime factors, we deduce that 2 0 1 5 has a total of 4 × 2 5 = 1 2 8 factors in Z [ i ] .