$(document).ready(function(){ // INIT setTimeout(function(){ $('.progress .inner') .animate({width:'100px'},2000) $('.progress') .delay(2000) .fadeOut(200); $('#load') .delay(2300) .fadeOut(500); $('.page') .delay(3000) .fadeIn(500); },500); var missions = ['Armstrong numbers','Pronic numbers','Pandigital numbers','Automorphic numbers','Palindrome numbers','Leyland numbers','Abundant numbers','Happy numbers','Deficient numbers']; var desc = [ 'An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself', 'Pronic number is a number which is the product of two consecutive integers, that is, n=x*(x+1)', 'If a number contains each of the digits from 0 to 9 at least once (0 not being the leading digit), it is considered to be pandigital', 'If the square of a number ends with the number itself, it is considered to be automorphic', 'Palindromic number is a number that is the same when written forwards or backwards', 'A Leyland number is a number which can be expressed as a^b + b^a where a and b are integers greater than 1', 'If the sum of factors of a number is greater than twice that number, it is considered to be abundant', 'If the repeated sum of squares of the digits of a number is equal to 1, it is considered to be happy', 'A number is considered deficient if the sum of its factors is less than twice that number' ]; for(i in missions) { $('.table').append('

'+missions[i]+'

'+desc[i]+'

'); } function info() { $('.page').css({filter:'blur(5px)'}); $('.page2').delay(200).fadeIn(500); } function cInfo() { $('.page').css({filter:'blur(0)'}); $('.page2').fadeOut(500); } function restart() { $('.start').fadeIn(100); $('.restart').fadeOut(100); $('#entry').fadeIn(100); $('.result').fadeOut(100); } /* ++++++++ */ function calculs(n) { $('.r1 span').text(armstrong(n)); $('.r2 span').text(pronic(n)); $('.r3 span').text(automorphic(n)); $('.r4 span').text(pandigital(n)); $('.r5 span').text(palindromic(n)); $('.r6 span').text(leyland(n)); $('.r7 span').text(happy(n)); $('.r8 span').text(abundant(n,2)); $('.r9 span').text(deficient(n,3)); // * ** *// $('.result').delay(200).fadeIn(100); } /* ++++++++ */ function spend(n) { $('#entry') .css({borderColor:'rgba(0, 0, 0, 0.9)'}); $('.start').fadeOut(100); $('.restart').fadeIn(100); $('#entry').fadeOut(100); $('.number').text(n+' is:'); calculs(n); } function secure(e) { var k = $(this).val(); var reg = /[\.]/; if(e.which == 13 && k>0){ reg.test(k) ? $('#entry') .css({borderColor:'#D00'}) : spend(k); } } function secure2() { var k = $("#entry").val(); if(k>0) { var reg = /[\.]/; reg.test(k) ? $('#entry') .css({borderColor:'#D00'}) : spend(k); } } // ALL CALCULS function factors(num,cmd) { var half = Math.floor(num/2), str = '1', str2 = 0, i, j; num%2 === 0? (i=2, j=1): (i=3, j=2); for (i; i<=half; i+=j) { num%i === 0? str+='-'+i: false; } str += '-'+num; str = str.split('-'); num *= 2; for(i=0;inum && cmd==2)) { return false; } else if((str2>num && cmd==3) || (str2=3) { var r = (Math.pow(n[0],3))+(Math.pow(n[1],3))+(Math.pow(n[2],3)); if(r==n) { return true; } else { return false; } } else { return false; } } // Pronic function pronic(n) { var d = 1+4*n; if(d>0) { var r = (1+Math.sqrt(d))/2; if(r%2==1) { return true; } else { return false; } } else { return false; } } // Automorphic function automorphic(n) { var n2 = Math.pow(n,2); var reg = new RegExp(n+'$'); if(reg.test(n2)) { return true; } else { return false; } } // PANDIGITAL function pandigital(n){ n = n+""; // si pas un nombre => false if(isNaN(n)) return false; var i=0,imax=9; for(;i<=imax; i++) { if(n.indexOf(i)===-1) { return false; } } return true; } // function palindromic(n) { var a="", b = n.split('').reverse(), i = 0; for(i in b) { a+=b[i]; } return a; } function happy(n) { var a = n.split(''), b = 0, i = 0, j = 0; do { b=0; for(i in a) { b += parseInt(Math.pow(a[i],2)); } a = b.toString().split(''); if(b==1) return true; if(j==20) return false; j++; } while(b>1); } function abundant(n) { var a = factors(n,3); return a; } function deficient(n) { var a = factors(n,2); return a; } function leyland(n) { var count = 0; for(a=2; a

9 challenges