Kut RapidShare met hun kut downloadlimiet + onleesbare codes

quote:

Op maandag 5 mei 2008 23:18 schreef Maartel het volgende:
Máár googlen op rapidshare plus namen van een aantal tracks is wel dé manier om snel een album te vinden

quote:

Op maandag 5 mei 2008 23:09 schreef donroyco het volgende:
Rapidshare..

quote:

Op maandag 5 mei 2008 22:44 schreef Marurk het volgende:
Godver wat een paupersite is dat geworden zeg met hun kut onleesbare codes. Krijg je een of andere onleesbare code met diertjes er doorheen : "Typ de letters uit de security code met de katjes." Ik dit natuurlijk fout doen (jah, TS kan er neit mee omgaan ) en nu krijg ik gvd steeds zo'n kutmelding van "You have entered too many wrong codes.". Ik honderd keer geprobeerd maar ik blijf hetzelfde krijgen.
En nu krijg ik steeds de melding: "You have reached the download-limit for free-users."

quote:

Op dinsdag 6 mei 2008 11:16 schreef FastFox91 het volgende:
@Repeat
Torrents moet je ook nog bij uploaden en gaat niet altijd even snel. Als je van andere verwacht om met usenet te gaan verwerken vind ik dat nog ergere terreur. Als je het eenmaal kan is het een eitje, maar als newbie is rapidshare toch echt wel makkelijker.

quote:

Op dinsdag 6 mei 2008 11:19 schreef Repeat het volgende:
En als je usenet niet snapt geen zin hebt om te wachten of geen codes kan typen moet je je shit maar gewoon in de winkel kopen.

quote:

Op dinsdag 6 mei 2008 11:25 schreef BobbyB het volgende:

[..]

quote:

Op dinsdag 6 mei 2008 11:33 schreef Repeat het volgende:

[..]

Nee, want voor dat schijtrapidshare zijn veel betere alternatieven.

quote:

Op dinsdag 6 mei 2008 12:13 schreef star_gazer het volgende:
Op rapidshare staat wel veel pr0n

quote:

Op dinsdag 6 mei 2008 12:20 schreef jimjim1983 het volgende:

[..]

overal op t internet staat veel porno

quote:

Op maandag 5 mei 2008 22:51 schreef zarGon het volgende:
http://skydrive.live.com.

quote:

Riemann hypothesis
From Wikipedia, the free encyclopedia
• Learn more about citing Wikipedia •Jump to: navigation, search
There is also the Riemann hypothesis for curves over finite fields.

The real part (red) and imaginary part (blue) of the Riemann zeta-function along the critical line Re(s) = 1/2. You can see the first non-trivial zeros at Im(s) = ±14.135, ±21.022 and ±25.011.
This shows the values of ζ(1/2+it) in the complex plane for 0 ≤ t ≤ 34. (For t=0, ζ(1/2) ≈ -1.460 corresponds to the leftmost point of the red curve.)The Riemann hypothesis (also called the Riemann zeta-hypothesis), first formulated by Bernhard Riemann in 1859, is one of the most famous and important unsolved problems in mathematics. It has been an open question for almost 150 years, despite attracting concentrated efforts from many outstanding mathematicians. Unlike some other celebrated problems, it is more attractive to professionals in the field than to amateurs.

The Riemann hypothesis (RH) is a conjecture about the distribution of the zeros of the Riemann zeta-function ζ(s). The Riemann zeta-function is defined for all complex numbers s ≠ 1. It has zeros at the negative even integers (i.e. at s = −2, s = −4, s = −6, ...). These are called the trivial zeros. The Riemann hypothesis is concerned with the non-trivial zeros, and states that:

The real part of any non-trivial zero of the Riemann zeta function is ½.
Thus the non-trivial zeros should lie on the so-called critical line, ½ + it, where t is a real number and i is the imaginary unit. The Riemann zeta-function along the critical line is sometimes studied in terms of the Z-function, whose real zeros correspond to the zeros of the zeta-function on the critical line.

The Riemann hypothesis is one of the most important open problems of contemporary mathematics, mainly because a large number of deep and important other results have been proven under the condition that it holds. Most mathematicians believe the Riemann hypothesis to be true.[1] A $1,000,000 prize has been offered by the Clay Mathematics Institute for the first correct proof.[2]

