# Prime factorization theory

Firstly, let me divulge. I've been doing a lot of research on the summation of two coprime numbers and unfortunately have failed to come up with the properties I'm seeking; it is my hope that someone here might be of some help.

Let $(j, k)\in \mathbb{N}^2$ be coprime.

Can $\Omega(j + k)$ or $\omega(j + k)$ be expressed as some function of $\omega(j)$, $\omega(k)$, $\lambda(j)$, $\lambda(k)$, $j$, and/or $k$?

If not, then maybe for the special case that $(j, k)$ are prime, or in particular, odd primes?

If the answer is still no, any information regarding this topic is much appreciated.

Note: The functions $\Omega$, $\omega$, and $\lambda$, are the total prime factors, distinct prime factors, and the Liouville function respectively.

-
Seems hard to get such a function since there are many coprime pairs with the same sum. For example (1, 2n) and (n, n+1). – Tony Huynh Nov 27 '10 at 12:31

Obviously, $\Omega(j+k)$ is a function in $j$ and $k$, certainly it would be difficult to write it in a closed form other than $\Omega(j+k)$. Similar for $\omega(j+k)$. On the other hand neither of them can be a function in $\omega(j)$, $\omega(k)$, $\lambda(j)$, $\lambda(k)$ and $j$ only. For instance they take the same values for $(j,k)=(1,2)$ as for $(j,k)=(1,5)$, but $\omega(3)=\Omega(3)=1\neq \omega(6)=\Omega(6)=2$.

-

Suppose $p,q$ are prime. Thus $\omega,\Omega,\lambda$ are known constants at $p,q$ so we want to know if $\omega,\Omega(p+q)$ can be written as functions in $p,q$. To answer this you need to define what is meant by a function, as clearly $\omega(p+q)$ is a function in $p,q$.

Presumably you mean a function which is built from some class of elementary functions. Therefore, a possible approach would be to try and prove that certain classes of functions are not sufficient. For example, we cannot have $\omega(p+q)=Ap+Bq+C$, for constants $A,B,C$, as we can pick suitable combinations of primes to give a system of linear equations in $a,B,C$ with no solutions, (I haven't actually done this computation). It seems reasonable that for any degree $d$ we can find suitable pairs of primes to show that the function isn't a polynomial with degree $\leq d$, but I don't have a proof of this. Thus showing that the function isn't a polynomial might be a worthwhile first It will probably help to use that the function is symmetric in $p,q$ so if its a polynomial then its a polynomial in $p+q,pq$.

Once polynomials are dealt with, then try and extend the class of possible functions to something bigger.

-
Thanks for the advice, but I have a followup question. I already assumed that if the function existed, that it couldn't be polynomial, let alone linear; what types of functions would this most likely fit under, given that it exists? – J Hato Nov 30 '10 at 5:30
Try a simple example - say, compute $\Omega(p+2)$ for all primes $p$ up to 1000. Then ask yourself what the chances are that there is some useful formula for the resulting sequence. – Gerry Myerson Mar 1 '11 at 11:59
{"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": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "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://mathoverflow.net/questions/47495/prime-factorization-theory/47548", "fetch_time": 1466831333000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2016-26/segments/1466783392099.27/warc/CC-MAIN-20160624154952-00181-ip-10-164-35-72.ec2.internal.warc.gz", "warc_record_offset": 196001858, "warc_record_length": 15668, "token_count": 808, "char_count": 3045, "score": 3.84375, "int_score": 4, "crawl": "CC-MAIN-2016-26", "snapshot_type": "latest", "language": "en", "language_score": 0.9025906920433044, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00016-of-00064.parquet"}