A prime limit that seems to approach a constant

robnybod
Messages
3
Reaction score
0
Ok here's the problem:
29288yd.png

Using wolfram the first 100 results are these
heres a plot of a couple points
As you can see it doesn't seem to be approaching exactly zero, even though its very similar to 1/x (exactly the same if you replace Pn with just n)
Is there any way to prove whether this does approach 0 or some constant, or is it possible to make a program to approximate it to some extremely large n, to see if its approaching zero or some constant.

Thanks in advance, and sorry if the answer is obvious
 
Physics news on Phys.org
welcome to pf!

hi robnybod! welcome to pf! :wink:

it's decreasing and positive, so it must have a limit

to find the limit, use the usual trick of putting fn = fn-1 :smile:
 
Thank you!
so according to that it would go to zero, correct? because than f=f(1-1/P(n)) and f goes away, so you're left with -1/P(infinity)=0, which checks
 
robnybod said:
so according to that it would go to zero, correct?

correct! :smile:

(the reaoning isn't rigorous, but the result is ok)
 
Good morning,

Your infinite product ∏(1-pi-1), over all primes, does indeed converge to zero, but no fn=fn-1 trick is close to showing why.

The standard elementary proof here is to rewrite your limit as (Ʃ1/n)-1 over the positive integers realizing that your limit is an euler product (google, wiki).

Note btw that if you add an exponent s to all your primes, your limit equals ζ(s)-1, where ζ(s) is the Riemann zeta function, known to converge for all s>1 (and giving you non-zero limit in this case).
 
Another proof would be to think of function fk as being the probability to pick a natural number that has a factor among all the prime numbers except the first k prime numbers.

f0 = 1, the probability to pick a number that has a factor among all primes is 1
f1 = f0 - f0/p1, the probability to pick a number that has a factor among all prime numbers except the first prime is 1/2

at infinity this translates into

lim _{n->\infty}fn = 0 because f\infty is the same as asking what is the probability to pick a natural number that doesn't have a factor among all the prime numbers. Of course all natural numbers have a prime factor or are prime numbers therefore the answer is 0.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top