Millennium Prize Problems
P versus NP
The Hodge conjecture
The Poincaré conjecture
The Riemann hypothesis
Yang–Mills existence and mass gap
Navier-Stokes existence and smoothness
The Birch and Swinnerton-Dyer conjecture
Contents [hide]
1 History
2 The Riemann hypothesis and primes
3 Consequences and equivalent formulations of the Riemann hypothesis
3.1 Growth rate of Möbius function
3.2 Growth rates of multiplicative functions
3.3 Riesz criterion, binomial sums
3.4 Weil's criterion, Li's criterion
3.5 Relation to Farey sequence
3.6 Relation to group theory
3.7 Critical line theorem
4 Disproven conjectures
5 Weaker conjectures
5.1 Lindelöf hypothesis
5.2 Large prime gap conjecture
6 Attempted proofs of the Riemann hypothesis
7 Possible connection with operator theory
8 Searching for ζ-function zeroes
9 References
9.1 Historical references
9.2 Modern technical references
9.3 Popular References
9.4 Cited References



[edit] History
Unsolved problems in mathematics: Does every non-trivial zero of the Riemann zeta function have real part ½?Riemann mentioned the conjecture that became known as the Riemann hypothesis in his 1859 paper On the Number of Primes Less Than a Given Magnitude, but as it was not essential to his central purpose in that paper, he did not attempt a proof. Riemann knew that the non-trivial zeros of the zeta-function were symmetrically distributed about the line s = ½ + it, and he knew that all of its non-trivial zeros must lie in the range 0 ≤ Re(s) ≤ 1.

In 1896, Hadamard and de la Vallée-Poussin independently proved that no zeros could lie on the line Re(s) = 1. Together with the other properties of non-trivial zeros proved by Riemann, this showed that all non-trivial zeros must lie in the interior of the critical strip 0 < Re(s) < 1. This was a key step in the first complete proofs of the prime number theorem.

In 1900, Hilbert included the Riemann hypothesis in his famous list of 23 unsolved problems — it is part of Problem 8 in Hilbert's list, along with the Goldbach conjecture. When asked what he would do if awakened after having slept for five hundred years, Hilbert famously said his first question would be whether the Riemann hypothesis had been proven (Derbyshire 2003:197; Sabbagh 2003:69; Bollobas 1986:16). The Riemann Hypothesis is the only one of Hilbert's problems on the Clay Mathematics Institute Millennium Prize Problems.

In 1914, Hardy proved that an infinite number of zeros lie on the critical line Re(s) = ½. However, it was still possible that an infinite number (and possibly the majority) of non-trivial zeros could lie elsewhere in the critical strip. Later work by Hardy and Littlewood in 1921 and by Selberg in 1942 gave estimates for the average density of zeros on the critical line.

Recent work has focused on the explicit calculation of the locations of large numbers of zeros (in the hope of finding a counterexample) and placing upper bounds on the proportion of zeros that can lie away from the critical line (in the hope of reducing this to zero).

The fractal structure of the Riemann zeta zeros has been studied using Rescaled Range Analysis.[3] The self-similarity of the zero distributions is quite remarkable, and is characterized by a large fractal dimension of 1.9.


[edit] The Riemann hypothesis and primes
The traditional formulation of the Riemann hypothesis obscures somewhat the true importance of the conjecture. The zeta-function has a deep connection to the distribution of prime numbers. Helge von Koch proved in 1901 that the Riemann hypothesis is equivalent to the following considerable strengthening of the prime number theorem: for every ε > 0, we have


where π(x) is the prime-counting function, ln(x) is the natural logarithm of x, and the Landau notation is used on the right-hand side.[4] A non-asymptotic version, due to Lowell Schoenfeld, says that the Riemann hypothesis is equivalent to


The zeros of the Riemann zeta-function and the prime numbers satisfy a certain duality property, known as the explicit formulae, which shows that in the language of Fourier analysis the zeros of the Riemann zeta-function can be regarded as the harmonic frequencies in the distribution of primes.

