1. ## gaussian prime factorisation

if you look at the wolframalpha calculation page:
-13-26i - Wolfram|Alpha

it factorises -13-26i as

i×(1+2 i)×(2+3 i)×(3+2 i)

my question is why is the i a necessary factor to take out? are the rules regarding this?

Thanks

2. ## Re: gaussian prime factorisation

Hint: (1-i) is NOT a Gaussian Prime. It can be factored: i(1+i)

3. ## Re: gaussian prime factorisation

Originally Posted by TKHunny
Hint: (1-i) is NOT a Gaussian Prime. It can be factored: i(1+i)
I don't think that this is correct. There is a characterisation of Gaussian primes that says that a Gaussian integer is prime if and only if one of the conditions is true:

• Its norm is prime (as an integer)
• It is a prime (as an integer) of the form $4k+3$

In this case, the norm of $1-i$ is $1^2+(-1)^2=2$, which is prime. So $1-i$ is prime.

The issue that should be brought up is that unique factorisation only holds up to a unit (i.e. invertible number). For example, normal integer factorisation follows this idea: $25=5\times 5$ or $25=(-5)\times (-5)$. In the second example, we have multiplied the factors by $-1$ (which is invertible), but we do not consider it to be inherently different from the first. So in this case, $1-i$ only differs from $1+i$ by multiplying by the unit $i$, which is no difference at all, as far as unique factorisation goes.

So to address original question, throwing in $i$ is analogous to repeatedly multiplying by $-1$ with the usual integer factorisation. If it bothers you, you may let one of the terms absorb it.

4. ## Re: gaussian prime factorisation

I'm making stuff up again?! Only explanation I could think of for the question presented. It's -i, anyway. Wow. Taking a break...

5. ## Re: gaussian prime factorisation

No worries! Mistakes happen.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 12, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://mathhelpforum.com/number-theory/189534-gaussian-prime-factorisation.html", "fetch_time": 1481467490000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2016-50/segments/1480698544679.86/warc/CC-MAIN-20161202170904-00143-ip-10-31-129-80.ec2.internal.warc.gz", "warc_record_offset": 170619933, "warc_record_length": 11064, "token_count": 491, "char_count": 1800, "score": 3.875, "int_score": 4, "crawl": "CC-MAIN-2016-50", "snapshot_type": "longest", "language": "en", "language_score": 0.917549729347229, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00000-of-00064.parquet"}