BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATBootcamp Starts Sep 21
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

Sep 21 to Oct 9, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

How would you solve it?

Expert replies
by manelgirona » Sun Oct 25, 2009 8:14 am
The symbol <n> represents the product of all the positive integers less than or equal n. For example <8> = 8 x 6 x 4 x 2. What is the greatest prime factor of <20> + <22>?

a) 7
b) 11
c) 13
d) 19
e) 23

OA: E
Join the discussion
Source: — Problem Solving |

by gmatv09 » Sun Oct 25, 2009 8:34 am
<20> + <22>
(2 * 4 * 6 * 8 * 10 ....20) + (2 * 4* 6 * 8 * ... 22)

(2 * 4 * 6 * 8 * 10 .... 20) [1 + 22]
(2 * 4 * 6 * 8 * 10 .... 20) [23]

Hence ans 23
Join the discussion

Re: How would you solve it?

by sanjana » Sun Oct 25, 2009 9:28 pm
manelgirona wrote:The symbol <n> represents the product of all the positive integers less than or equal n. For example <8> = 8 x 6 x 4 x 2. What is the greatest prime factor of <20> + <22>?

a) 7
b) 11
c) 13
d) 19
e) 23

OA: E
Is the question : Represents the product of all +ve even integers less than or equal to n?
Join the discussion

by chris6 » Tue Oct 27, 2009 6:22 pm
Where are you getting the 1 from? I am coming up with 19.
Join the discussion

by chipbmk » Tue Oct 27, 2009 7:15 pm
Can someone please explain HOW you do this problem?

I do not see a clear explanation by anyone yet.
Join the discussion

by NikolayZ » Wed Oct 28, 2009 1:18 am
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.
Join the discussion

by xcusemeplz2009 » Wed Oct 28, 2009 2:25 am
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
Join the discussion

by CrackGMAC » Wed Oct 28, 2009 5:46 am
Ya there is a confusion b/w even and odd (factorial)numbers here coz as question it should be all (ans 19) and as per defination of n <n> = 8*6*4*2 it should be 23.
Beat The GMAT
Join the discussion

by chipbmk » Wed Oct 28, 2009 6:55 am
NikolayZ wrote:hey chipbmk !

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 understood the part you wrote prior to the portion I quoted, but how did you go from "(<20>)*22 to <20>*23?

Why did you add 1?
Join the discussion

by xcusemeplz2009 » Wed Oct 28, 2009 9:05 am
chipbmk wrote:
NikolayZ wrote:hey chipbmk !

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 understood the part you wrote prior to the portion I quoted, but how did you go from "(<20>)*22 to <20>*23?

Why did you add 1?
its just taking out the common thing
<20>+22*<20>;taking<20> as a common out , the expression will be <20>[1+22]=<20>*23

HTH
It does not matter how many times you get knocked down , but how many times you get up
Join the discussion

by chipbmk » Wed Oct 28, 2009 1:57 pm
its just taking out the common thing
<20>+22*<20>;taking<20> as a common out , the expression will be <20>[1+22]=<20>*23

HTH[/quote]

OOHHHH I get it now. So it is the same as saying

x+x(2) ==> x(2+1) ==> x(3)

Thanks!
Join the discussion