Recent content by Nelphine

You actually seem to have it spot on - I'm really just wildly flailing and hoping someone has thought of something I haven't, because otherwise this particular theory of mine will probably not be fruitful. I'm really trying to figure out how to find properties of a sequence before it gets...

hum. that would actually be too imprecise. although it's obviously what I asked for, it's also unfortunately not at all what I want. So. I want to find.. every n value where all numbers in the sequence past the nth term will be closer to the limit than the nth term. The x value I used in my...

Hello! Unfortunately, I have not spent as much time as I should have on limits, or sequences, or their properties. In trying to work on a number theory math proof I have come across the following: I have an infinite sequence of numbers, all between 0 and 1 inclusive. I know that the limit of...

RamaWolf, I wouldn`t be surprised if that class was infinite. However, that`s exactly what I don`t want. What I`m looking for is to show that the class of classes [a,2] where a > 8 is infinite.

No, what I'm asking is: Assuming there are an infinite number of Twin Primes, how reasonable is it to assume that NOT all twin primes will be preceded by a twin prime that is less than 10 difference. So if I assume that p(k) and p(k+1)=p(k)+2 are a pair of twin primes, I want p(k-1)<=...

If we assume that the Twin Prime Conjecture is true (and thus there are infinite number of primes that are 2 apart), how reasonable is it to assume that there will be an infinite number of Twin Primes that are preceded by a prime that is at least 10 lower than the first of the Twin Primes? (I...

Another thing that has been pointed out to me that is wrong with that formula: I forgot to include a set of brackets containing [2^i *floor[m/ product ( from L = j to k, p(L) )] +n(i,j)], as both of those terms should be affected by the (-1)^i

My attempt at a proper formula, although I know it's not quite right: given k, let m = [p(k)^2 - p(k)]/6, where p(k) = the kth prime number, then: f(k) = m + sum [ from i = 1 to k, sum ( from j = 3 to k, (-1)^i * 2^i *floor[m/ product ( from L = j to k, p(L) )] +n(i,j) ) ] where n(i,j) is an...

Actually just trying to help me explain the equations f(x) in such a simple manner will be very helpful. I have 4 comments with your current suggestion, the first 3 of which are very simple (and possibly clerical). Comment 1: "f(x) = y - ... Floor[y/...", these instances of y should be...

Fair enough; I actually posted this to a few forums, and since I wasn't getting a response here, I've been concentrating on the other ones. But what I've certainly learned is that my initial description is AWFUL and misleading, for which I apologize. I still haven't managed to completely...

Hello all! I realize I am new to the community of online math forums, so I'm probably breaking a few etiquette rules (and possibly more important rules too - if so, please let me know and I'll fix what I can.) However, I am working on a math problem, and I am stuck on bounding a particular...