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
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & 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.

Typewriter Question

Expert replies
by milanproda » Mon Dec 27, 2010 12:31 pm
Are there exactly 4 distinct keys that are working on the old typewriter?

1- An old typewriter is defective in such a way that its blank key is not functioning, and the typewriter allows only 4 letters per word by forcing a space character to be inserted after each four letter word. A monkey sitting at the typewriter is aware of this peculiarity, and presses only distinct keys for each four letter sequence. Some keys of this typewriter are not functioning.

2 A monkey is able to create 24 four letter words.

Answer: 3 Both Statements together are sufficient, but neither statement alone is sufficient

????
Milan Prodanovic
[email protected]
Join the discussion
Source: — Data Sufficiency |

by Night reader » Mon Dec 27, 2010 12:49 pm
milanproda wrote:Are there exactly 4 distinct keys that are working on the old typewriter?

1- An old typewriter is defective in such a way that its blank key is not functioning, and the typewriter allows only 4 letters per word by forcing a space character to be inserted after each four letter word. A monkey sitting at the typewriter is aware of this peculiarity, and presses only distinct keys for each four letter sequence. Some keys of this typewriter are not functioning.

2 A monkey is able to create 24 four letter words.

Answer: 3 Both Statements together are sufficient, but neither statement alone is sufficient

????
Given: 4 distinct keys, find # keys-? distinct - not ?

st(1) constraint - only 4 letters per word => four slots (places) => monkey is checking the keys -distinct -working -not? :)
presses only distinct keys, but we don't know how many types monkey presses the keys and how many slots are filled. Not Sufficient;
st(2) monkey arranges all words in 24 ways, but we don't know how many distinct letters (keys) in the words. Not Sufficient;

Combining st(1&2) Find perm for 4 distinct keys placed in 4 slots => 4*3*2*1=24. Sufficient.

Answer C
Last edited by Night reader on Mon Dec 27, 2010 12:58 pm, edited 1 time in total.
Join the discussion

by milanproda » Mon Dec 27, 2010 12:57 pm
Thanks, I did not realize that this was a permutation problem. I assumed that becuase it would to be too time consuming to find all of the possible 4 letter words that the monkey wrote, that stem 2 would be insufficient.
Milan Prodanovic
[email protected]
Join the discussion