Is there a probabilistic approach to number theory conjectures?

[arivero]

For instance, let's say that you want to study fermat x^n+y^n=z^n for n=3; do not mind that we already know the answer :-) We could consider the densities of exact cubes, d(n), and then to calculate joint probabilities for d(Z), d(X) and d(Y).

The mechanism can be applied, for instance, to decide where to look when doing computational searches. So, is there some branch of number theory studying such probabilistic approach for general conjectures?

 

[hamster143]

Don't know if it's worthy to be called a whole branch, but yes. For example, we don't have proof of Goldbach's hypothesis, but we have results regarding the probabilities to write any number as a sum of primes that strongly indicate that it's true. There are assorted results based on a so called Cramer's probabilistic model of primes.

 

[zetafunction]

probabilistic considerations are NOT VALID in math

for example , according to probabiltiy theory the MObius function is realted to a Random motion that may take both 1 and 0 with probability 1/2 so M(x) = o(x^{1/2+e}) for any positive 'e' number this is JUST Riemann Hypothesis

another curious alternative i proposed to evaluate ASYMPTOTIC sums over primes was the following

since the probability of a number being prime is about 1/logx then replacing the sum by a series and using this fact

\sum_{p\le T}f(p) \sim \int_{2}^{T}dx \frac{f(x)}{logx}

for an smooth f(x)

 

[statdad]

"probabilistic considerations are NOT VALID in math"

hyperbole not supported by history.
To the OP

Look at some of the work of Paul Erdos, Marc Kac, and Aurel Winter (from the 30s or 40s, I can't remember at the moment). For a more recent reference, "Introduction to Analytic and Probabilistic Number Theory" by G. Tenenbaum.

 

[CRGreathouse]

The Erdos-Kac theorem is well-known, but what did Winter show? A different version of the same, or something else entirely?

(I'm having trouble finding anything. Google and mathscinet failed me.)

 

[statdad]

Sorry - spelling error generated by poor coordination today. Wintner is the last name. They did some work on additive functions and their asymptotic distributions, and there is, I believe, an Erdos-Wintner theorem in this area as well.

 

[CRGreathouse]

No problem. I've read^h^h^h^hskimmed some of Wintner's papers, but somehow the name didn't come to mind...

 

[Hurkyl]

^H! I haven't seen that in a while; strikeout seems to be [STRIKE]universal[/STRIKE] more common these days.

 

[hamster143]

according to probabiltiy theory the MObius function is realted to a Random motion that may take both 1 and 0 with probability 1/2

First of all, that's 1 and -1 with probability 3/\pi^2. Second of all, M(x) is only a random walk in the lowest approximation. If you do the computation more accurately, there's also a tendency to revert to the mean. If it were a random walk, we'd have a counterexample to Mertens conjecture long before 10^10^10.