NikolayZ wrote:hey chipbmk !
If <n> represents the product of ALL integers equal or less then n. So, <n> might be rewritten as n! (factorial)
so 20!+22!=20!(1+21+22)=20!(44), thus, the largest prime will be indeed 19.
I suppose you just forgot to write that <n> represents the product of all even positive integers less than or equal to n.
If so
<20>=20*18*16*...*2(the largest and only prime here is 2)
<22>=22*(20*18*16*...*2), look, the product of all numbers except 22 equals <20>. so <22> can be rewritten into <22>=22*<20>
Hence, <20>+<22>=<20>+22*(<20>)=<20>(1+22)=<20>*23.
WE know that the largest prime in <20> is 2, hence our answer is 23.
Hope it is clear now.
i think the q is complete and correct....
it is a typical GMAT type q where clues are hidden...
in the Q <n> is represented by an eg <8>=8*6*4*2
that means <n> is a product of even int..
under time pressure such small things can cause much damage...
It does not matter how many times you get knocked down , but how many times you get up