randRange( 10, 25 )
randRange( 10, 25 )
getLCM( A, B )
getPrimeFactorization( LCM )
(function() {
var num = randRange( ceil( LCM_FACTORIZATION.length / 2 ), LCM_FACTORIZATION.length - 1 );
var shuffled = shuffle( LCM_FACTORIZATION );
var answer = 1;
for ( var i = 0; i < num; i++ ) {
answer *= shuffled.shift();
}
return answer;
})()
(function() {
var wrongs = [];
while( wrongs.length < 4 ) {
var w = randRange( 10, LCM );
if ( LCM % w !== 0 ) {
wrongs.push( w );
}
}
return wrongs;
})()
All numbers divisible by A
and B
are also divisible by which of the following?
ANSWER
The prime factorization of A
is getPrimeFactorization( A ).join( "\\times" )
.
The prime factorization of B
is getPrimeFactorization( B ).join( "\\times" )
.
So, any number divisible by both must have LCM_FACTORIZATION.join( "\\times" )
as part of its prime factorization.
Such a number is divisible by ANSWER
, since the prime factorization of ANSWER
is getPrimeFactorization( ANSWER ).join( "\\times" )
.