/**
 *	Helper function to validate that
 *	we have a number
 **/
function nValid(n) {
	if(!isNaN(parseFloat(n)) && isFinite(n)) {
		// console.log(n + ' is a number.');
		return true;
	} else {
		// console.log(n + ' ...no no no, not in my house!');
		return false;
	}
}
/**
 * Making the Fibonacci Sequence
 **/
function fibonacci(n) {
	// set a default limit
	if(!n) var n = 0;
	//start with 0 and 1
	var a = 0,
		b = 1,
		x = a + b;
	// console.log(a + ' + ' + b + ' =',  x);
	// start the sequence with a loop
	for(a;x<n;) {
		a = b;
		b = x;
		x = a + b;
		// console.log(a + ' + ' + b + ' =', x);
	}
	return x;
}
/**
 *	Checks to see if our number
 *	is part of the Fibonacci Sequence
 **/
function isFibonacci(n) {
	// '==' because in this case we don't want to be so strict
	if(fibonacci(n) == n) {
		// console.log(n + ' is part of the Fibonacci Sequence');
		return true;
	} else {
		// console.log(n + ' is NOT part of the Fibonacci Sequence');
		return false;
	}
}
/**
 *	Checks to see if our number
 *	is a Prime number
 **/
function isPrime(n) {
	// prime numbers must be greater than 1
	if(n <= 1) return false;
	// we know 2, 3, & 5 are prime numbers
	if(n == 2 || n == 3 || n == 5) return true;
	// even numbers can't be prime (except 2)
	// and at this point if you're divisible by 3 or 5 you're not 3 or 5 so you can't be prime
	if(n%2 == 0 || n%3 == 0 || n%5 == 0) return false;
	// test the left overs (i think this should work)
	for(i=5;i<n;i++) {
		if(n%i == 0) {
			return false;
		} else {
			return true;
		}	
	}
}
/**
 *	Run all tests
 **/
function willItBlend(n) {
	var result,
		split = '<br /> ';
	if(nValid(n)) {
		result = 'The number ' + n + '... ';
	} else {
		result = 'That is NOT a number. No no no... not in my house!';
		return result;
	}
	if(isFibonacci(n)) {
		result += split + 'is part of the Fibonacci Sequence';
	} else {
		result += split + 'is NOT part of the Fibonacci Sequence';
	}
	if(isPrime(n)) {
		result += split + 'is a Prime number';
	} else {
		result += split + 'is NOT a Prime number';
	}
	return result;
}





@@ -1097,19 +1097,55 @@
 an 1
-%0A%09if(n %3C= 1
+ and are whole numbers%0A%09if(n %3C= 1 %7C%7C n %25 1 != 0
 ) re

prime numbers are whole