Ranter
Join devRant
Do all the things like
++ or  rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power realtime personalized recommendations and activity feeds using a simple API
Learn More
Comments

FastNop40213192dThe mistake is that while the density decreases, the inspected number range increases with N. So you have a situation of two limits working against each other in 0*infinite style, and you can't just look at the 0 and conclude the product must be zero.

Wisecrack7299192d@FastNop always up for a correction for my half baked maths. Thanks man.
Is it still true that that the fibonacci prime density would be a lower bound on the sensory of primes in general then? 
chonkyquiche2613192dYeah the density of the subset of prime numbers compared to natural numbers approaches 0 but doesn’t equal zero. I don’t think this will prove that the subset of Fibonacci primes is finite though. This article seems cool: https://vixra.org/pdf/...

FastNop40213192d@Wisecrack Since fib primes are a subset of all primes, the number and hence density of fib primes is a lower bound for all primes, yes.

dev0x0122192d@FastNop sometimes we all need reminding that you can’t just assume 0*inf = 0. Thanks sir.

AleCx0428092191d@stackodev Mathematical discussions as a whole would normally have a "conclussion" at the end of the post, essay, book etc. In this case, the conclussion is that prime numbers are infinite(this is a fact as far as we know) then fibonacci PRIME numbers must be finite. At this point we would just look at what a prime number is vs a fibonacci number and then we would better understand what a fibonacci prime is. Once the jargon is taken out of the equation we can look at the general idea that @Wisecrack posted to prove or what hinted at his/her idea of the posting originally.
We then try and make sense of it only to realize that @FastNop said.
But yeah man, when you don't understand something in math, read it slow and look at the jargon definitions. It is not much different than programming, and imho way more fun sometimes. 
AleCx0428092191dI see a Math post and I know two things: 1) it was you who posted it, and 2) I am about to go on a brain bender.

AleCx0428092191d@FastNop you said it brother. And the realization that we cannot assume that 0*inf = 0 was both brilliant and the key.
I raise my glass to you my good sir. This is why peer review is a thing in the real world and academia.
A tu salud! 
Wisecrack729927d@AleCx04 "And the realization that we cannot assume that 0*inf = 0 was both brilliant and the key."
Looking back I've come to appreciate this post a lot more. I considered it good back then but in retrospect it was genuinely brilliant because typically 0*inf IS undefined under normal circumstances.
Related Rants
Maybe I'm severely misunderstanding set theory. Hear me out though.
Let f equal the set of all fibonacci numbers, and p equal the set of all primes.
If the density of primes is a function of the number of *multiples* of all primes under n,
then the *number of primes* or density should shrink as n increases, at an ever increasing rate
greater than the density of the number of fibonacci numbers below n.
That means as n grows, the relative density of f to p should grow as well.
At sufficiently large n, the density of p is zero (prime number theorem), not just absolutely, but relative to f as well. The density of f is therefore an upper limit of the density of p.
And the density of p given some sufficiently large n, is therefore also a lower limit on the density of f.
And that therefore the density of p must also be the upper limit on the density of the subset of primes that are Fibonacci numbers.
WHICH MEANS at sufficiently large values of n, there are either NO Fibonacci primes (the functions diverge), and therefore the set of Fibonacci primes is *finite*, OR the density of primes given n in the prime number theorem
*never* truly reaches zero, meaning the primes are in fact infinite.
Proving the Fibonacci primes are infinite, therefore would prove that the prime number line ends (fat chance). While proving the primes are infinite, proves the Fibonacci primes are finite in quantity.
And because the number of primes has been proven time and again to be infinite, as far back as 300BC,the Fibonacci primes MUST be finite.
QED.
If I've made a mistake, I'd like to know.
random
primes
math
fibonacci