var counter, user_number;

function Clear(){
	document.Mult.A1.value="";
	document.Mult.T1.value="";
	}

function Clear1(){
	document.Mult.B1.value="";
	document.Mult.U1.value="";
	}

function Clear2(){
	document.Mult.C1.value="";
	document.Mult.V1.value="";
	document.Mult.W1.value="";
	}

function isprime(inpt){
	var inpt=0;
	var count=0;
	inpt = document.Mult.B1.value;
	if(document.Mult.B1.value > 90000000000000000000000){
		alert("less than 1,000,000 please");
	//Clear1();
	return 0;
	}
	
		for(count=1; count<inpt; count++){
		if(inpt%count==0 && count > 1 && count < inpt){
		document.Mult.U1.value=
		document.Mult.U1.value + ("number is not prime")+"\n"+("it is divisible by ")+count+"\n";
		return 0;
		break;
		}
	}
		for(count=0; count<inpt; count++){
		if(inpt%count!=0){
		document.Mult.U1.value=document.Mult.U1.value+("number is prime");
		break;
		}
	}
} 

function calculate(){
	user_number= document.Mult.A1.value; //get user input
		if(user_number > 50000){
			alert("must be less than 50000");
			return 0;
			}
	for(counter = 1; counter <= user_number; counter++){
		if(user_number%counter==0 && counter > 1 && counter < user_number){
			document.Mult.T1.value=document.Mult.T1.value+(counter)+"\n";
			}
		}
		alert("done");
	}

function factorial(x){
	if(document.Mult.C1.value > 100){
	return ("number too large");
	}
	document.Mult.W1.value=document.Mult.W1.value+x+"\n";
	if(x>1) return x * arguments.callee(x-1);
	return x;
	}

function calculate2(){
	x = document.Mult.C1.value;
	document.Mult.V1.value=document.Mult.V1.value+factorial(x)+"\n";
}