bencoveney

// loop through every number and check if it is a multiple
var multiples = [];
for(var i = 0; i < 1000; i++)
{
    // assume the number isnt a multiple
    var multiple = false;
    
    // is the number divisible by 3?
    if(i % 3 === 0)
    {

bencoveney

var fibonacci = [1,2]; // seed numbers
var sum = 2; // sum of even seed numbers
var limit = 4000000; // 4 million limit

// Generate the next fibonacci number
var nextNumber = fibonacci[0] + fibonacci[1];

// generate fibonacci numbers until the limit is reached
while(nextNumber < limit)
{

bencoveney

var number = 600851475143;

var findFactor = function(number)
{
    console.log("Finding factors of " + number);
    
    // Loop through all possible factors beginning from 2
    // 2 is chosen because 1 will always be a factor
    for(var i = 2; i < number / 2; i++)
    {

bencoveney

var limit = 1000;
var highestPalindrome = 0;

var isPalindrome = function(number)
{
    
    // Split the number into an array of digits
    // To do this we need to make javascript think the number is a string of text
    // the string of text can then be split into individual characters
    var numberString = "" + number;

bencoveney

var iterator = 1;

var isMultiple = function(number) {
    // divide the number by every number between 1 & 20
    for(var i = 1; i <= 20; i++)
    {
        if(number % i != 0)
        {
            // If the number wasn't divisible then we know it can't be a correct answer
            return false;

bencoveney

var limit = 100;
var sumOfNumbers = 0;
var sumOfSquares = 0;

// Sum the numbers and their squares
for(var i = 1; i <= limit; i++)
{
       sumOfNumbers += i;
       sumOfSquares += i*i;
}

bencoveney

var isPrime = function(number, primes) {
    
    // Is the number evenly divisible by any of the current primes?
    for(var i = 0; i < primes.length; i++)
    {
        if(number % primes[i] === 0)
        {
            // if we manage an even division the number isnt prime
            return false;
        }

bencoveney

var adjacentDigits = 13;
var number = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257

bencoveney

for(var a = 1; a < 1000; a++)
{
    for(var b = a; b < 1000; b++)
    {
        // find c
        c = Math.sqrt((a*a)+(b*b));
        
        if(a+b+c == 1000)
        {
            console.log(a*b*c);

bencoveney

var isPrime = function(number, primes) {
    // Is the number evenly divisible by any of the current primes?
    for(var i = 0; i < primes.length; i++)
    {
        if(number % primes[i] === 0)
        {
            // if we manage an even division the number isnt prime
            return false;
        }
    }