The Riemann hypothesis can be generalized by replacing the Riemann zeta-function by the formally similar, but much more general, global L-functions. In this broader setting, one expects the non-trivial zeros of the global L-functions to have real part 1/2, and this is called the generalized Riemann hypothesis (GRH). It is this conjecture, rather than the classical Riemann hypothesis only for the single Riemann zeta-function, which accounts for the true importance of the Riemann hypothesis in mathematics. In other words, the importance of 'the Riemann hypothesis' in mathematics today really stems from the importance of the generalized Riemann hypothesis, but it is simpler to refer to the Riemann hypothesis only in its original special case when describing the problem to people outside of mathematics.[citation needed]

For many global L-functions of function fields (but not number fields), the Riemann hypothesis has been proven. For instance, the fact that the Gauss sum, of the quadratic character of a finite field of size q (with q odd), has absolute value

√q
is actually an instance of the Riemann hypothesis in the function field setting.


[edit] Consequences and equivalent formulations of the Riemann hypothesis
The practical uses of the Riemann hypothesis include many propositions which are stated to be true under the Riemann hypothesis, and some which can be shown to be equivalent to the Riemann hypothesis. One is the rate of growth in the error term of the prime number theorem given above.


[edit] Growth rate of Möbius function
One formulation involves the Möbius function μ. The statement that the equation


is valid for every s with real part greater than ½, with the sum on the right hand side converging, is equivalent to the Riemann hypothesis. From this we can also conclude that if the Mertens function is defined by


then the claim that


for every,


is equivalent to the Riemann hypothesis. This puts a rather tight bound on the growth of M, since even with no hypothesis we can conclude


(For the meaning of these symbols, see Big O notation.)


[edit] Growth rates of multiplicative functions
The Riemann hypothesis is equivalent to certain conjectures about the rate of growth of other multiplicative functions aside from μ(n). For instance, if σ(n) is the divisor function, given by


then


for n > 5040. This is known as Robin's theorem and was given by Guy Robin in 1984. A related bound was given by Jeffrey Lagarias in 2002, who proved that the Riemann hypothesis is equivalent to the statement that


for every natural number n, where Hn is the n-th harmonic number.


[edit] Riesz criterion, binomial sums
The Riesz criterion was given by Marcel Riesz in 1916, to the effect that the relation


holds for all ε > 0 if and only if RH holds.[5]

Later (1918) Hardy provided an integral equation for

using a variant of Borel resummation with Mellin transform
Other functions related to the multiplicative functions have growth rates equivalent to the Riemann hypothesis as well.

There are several relations on binomial sums that are equivalent to RH. For example, let


Báez-Duarte[6][7] and Flajolet and Vallée[8] have shown that RH holds if and only if


for all ε > 0. Similarly, let


then Flajolet and Vepstas show[9] that RH holds if and only if

| dn | < Cεn1 / 2 + ε
for all ε > 0 and some constant Cε depending on ε. Entering into the proof is the Mobius function μ(n), and so similar results hold for binomial sums over ζ(s − 1) / ζ(s), and so on, which correspond to Dirichlet series for Euler's totient function, the divisor function, and so on.


[edit] Weil's criterion, Li's criterion
Weil's criterion is the statement that the positivity of a certain function is equivalent to the Riemann hypothesis. Related is Li's criterion, a statement that the positivity of a certain sequence of numbers is equivalent to the Riemann hypothesis.


[edit] Relation to Farey sequence
Two other equivalent statements to the Riemann hypothesis involve the Farey sequence. If Fn is the Farey sequence of order n, beginning with 1/n and up to 1/1, then the claim that for all e > ½


is equivalent to the Riemann hypothesis. Here is the number of terms in the Farey sequence of order n. Similarly equivalent to the Riemann hypothesis is


for all e > −1.


[edit] Relation to group theory
The Riemann hypothesis is equivalent to certain conjectures of group theory. For instance, if g(n) is the maximal order of elements of the symmetric group Sn of degree n, known as Landau's function, then the Riemann hypothesis is equivalent to the bound, for all n greater than some M, of

[citation needed]

[edit] Critical line theorem
The Riemann hypothesis is equivalent to the statement that ζ'(s), the derivative of ζ(s), has no zeros in the strip

.
That ζ has only simple zeros on the critical line is equivalent to its derivative having no zeros on the critical line, so under the usual hypotheses on the Riemann zeta-function we can extend the zero-free region to . This approach has been fruitful; refining it allowed Norman Levinson to prove his strengthening of the critical line theorem.


[edit] Disproven conjectures
Stronger conjectures than the Riemann hypothesis have also been formulated, but they have a tendency to be disproven. Paul Turan showed that if the sums


