var num = []; function possibleNums ( includeZero ) { var result = []; if (includeZero) { result.push(0); } for (var n = 1; n <= 9; n += 1 ) { if (num.indexOf( n ) == -1 ) { result.push( n ); } } return result; } function findNoneZeroSolution() { var result = ''; var count = 0; var a = possibleNums( false ); for (var ia = 0; ia < a.length; ia += 1 ) { num.push( a[ia] ); var b = possibleNums( false ) for (var ib = 0; ib < b.length; ib += 1 ) { num.push( b[ib] ); var c = possibleNums( false ) for (var ic = 0; ic < c.length; ic += 1 ) { num.push( c[ic] ); var d = possibleNums( false ) for (var id = 0; id < d.length; id += 1 ) { num.push( d[id] ); var e = possibleNums( false ) for (var ie = 0; ie < e.length; ie += 1 ) { num.push( e[ie] ); var f = possibleNums( false ) for (var indf = 0; indf < f.length; indf += 1 ) { num.push( f[indf] ); var g = possibleNums( false ) for (var ig = 0; ig < g.length; ig += 1 ) { num.push( g[ig] ); var h = possibleNums( false ) for (var ih = 0; ih < h.length; ih += 1 ) { num.push( h[ih] ); var n1 = num[4] + 10 * num[3] + 100 * num[2] + 1000 * num[1] + 10000 * num[0]; var n2 = num[7] + 10 * num[6] + 100 * num[4] + 1000 * num[5] + 10000 * num[1]; if ( n1 * 2 == n2 ) { count += 1; result += n1 + ' * 2 = ' + n2 + '
'; } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } return '' + count + ' possible solutions without zero in the result found:
' + result; } function findZeroSolution() { var result = ''; var count = 0; var a = possibleNums( false ); for (var ia = 0; ia < a.length; ia += 1 ) { num.push( a[ia] ); var b = possibleNums( false ) for (var ib = 0; ib < b.length; ib += 1 ) { num.push( b[ib] ); var c = possibleNums( false ) for (var ic = 0; ic < c.length; ic += 1 ) { num.push( c[ic] ); var d = possibleNums( false ) for (var id = 0; id < d.length; id += 1 ) { num.push( d[id] ); var e = possibleNums( false ) for (var ie = 0; ie < e.length; ie += 1 ) { num.push( e[ie] ); var f = possibleNums( true ) for (var indf = 0; indf < f.length; indf += 1 ) { num.push( f[indf] ); var g = possibleNums( true ) for (var ig = 0; ig < g.length; ig += 1 ) { num.push( g[ig] ); var h = possibleNums( true ) for (var ih = 0; ih < h.length; ih += 1 ) { num.push( h[ih] ); var n1 = num[4] + 10 * num[3] + 100 * num[2] + 1000 * num[1] + 10000 * num[0]; var n2 = num[7] + 10 * num[6] + 100 * num[4] + 1000 * num[5] + 10000 * num[1]; if ( n1 * 2 == n2 ) { count += 1; result += n1 + ' * 2 = ' + n2 + '
'; } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } num.pop(); } return '' + count + ' possible solutions with zero in the result found:
' + result; }

Quizz XIV solver