On Landau's Fourth Problem

[Guest]

Are there infinitely many primes of the form, [tex](2n)^{2}+1[/tex], where n is a positive integer?

[Guest]

The answer for Landau's Fourth Problem is affirmative!

Here are two important hints for our proof:

1. The gap between two consecutive primes can be arbitrarily long.

2. The probability there is a negative answer for Landau's Fourth Problem when [tex]n \ge i[/tex] is

[tex]\prod_{n=i}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})}{(\pi(\sqrt{(2n)^2+1})+1)}= 0.[/tex]

[Guest]

The answer for Landau's Fourth Problem is affirmative!

Here are two important hints for our proof:

1. The gap between two consecutive primes can be arbitrarily long.

2. The probability there is a negative answer for Landau's Fourth Problem when [tex]n \ge i[/tex] is

[tex]\prod_{n=i}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})}{(\pi(\sqrt{(2n)^2+1})+1)}= 0.[/tex]

"Please observe [tex]\pi(x)[/tex] is the prime-counting function." -- Dave the antworker.

[Guest]

The answer for Landau's Fourth Problem is affirmative!

Here are two important hints for our proof:

1. The gap between two consecutive primes can be arbitrarily long.

2. The probability there is a negative answer for Landau's Fourth Problem when [tex]n \ge i[/tex] is

[tex]\prod_{n=i}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})}{\pi(\sqrt{(2n)^2+1})+1}= 0.[/tex]

"Please observe [tex]\pi(x)[/tex] is the prime-counting function." -- Dave the antworker.

We also observe that

[tex]k_{n }p_{n}[/tex] = [tex](2n)^{2}[/tex] + 1

where prime, [tex]p_{n}[/tex] is:
[tex]3 \le p_{n}\le\sqrt{k_{n}p_{n}} =\sqrt{(2n)^2+1}\le k_{n }.[/tex]

Note: [tex]k_{n }[/tex] = 1 is a violation.

Dave the antworker

[Guest]

The answer for Landau's Fourth Problem is affirmative!

Here are two important hints for our proof:

1. The gap between two consecutive primes can be arbitrarily long.

2. The probability there is a negative answer for Landau's Fourth Problem when [tex]n \ge i[/tex] is

[tex]\prod_{n=i}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})}{\pi(\sqrt{(2n)^2+1})+1}= 0.[/tex]

"Please observe [tex]\pi(x)[/tex] is the prime-counting function." -- Dave the antworker.

We also observe that

[tex]k_{n }p_{n}[/tex] = [tex](2n)^{2}[/tex] + 1

where prime, [tex]p_{n}[/tex] is:
[tex]3 \le p_{n}\le\sqrt{k_{n}p_{n}} =\sqrt{(2n)^2+1}\le k_{n }.[/tex]

Note: [tex]k_{n }[/tex] = 1 is a violation when [tex]n \ge i.[/tex]

Dave the antworker

[Guest]

The answer for Landau's Fourth Problem is affirmative!

Here are two important hints for our proof:

1. The gap between two consecutive primes can be arbitrarily long.

2. The probability there is a negative answer for Landau's Fourth Problem when [tex]n \ge i[/tex] is

[tex]\prod_{n=i}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})}{\pi(\sqrt{(2n)^2+1})+1}= 0.[/tex]


"Please observe [tex]\pi(x)[/tex] is the prime-counting function." -- Dave the antworker.

We also observe that

[tex]k_{n }p_{n}[/tex] = [tex](2n)^{2}[/tex] + 1

where prime, [tex]p_{n}[/tex] is:
[tex]3 \le p_{n}\le\sqrt{k_{n}p_{n}} =\sqrt{(2n)^2+1}\le k_{n }.[/tex]

Note: '[tex]p_{n }[/tex] = 1' and '[tex]k_{n }[/tex] is prime' are a violation when [tex]n \ge i.[/tex]

Dave the antworker

[Guest]

Final Observation: [tex]\pi(x)[/tex] is the odd prime-counting function since we do not count the even prime two.

[Guest]

Please compute:

[tex]\prod_{n=1000}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})}{\pi(\sqrt{(2n)^2+1})+1}[/tex]

[Guest]

Please compute:

Prob(1000: [tex]\infty[/tex])
= [tex]\prod_{n=1000}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})-1}{\pi(\sqrt{(2n)^2+1})}[/tex]

to account for prime two.

Prob(1000: 10,000) = .000138989;

Prob(1000: 11,000) = .0000909983;

Prob(1000: 12,000) = 0000616167;

Prob(1000: 13,000) = 0000429001;

Prob(1000: 14,000) = 0000305871;

Prob(1000: 15,000) = 0000222699;

Prob(1000: 16,000) = .0000165075;

...

Computational Tool Link:
[url]http://m.wolframalpha.com/input/?i=Prod ... qrt%28%282×i%29%5E2%2B1%29%29+-1.+%29%2FPi%28sqrt%28%282×i%29%5E2%2B1%29%29+from+i%3D1000+to+i%3D15000[/url]

Dave the antworker.

[Guest]

Please compute:

Prob([tex]10^{10^{10^{10000}}}[/tex]: [tex]\infty[/tex])

= [tex]\prod_{n=10^{10^{10^{10000}}}}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})-1}{\pi(\sqrt{(2n)^2+1})}[/tex]

to account for prime two.



Dave the antworker.

[Guest]

Please compute:

Prob([tex]10^{10^{10^{10000}}}[/tex]: [tex]\infty[/tex])

=

[tex]\prod_{n=10^{10^{10^{10000}}}}^{\infty}\frac{\pi(\sqrt{(2n)^2+1})-1}{\pi(\sqrt{(2n)^2+1})}[/tex]

to account for prime two.


Dave the antworker.

Two Hints:

1. Do not attempt to solve the problem by numerical calculation.

2. Please solve the problem by sound reasoning and by applying the great Prime Number Theorem.

[Guest]

Relevant Reference Link:

https://www.quora.com/For-what-value-of-n-one-can-begin-to-search-for-consecutive-primes-r-and-s-such-that-s-r-10-9

[Guest]

Please compute:

[tex]\prod_{m=1}^{\infty}(\sum_{n=1}^{10^{100000} }9×10^{-n})[/tex]

[Guest]

Please compute:

[tex]\prod_{m=1}^{\infty}(\sum_{n=1}^{10^{100000} }9×10^{-n})[/tex]

[Guest]

Please compute:

[tex]\prod_{m=1}^{\infty}(\sum_{n=1}^{10^{10^{10^{10^{100000}}}} }9×10^{-n})[/tex]

[Guest]

Relevant Reference Link:

[url]http://m.wolframalpha.com/input/?i=%28Sum+9×10.%5E%28-n%29+from+n%3D1+to+n%3D10%29%5E%2810%5E13%29[/url]

[Guest]

Relevant Reference Link:

[tex].9999999999^{10^{13}}[/tex] = 5.07550973604988 × [tex]10^{-435}[/tex]

http://m.wolframalpha.com/input/?i=%28Sum+9×10.%5E%28-n%29+from+n%3D1+to+n%3D10%29%5E%28
10%5E13%29

[sunonmyside]

Please can someone help me with the following question, I'm not sure how to work it out?

If the manufacturing lines are running for 9 hours a day, 7 days a week, which model brings in the highest revenue?


Computer Monitor Models

Model A B C D E
Time to manufacture (minutes): 15 minutes 18 13 20 17
% of monitors sold per total products: 75% 73 84 95 81
Cost per monitor ($): $175 188 145 198 170

Thank you.