have no zeros when the real part of s is greater than one then the Riemann hypothesis is true, but Hugh Montgomery showed the premise is false. Another stronger conjecture, the Mertens conjecture, has also been disproven.


[edit] Weaker conjectures

[edit] Lindelöf hypothesis
The Riemann hypothesis has various weaker consequences as well; one is the Lindelöf hypothesis on the rate of growth of the zeta function on the critical line, which says that, for any e > 0,


as t tends to infinity.

Denoting by pn the n-th prime number, a result by Albert Ingham, shows that the Lindelöf hypothesis implies that, for any e > 0,

pn+1 - pn < p1/2+e,
if n is sufficiently large. However, this result is worse than that of the large prime gap conjecture, stated below.


[edit] Large prime gap conjecture
Another conjecture is the large prime gap conjecture. Cramér proved that, assuming the Riemann hypothesis, the gap between the prime p and its successor is . On average, the gap is merely and numerical evidence does not suggest it can grow nearly as fast as the Riemann hypothesis seems to allow, much less as fast as the best that can at present be shown without it.


[edit] Attempted proofs of the Riemann hypothesis
Several teams of mathematicians have addressed the Riemann hypothesis over decades, and a few purported proofs go unverified as of 2007. However, these have been received with skepticism by the mathematical community, and professionals at large do not believe them to be true.[citation needed] Matthew R. Watkins from the University of Exeter has a compilation of such claims (serious and ludicrous alike),[10] and a few others may be found in the arXiv database.


[edit] Possible connection with operator theory
Main article: Hilbert–Pólya conjecture
It has long been speculated that the correct way to derive the Riemann hypothesis has been to find a self-adjoint operator, from the existence of which the statement on the real parts of the zeroes of ζ(s) would follow when one applies the criterion on real eigenvalues. This has led to many investigations, but has not yet proven fruitful.

The distribution of the zeros of the Riemann zeta function shares some statistical properties with the eigenvalues of random matrices drawn from the Gaussian unitary ensemble. This gives some support to the Hilbert–Pólya conjecture.

In 1999, Michael Berry and Jon Keating conjectured that there is some unknown quantization of the classical Hamiltonian H = xp so that


and even more strongly, that the Riemann zeros coincide with the spectrum of the operator . This is to be contrasted to canonical quantization which leads to the Heisenberg uncertainty principle [x,p] = 1 / 2 and the natural numbers as spectrum of the quantum harmonic oscillator. The crucial point is that the Hamiltonian should be a Hermitian operator (or more precisely closed self adjoint operator) so that the quantisation would be a realisation of the Hilbert–Pólya program.


[edit] Searching for ζ-function zeroes

Absolute value of the ζ-functionThere is a long history of computational attempts to explore as many zeroes of the ζ-function as possible. One notable such attempt was ZetaGrid, a distributed computing project, which checked over a billion zeros a day when it was running. The project was shut down in November 2005. As of 2006, no computational project has succeeded in finding a counterexample to the Riemann hypothesis.

In 2004, Xavier Gourdon and Patrick Demichel verified the Riemann hypothesis through the first ten trillion non-trivial zeros using the Odlyzko-Schönhage algorithm.

Michael Rubinstein has made public an algorithm for generating the zeros.

quote:

Op woensdag 7 mei 2008 01:46 schreef Gloeidoos het volgende:
[ afbeelding ]

quote:

Op maandag 5 mei 2008 23:07 schreef Rhythm het volgende:
Helemaal eens!

Ik probeer net de beste liveset van Daft Punk ooit de downloaden, krijg ik eerst die tering kanker kut pauper katjes die ik 9(!) keer fout doe, en dan wil ik het 2e deel downloaden, mag ik 130 minuten wachten.

Lame.

quote:

Op maandag 5 mei 2008 22:51 schreef zarGon het volgende:
http://skydrive.live.com.

quote:

Op zondag 11 mei 2008 00:40 schreef Opa_vertelt het volgende:

[..]

1 woord:

USENET

quote:

Op zondag 11 mei 2008 19:51 schreef Repeat het volgende:
En kutter. Lekker een HD film van rapidshare halen. Moet je 500 linkjes aanklikken ofzo. En alleen paupers gebruiken het itt usenet ofzo waar de goeie releases staan.