Yes? The OP’s question is “how can you prove this will never **produce** a prime?” The OP says nothing about the domain of **n**. Obviously the prime number has to be whole, but that’s the result of f(n), n itself is not constrained to be integral.

I guess I’m having a hard time with terms. I’ll do what I can.

Whatever kind of number you put in, what you get out will be the same type- rational, integer, etc.

Some rational results may have values equivalent to whole numbers, but those won’t be any numbers we haven’t already addressed- it’ll be factorable.

On the other hand given the statement of the question I find it only natural to assume that **n** represents a natural number. Obviously the OP did not state the problem completely correctly but I think most math students would understand it correctly with the assumption that n is natural. Not to mention the common convention of using n for natural numbers, q for rational, R for real, etc.

Okay, I’m sorry guys, but some of the information in this thread is erroneous, and I have a counterexample to prove this.

**Conjecture:** providing a factorization of a function into the product of two integers will never be prime.

This is not true, take the simple counterexample:

(x+1)(x-1)

Let x = 2

(2+1)(2-1)

(3)(1)

= 3

3 is prime. Providing a factorization did nothing to show that the output of f(x) could not be prime. I’m not 100% sure of this, but **assuming integral x**, I think I’ve found the constraints for showing a factorized quadratic equation cannot be prime.

Let f(x) = (ax + b)(cx + d); where x is integral and a,b,c, and d are integers not equal to zero.

We can also express f(x) in a different way, f(x)= g(x)h(x), where g(x)=(ax+b) and h(x)=(cx+d).

To show that f(x) may not produce a prime, the following must be true:

Constraint one is that, when h(x) = 1, g(x) must not be prime. Constraint two is the reverse: when g(x)=1 h(x) must not be prime.

The final constraint is this: b * d must not be prime. This is more or less the same as constraints 1 and 2. If b = 1, d must not be prime and vice verse. Otherwise, when x=0, b*d will be prime. Take, for instance:

(5x + 2)(9x + 1), when x = 0 you get (5*0+2)(9*0+1) = (0+2)(0+1)= 2*1 = 2; 2 is prime.

**In the general case where x is real**, f(x) **must** be able to produce a prime or f(x) would be a discontinuous function. So, if constraints are not put on the domain of x, it is impossible to prove that f(x) will never produce a prime (since it is false).

That’s true, and given that I figured out that a real x must produce a prime at some point for a quadratic equation, it’s the only sane statement of the problem.

There’s another obvious constraint I missed involving negatives. If h(x) or g(x) is -1, then the other one must not be a negative prime. Same for b*d.

OK, to be absolutely accurate:

(8x+1)(2x+1)

So, all values of X will produce a prime, except for those such that 8x+1 = 1 or 2x + 1 = 1. In other words, 0. That’s the only number that can produce a prime, since a prime is only divisible by itself and 1. And since 1 is not a prime by definition, any number inserted for X will produce a non-prime. I don’t see how it could be any other way.

Any integer, not any number. You can produce 5, for instance, by setting x equal to

(1/16)(-5-sqrt(89)) or (1/16)(sqrt(89)-5)

My point (or rather, confusion, since I hadn’t thought about it enough to solidify what I was thinking at that point) is that you can only show a prime will never be produced unless you constrain x’s domain. (Or n’s domain, whatever). But I agree with sailor that the domain was implicitly constrained by choosing n as the variable name and the fact that the problem makes no sense otherwise.

Edit: And for integral n, the OP’s expression in specific will never produce a prime.

Sorry, yes. I meant “integer.”

That’s correct. The caveat about one side of the factorization equalling one should have been pointed out, given that a prime number cannot have one and itself as its factors.

Actually, I think it needs to be further constrained to positive integers, as one factor being set to -1 might also produce a prime.

(8x+1)(2x+1) = 7 when x = -1

Actually (albeit in a later post):

As for the factorization when one of the factors is 1, I address that in my first post in the thread:

Ah, somehow I missed that clarification. And I assume by “whole numbers” we mean “positive integers.”

AKA “natural numbers”

Most likely.

It generally means the set {1, 2, 3, 4, …}, though I’ve seen it contain the number zero from time to time.

I’ve also seen “whole numbers” used to include negative integers as well (after all, they’re “whole” in the sense that they lack a fractional part). It’s terribly ambiguous terminology…

The terminology that I usually see in ~freshman-level college math textbooks is that given here (though, see the paragraph labeled “Confusing”): that the “whole numbers” are {0, 1, 2, …}, while the “counting numbers” or “natural numbers” are {1, 2, 3, …}.

It should be noted that any time we’re talking about primes, the space of numbers is assumed to be the integers, since whether or not something is a prime depends on what space of numbers you’re working with. If we’re allowing n to be 1/2, then you’re not getting the integer 3 (which is a prime), but the rational number 3 (which is not a prime). In fact, no rational number is prime: They’re all units (except for zero, which is its own thing).

(The terminology where 0 is not a “counting number” is also terribly irksome, and always throws me. When I think of “counting”, I think of answering the question “How many…?”, and there most definitely are times when the answer is 0 (“How many Civil War veterans are still alive?”). But, charitably, I suppose how I should understand the terminology is “‘Counting numbers’ are the numbers you would announce out loud, one by one, in the process of counting items”, so that zero is disqualified on the grounds that you never get to the point of having to say it…)

I suppose this is just a matter of the terminology (or conceptualizations) one wishes to use. I tend to view the integers as a proper subset of rationals, which is a proper subset of reals, which is a proper subset of complex numbers. Thus, for example, I see every integer as a rational number, and *some rational numbers* are prime numbers.

Similarly, the set of *functions* is a proper subset of the set of *relations* (in plainer English, every function is a special kind of relation), and every relation has an inverse. Therefore, every function has an inverse (although the inverse of a function might not be a function). More typically, a function is said to have an inverse only if that inverse is also a function. To me, that’s what makes the language sloppy and ambiguous.

Sure, you can do that, but then you have to clarify the domain you’re talking about in some other way. For instance, is 5 a prime? Well, 5 is an integer, and in the integers it’s prime… But the integers are also a subset of the Gaussian integers, and in the Gaussian integers, 5 = (1+2i)(1-2i), and so 5 is composite.

Everything is potentially ambiguous all the time, barring strenuous (and, for most purposes, excessive) effort otherwise… We ordinarily answer “Is 7 divisible by 2?” by saying “No, of course not”, though we might also in some contexts instead say “Sure, it’s 3.5”. And it’s not wrong to give the former answer even when the disambiguation of intended interpretation hasn’t been made explicit, relying on convention and implicit cues instead. Similarly, I think we can all agree that the OP was referring to “primes” in the ungeneralized sense of this term as meaning integers > 1 admitting no further factorizations into integers > 1, even though they did not state this explicitly.