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...
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?
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...
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