{ // Display result with prime factors (part 1); // Numerator var power = 1; var use_power = false; var times = ''; var size_A = fraction[0].length; var result_A = ''; for(let i= size_A-1; i>=0; i--){ if(fraction[0][i]==fraction[0][i-1]){ power += 1; use_power = true; } else { if(power==1) {power="";} // We don't display "^1" if(result_A != '') { times = ' × ';} // Condition is fulfilled to add the times (×) symbol. result_A = fraction[0][i].toString().concat('^',power,'',times,result_A); power = 1; // Reinitialize power to 1 } } // Denominator power = 1; use_power = false; times = ''; var size_B = fraction[1].length; var result_B = ''; for(let i= size_B-1; i>=0; i--){ if(fraction[1][i]==fraction[1][i-1]){ power += 1; use_power = true; } else { if(power==1) {power="";} // We don't display "^1" if(result_B != '') { times = ' × ';} // Condition is fulfilled to add the times (×) symbol. result_B = fraction[1][i].toString().concat('^',power,'',times,result_B); power = 1; // Reinitialize power to 1 } } result_A == ''? result_A = 1: ''; result_B == ''? result_B = 1: ''; var numerator_reduced = 1, denominator_reduced = 1; for(var i=0; i < fraction[0].length;i++) { numerator_reduced *= fraction[0][i]; } for(var j=0; j < fraction[1].length;j++) { denominator_reduced *= fraction[1][j]; } if(size_A>1 || size_B>1){ return html`
The prime factorizations of the numerator (${numerator_reduced==numerator?`A`:`A'`}) and denominator (${denominator_reduced==denominator?`B`:`B'`}) can be written as follows:
${numerator_reduced==numerator?`A`:`A'`} = ${numerator_reduced} = ${result_A},
${denominator_reduced==denominator?`B`:`B'`} = ${denominator_reduced} = ${result_B}.
`; } else{ return html ``; } }