There is nothing that says it can or cannot be true.  It would kinda fit into the category of P=NP, though. e.g., you can prove S times T equals a number, but finding S and T from that number would be a lot harder.

Code: [Select]

def getFactorial(x):
    if x == 0:
        return 1
    else:
        soma = 1
        for i in range(x,0,-1):
            soma=soma*i
        return soma
I just made a Python function that gets the factorial of a n number.

A simpler way of doing this is:

Code: [Select]

import math
print math.factorial(x)

But mine is much cooler.

Yet another cool way to compute factorials, this way is for factorials of very very large numbers without multi-precision containers.
No multiplication required

Code: (Pseudocode) [Select]

double sum=0;
for (int i=1; i<Max; i++) {
  sum += log(i);
}
int exponent = floor(sum);
double coeff = Pow(10,sum-exponent);

print("Answer is: ",coeff,"x10^",exponent);


You can prevent cheating by putting variables within the private scope.
That can be done using this:

Code: (JavaScript) [Select]

var GlobalScope = function () {
var PrivateString = "Hello";
return {
showstring: function () {
alert(PrivateString);
}
};
}();

Upon looking at the DOM using Firefox's Firebug, you can see that the private string is not accesible.
So this will not work:

Code: (JavaScript) [Select]

alert(GlobalScope.PrivateString);

But, this will, as it is called by the GlobalScope's own child.

Code: (JavaScript) [Select]

GlobalScope.showstring();