Recent content by Rhythmer

HINT: \sqrt{9x^2-6x+1} = \sqrt{9x^2-(3+3)x+1} = \sqrt{9x^2-3x-3x+1} Try to complete it yourself.

It is. You're right.

Doesn't (cos(2x))2 = cos2(2x)2 = cos2(4x2) ?

I mean I was trying to be "neutral" and not biased against people who don't believe 1 is not a prime, etc.

I need to prove the IVT. Our professor told us there is such proof but it's not an easy one.

Well guys I'd like to emphasize that my purpose of this thread is just as I said before. I'm not attempting to redefine the factorial of 0 or to let 1 be a prime but what I'm trying to do is to discuss the topic with 'neutrality'. I do think all of you are right and I'm convinced to all of...

(\frac{1}{9})^m = 81^{m+4} (9^{-1})^m = (9^2)^{m+4} (9)^{-m} = (9)^{2m+8} -m = 2m+8 -8 = 3m m = - \frac{8}{3}

I think a prime number is a number that has no factors other than itself and 1 People are not to decide whether a prime number itself can be 1 Could you give us any example of a case where 1 must not be a prime number?

Prove: if P is a polynomial function and P(a) and P(b) have opposite signs, then there exists at least one value c between a and b for which P(c) = 0

However, the definition n!=n(n-1)(n-2)…3.2.1 means the factorial of any non-negative integer, n, is the product of n and all integers we obtain by decrementing n continuously by 1; and we would stop decrementing when number 1 is reached. Therefore, for any value of n, (n-1) cannot be < 1...

Hi. I know the following two questions might seem stupid, but I really need the correct answers in order to better understand the way we deal with numbers. 1. How can we prove that (0! = 1)? We all know (4! = 4*3*2*1), (3! = 3*2*1), (2! = 2*1), (1! = 1) But for 0, (0! = 1) doesn't make...

For all terms in the sequence: X_n = X_{n-1} + ( (n-1) * 10 ) Starting from (n = 1), X_0 = 1 :rolleyes: Is my solution too bad? :frown:

Unfortunately, C++ is the only programming language I can use. Regarding adityab88's question, here is a solution I've just gotten: 1, 11, 31, 61, 101, 151, 211, 281 And it's the smallest possible because 361 is not a prime

What type of programming do we need to solve this sort of mathematical problems? C++ ?