My Math Forum  

Go Back   My Math Forum > College Math Forum > Number Theory

Number Theory Number Theory Math Forum


Reply
 
LinkBack Thread Tools Display Modes
February 26th, 2009, 05:53 PM   #1
Senior Member
 
Joined: Nov 2007

Posts: 258
Thanks: 0

Yet (another) conjecture

I conjecture that, given a polynomial , irreducible over Z and having coprime coefficients, then there are infinitely many primes of the form . This is an obvious generalization of Dirichlet's theorem on arithmetic progression, and also includes other conjectures concerning primes (such as "there are infinitely many primes of the form ").

Is there any evidence that this conjecture might hold? I'd be willing to bet $10 it's true.
I know there might not be much interest in such general statements but sometimes the general case is easier to prove than a perticular case (such as ).
brunojo is offline  
 
February 26th, 2009, 06:39 PM   #2
Global Moderator
 
CRGreathouse's Avatar
 
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 933

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Re: Yet (another) conjecture

Good conjecture, but Hardy & Littlewood beat you to it by 86 years. It's still open.
CRGreathouse is offline  
February 26th, 2009, 07:04 PM   #3
Senior Member
 
Joined: Nov 2007

Posts: 258
Thanks: 0

Re: Yet (another) conjecture

Quote:
Originally Posted by CRGreathouse
Good conjecture, but Hardy & Littlewood beat you to it by 86 years. It's still open.
Oops! Oh well; great minds think alike... or so I wish!

I'll raise it to $100 then.
Does there appear to be a good approximation of the density of the primes of a given polynomial form? (Such as 1 /(phi(b) log n) for the progression a+bk, if I'm not mistaken).
brunojo is offline  
February 27th, 2009, 02:56 AM   #4
Senior Member
 
Joined: Sep 2008

Posts: 150
Thanks: 5

Re: Yet (another) conjecture

Quote:
I'll raise it to $100 then.
Be sure to get your assumptions right before placing your bet!

Your polynomial has to be irreducible in the ring of numerical polynomials, that is polynomials with rational coefficients that take only integer values on the integers. Of course this ring contains , but it is bigger.

With your assumption it is not difficult to construct counterexamples: The values of are all divisible by 2 likewise the values of are all divisible by 3.
Peter is offline  
February 27th, 2009, 06:27 AM   #5
Global Moderator
 
CRGreathouse's Avatar
 
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 933

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Re: Yet (another) conjecture

Quote:
Originally Posted by brunojoyal
Does there appear to be a good approximation of the density of the primes of a given polynomial form? (Such as 1 /(phi(b) log n) for the progression a+bk, if I'm not mistaken).
Yes, Hardy & Littlewood include in their conjecture the expected density. I'll try to reproduce it below, but don't trust that I've copied it properly.

Let with The density is

where e is 1/2 when a + b is odd and 1 when a + b is even, Li is the logarithmic integral, and

where the products run over odd primes p and is the Legendre symbol.
CRGreathouse is offline  
Reply

  My Math Forum > College Math Forum > Number Theory

Tags
conjecture



Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
Beal's Conjecture Conjecture MrAwojobi Number Theory 66 June 2nd, 2014 07:59 AM
Conjecture on cycle length and primes : prime abc conjecture miket Number Theory 5 May 15th, 2013 05:35 PM
Enchev's conjecture - Goldbach's conjecture for twin pairs enchev_eg Number Theory 30 September 28th, 2010 08:43 PM
Conjecture greg1313 Algebra 10 December 20th, 2008 02:52 PM
Conjecture 2^(2k+1) momo Number Theory 1 September 7th, 2008 04:21 PM





Copyright © 2017 My Math Forum. All rights reserved.