mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2017-02-23, 04:51   #12
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
AFAIK, the question of whether a given (monic, irreducible) polynomial in Z[x] without any intrinsic prime factors even assumes infinitely many prime values is unanswered for any polynomial of degree greater than 1.
I also think that's unanswered. This Green-Tao paper
https://arxiv.org/abs/math/0606088
I think is more-or-less state of the art in that area, even though it predates Zhang's theorem.
CRGreathouse is offline   Reply With Quote
Old 2017-02-23, 05:28   #13
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

1000000011112 Posts
Default

Unless I am missing something, any factorial can be written as high degree polynomial, n(n+1)(n+2),...
So unless there is a finite number of primes of the form n!(+-)p for p>n,
then there has to be unlimited primes of polynomial form of degrees higher than 1.

ETA I know I have to be misunderstanding what is being stated.

Last fiddled with by a1call on 2017-02-23 at 05:31
a1call is offline   Reply With Quote
Old 2017-02-23, 07:36   #14
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22·1,217 Posts
Default

Quote:
Originally Posted by a1call View Post
Unless I am missing something, any factorial can be written as high degree polynomial, n(n+1)(n+2),...
So unless there is a finite number of primes of the form n!(+-)p for p>n,
then there has to be unlimited primes of polynomial form of degrees higher than 1.

ETA I know I have to be misunderstanding what is being stated.
What does ETA stand for when you use it like this?

The statement is that ONE polynomial produces an infinite number of primes (over the domain of input numbers n). You're finding a different poly for each prime of some form, without considering what other primes that poly would produce.
VBCurtis is offline   Reply With Quote
Old 2017-02-23, 11:12   #15
axn
 
axn's Avatar
 
Jun 2003

13DA16 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
What does ETA stand for when you use it like this?
Edited to add
axn is offline   Reply With Quote
Old 2017-02-23, 15:41   #16
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2×47×101 Posts
Default

"P.S." is a more common way to say the same ("an afterthought").
Batalov is offline   Reply With Quote
Old 2017-02-26, 21:00   #17
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

32116 Posts
Default

Don't forget that, except for 2 ,, and 3, all prime numbers have the form 6n plus or
Onus one

Regards
Matt
MattcAnderson is offline   Reply With Quote
Old 2017-02-26, 22:01   #18
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts
Default

all primes p are p-1 rough numbers.
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Smallest prime of the form a^2^m + b^2^m, m>=14 JeppeSN Math 114 2018-12-16 01:57
Probability that N is prime given each divisor of N has the form 2*k*p+1 carpetpool Miscellaneous Math 6 2017-09-01 13:59
Is there a prime of the form...... PawnProver44 Miscellaneous Math 9 2016-03-19 22:11
Code for testing a prime other than form 2^n-1 MercPrime Information & Answers 5 2013-05-12 22:03
least common multiple of numbers of the form a^x-1 juergen Math 2 2004-04-17 12:19

All times are UTC. The time now is 01:11.


Mon Aug 2 01:11:07 UTC 2021 up 9 days, 19:40, 0 users, load averages: 1.50, 1.25, 1.17

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.