Is the Prime Numbers Function f(n) = 3^(n)+2 Always Prime?

In summary, the function f(n) = 3^(n)+2 will not give a prime number for any natural value of n. However, there exists a polynomial in 10 variables with integer coefficients such that the set of primes equals the set of positive values of this polynomial obtained as the variables run through all nonnegative integers.
  • #1
Anzas
87
0
is it true that this function:
f(n) = 3^(n)+2

will give a prime number for any natural value of n?
 
Physics news on Phys.org
  • #2
Nope, f(5) = 3^5 + 2 = 245 = 5 * 7^2.

Exercise: prove that f(n) assumes an infinite number of composite values.
 
Last edited:
  • #3
To the best of my knowledge, there is no known algebraic expression that generates primes.
 
  • #4
Well, you can get kind of close ;) http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html,

However, there exists a polynomial in 10 variables with integer coefficients such that the set of primes equals the set of positive values of this polynomial obtained as the variables run through all nonnegative integers, although it is really a set of Diophantine equations in disguise (Ribenboim 1991). Jones, Sato, Wada, and Wiens have also found a polynomial of degree 25 in 26 variables whose positive values are exactly the prime numbers (Flannery and Flannery 2000, p. 51).
 
  • #5
how about the function
f(n) = 3^(2n)+2

where n is a natural number
 
  • #6
No. Have you even tried looking for a counterexample? One exists in the really small natural numbers.
 
Last edited:
  • #7
in the examples cited from wolfram it sounds as if one may have no clue which inputs actually give primes (i.e. positive outputs) and which do not.
 
  • #8
It may sound that way since it is true.
 
  • #9
Anzas said:
how about the function
f(n) = 3^(2n)+2

where n is a natural number

You can keep trying but you won't find a prime number function this way.

I think the only known single-parameter function that generates primes is the one involving Mill's constant : f(n) = [M^3^n]
 
  • #10
what is mills constant? the 3^n th root of 3?

this does not sound promising Gokul. unless this "constant" is like my brother the engineers "fudge factor", i.e. the ratio between my answer and the right answer.

actually isn't it obvious no formula of this type, taking higher powers of the same thing, can ever give more than one prime?

or are you using brackets to mean something like the next smaller integer? even then I am highly skeptical. of course the rime number graph is convex, so has some sort of shape like an exponential, by the rpime number theorem, i guess, but what can you get out of that?

maybe asymptotically you might say something about a large number, unlikely even infinitely many, primes.

but i am a total novice here.
 
Last edited:
  • #12
oh great, so "mills constant" is not even known. so the formula [M^(3^n)]. is not actually an explicit formula at all.

in fact apparently mills constant is computed by computing the primes instead.
 

1. What is a prime number?

A prime number is a positive integer that is only divisible by 1 and itself. In other words, it has exactly two factors.

2. What is the prime numbers function?

The prime numbers function is a mathematical function that calculates all the prime numbers within a specified range or up to a given number.

3. How is the prime numbers function used in cryptography?

The prime numbers function is used in cryptography to generate large prime numbers that are used as the basis for generating secure encryption keys. This is because prime numbers have unique mathematical properties that make them difficult to factorize, making them ideal for encryption.

4. Can all numbers be expressed as a product of prime numbers?

Yes, this is known as the fundamental theorem of arithmetic. It states that every positive integer can be expressed as a unique product of prime numbers.

5. How is the prime numbers function related to the Riemann Hypothesis?

The prime numbers function is closely related to the Riemann Hypothesis, which is a conjecture about the distribution of prime numbers. It states that the prime numbers function can be approximated by a complex mathematical function known as the Riemann zeta function.

Similar threads

  • Linear and Abstract Algebra
Replies
2
Views
805
  • Linear and Abstract Algebra
Replies
1
Views
830
  • Linear and Abstract Algebra
Replies
9
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
17
Views
475
  • Programming and Computer Science
Replies
22
Views
765
Replies
5
Views
423
  • Linear and Abstract Algebra
Replies
8
Views
900
  • Linear and Abstract Algebra
Replies
17
Views
1K
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
3K
Back
Top