Last visit was: 24 Apr 2026, 13:51 It is currently 24 Apr 2026, 13:51
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 12 Mar 2026
Posts: 1,841
Own Kudos:
8,511
 [27]
Given Kudos: 707
Location: India
Posts: 1,841
Kudos: 8,511
 [27]
Kudos
Add Kudos
27
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Hal90
Joined: 22 Oct 2018
Last visit: 05 Jun 2019
Posts: 36
Own Kudos:
25
 [9]
Given Kudos: 20
Location: Canada
GMAT 1: 690 Q47 V38
GPA: 1
7
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 12 Mar 2026
Posts: 1,841
Own Kudos:
8,511
 [5]
Given Kudos: 707
Location: India
Posts: 1,841
Kudos: 8,511
 [5]
3
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
General Discussion
User avatar
Chethan92
Joined: 18 Jul 2018
Last visit: 21 Apr 2022
Posts: 901
Own Kudos:
1,509
 [2]
Given Kudos: 95
Location: India
Concentration: Operations, General Management
GMAT 1: 590 Q46 V25
GMAT 2: 690 Q49 V34
WE:Engineering (Energy)
Products:
GMAT 2: 690 Q49 V34
Posts: 901
Kudos: 1,509
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Concept:

\(X_{min} = A+B+C-2*Total\)

If \(X_{min}\) is less than zero, then \(X_{min}\) of the set is zero.

For \(X_{max} ≤ Min(A,B,C)\)

If \(X_{max}\) is more than the total,i.e, 100% in this problem, then \(X_{max}\) is the Min(A,B,C)

If \(X_{max}\) is less than the total, we have to make an adjustment.

In this example, Min( Op, HR, Fin) = 69.
And the other values in the set for only Operations is 78-69 = 9
Only in HR = 87-69 = 18
As all the other values in the set should be zero.

69+9+18 = 96, which is less than a total of 100%.
Hence we need to make an adjustment.
100-96 = 4, this has to be equally divided into the set of only operations and HR. 4/2 = 2% should be added to OP and HR or 2% should be subtracted from the max of X. 69-2 = 67%

D is the answer.
User avatar
exc4libur
Joined: 24 Nov 2016
Last visit: 22 Mar 2022
Posts: 1,680
Own Kudos:
1,469
 [4]
Given Kudos: 607
Location: United States
Posts: 1,680
Kudos: 1,469
 [4]
3
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
nick1816
In an office, where working in at least one of the three departments is mandatory, 78% of the employees are in operations, 69% are in finance and 87% are in HR. Whats is the maximum percentage of employees that could have been working in all three departments.

A. 69
B. 45
C. 66
D. 67
E. 34

three-overlapping sets:
T=A+B+C-both-2(mid)+neither
T=A+B+C-both-2(mid)+0 ("working in at least one of the three departments is mandatory")
1=.78+.69+.87-both-2mid
-1.34=-both-2mid (minimize both to 0 to maximize mid)
-1.34/-2=mid
mid=0.67=67%

Answer (D)
User avatar
Fdambro294
Joined: 10 Jul 2019
Last visit: 20 Aug 2025
Posts: 1,331
Own Kudos:
772
 [3]
Given Kudos: 1,656
Posts: 1,331
Kudos: 772
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Pretend there is 100 people instead of 100 percent.

All 100 people are lined up in front of you. Every time a person is part of 1 of the 3 groups they raise their hand and they get a piece of candy.

After the 3 questions are asked (who works in OP? Who works in HR? Who works in FIN?):

The total number of times a hand gets raised is = (78 + 69 + 87) = 234 times

There are only 100 people. All 100 do at least one of the three jobs. Obviously some people did more than 1 job.

(1st)Satisfy the Minimum Condition

We have 100 people ———234 pieces of candy to hand out

Since each person must do at least one job, we hand our 1 piece for each of the 100 people.

Right now: 100 ppl —— have 1 candy

234 - 100 = 134 pieces left to hand out


(2nd)we want to maximize the amount of people who do all 3 jobs

The upper limit is given by the smallest set total (69). Since only 69 do finance, we can’t have more than 69 do all 3

Right now we still have 134 pieces to hand out to the 100 ppl. To MAX the number of ppl who get 3 in total, we will hand out +2 pieces to as many people as possible

(134 left) / 2 ————> 67


67 ppl can do all 3 jobs

Remaining 33 do 1 job only


Answer: 67%

Posted from my mobile device
avatar
TarunKumar1234
Joined: 14 Jul 2020
Last visit: 28 Feb 2024
Posts: 1,102
Own Kudos:
Given Kudos: 351
Location: India
Posts: 1,102
Kudos: 1,357
Kudos
Add Kudos
Bookmarks
Bookmark this Post
100 = 78 + 69 + 87 - n(AUB)- n(BUC)- n(AUC) + A∩B∩C
or, 100 = 234 - (only n(AUB)+ A∩B∩C) + (only n(BUC)+ A∩B∩C) - (only n(AUC)+ A∩B∩C) + A∩B∩C

To maximize A∩B∩C, we need to consider only n(AUB) = only n(BUC) = only n(AUC) = 0

So, 2*A∩B∩C = 134 or, A∩B∩C = 67.

So, I think D. :)
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,974
Own Kudos:
Posts: 38,974
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109818 posts
Tuck School Moderator
853 posts