and a sequence
such that is the nth prime. It can be shown that this recurrence relation generates all the prime numbers -- however, the complexity of this problem (as is often the case with prime-generating constants) is determining the value of to a sufficiently high degree of accuracy. The proof of this result uses Bertrand's postulate.Here, I've used to denote the floor of x (you can think of that as 'rounding down x to the nearest whole number') and to denote the fractional part of x. So in other words, we'd have and .The exact value of can be represented as an infinite sum:You need about 25 terms in the series above to get all the primes less than 100, for example.
]]>Are you ESL?
]]>Well I've been crunching numbers and I figured out a way to pull the pr do I have an answer for the primes problem now all you have to do is take the number 2520 and divided by any number that is two digit add another zero if you want to do three digits add another zero if you want to do for digits add another zero if you want to do 5 digits and if the denominator of the mixed fraction is the same as the number you divided into my special number then it is a prime bottom line I've tried every prime so far has worked example 25200/101=. 249 51/101. just ignore the rest of the number and noticed the denominator is 101 so therefore it must be prime and only then is it prime
This is an extremely confusing process. Please explain it more clearly.
]]>You need steps like
"Let N represent the number under test.
" Let D represent the dividend"
"Set D = 25200"
Calculate D/N.
Say what to do if (a) the answer is an integer; (b) how to extract the 'remainder' as a fraction.
"Test if the fraction is in its lowest terms."
The above is not a complete algorithm. I'm not sure exactly what steps you want to take for this to be successful. You need a very clear set of steps. If I cannot understand them, how will your computer program 'know' what to do at each step?
Bob
]]>B
]]>Test numbers:
(1) 73
(2) 77
(3) 91
(4) 143
Thanks,
Bob
]]>Well I've been crunching numbers and I figured out a way to pull the pr do I have an answer for the primes problem now all you have to do is take the number 2520 and divided by any number that is two digit add another zero if you want to do three digits add another zero if you want to do for digits add another zero if you want to do 5 digits and if the denominator of the mixed fraction is the same as the number you divided into my special number then it is a prime bottom line I've tried every prime so far has worked example 25200/101=. 249 51/101. just ignore the rest of the number and noticed the denominator is 101 so therefore it must be prime and only then is it prime
Prayer changes things and gives results
]]>