Question Details

A fruit seller has a stock of mangoes, bananas and apples with at least one fruit of each type. At the beginning of a day, the number of mangoes make up 40% of his stock. That day, he sells half of the mangoes, 96 bananas and 40% of the apples. At the end of the day, he ends up selling 50% of the fruits. The smallest possible total number of fruits in the stock at the beginning of the day is

Show Answer
Correct Answer
340

Solution :

Let the total number of fruits in the stock at the beginning of the day be N.
Let M be the number of mangoes, B be the number of bananas, and A be the number of apples in the initial stock.
We are given that there is at least one fruit of each type initially, so M>0, B>0, and A>0 are integers.

According to the problem statement, at the beginning of the day, mangoes make up 40% of the total stock:
M=0.40N

Since the number of mangoes M must be an integer, we can write:
M=25N
This implies that N must be a multiple of 5. Let N=5k for some positive integer k. Then:
M=2k

The remaining 60% of the initial stock consists of bananas and apples:
B+A=0.60N=3k

Next, let's look at the fruits sold during the day:
- Mangoes sold: half of the mangoes = 12M=12(2k)=k
- Bananas sold: 96
- Apples sold: 40% of the apples = 0.40A=25A

The total number of fruits sold is given as 50% of the initial stock:
Total sold = 0.50N=52k

Setting up the equation for the total fruits sold:
k+96+25A=52k

Rearranging the equation to solve for A in terms of k:
96+25A=52k-k
96+25A=32k
Multiply the entire equation by 10 to clear denominators:
960+4A=15k
4A=15k-960
A=15k-9604

Since the number of apples A must be a positive integer, 15k-960 must be positive and divisible by 4:
1. For A>0:
15k-960>0⇒15k>960⇒k>64
2. For A to be an integer, 15k-960 must be a multiple of 4. Since 960 is divisible by 4, 15k must also be divisible by 4. Because 15 and 4 share no common factors, k must be a multiple of 4.

Additionally, the number of bananas B must be a positive integer, and at least 96 bananas must have been sold (so B≥96):
B=3k-A≥96
Substitute the expression for A into this inequality:
3k-15k-9604≥96
Multiply the inequality by 4:
12k-(15k-960)≥384
-3k+960≥384
960-384≥3k
576≥3k⇒k≤192

Furthermore, since the vendor sells 40% of the apples, the number of apples A must be a multiple of 5 so that the number of apples sold is an integer:
A=15k-9604=5m (where m is a positive integer)
15k-9604=5m⇒15k-960=20m
Divide by 5:
3k-192=4m
Since 192 and 4m are divisible by 4, 3k must be divisible by 4, which again means k is a multiple of 4.

To find the smallest possible total number of fruits N=5k, we need to find the smallest possible integer value of k that satisfies our constraints:
1. k>64
2. k is a multiple of 4.
The smallest multiple of 4 strictly greater than 64 is:
k=68

Let's check if k=68 yields integer values for M, A, and B:
- M=2k=2(68)=136 (an integer)
- A=15(68)-9604=1020-9604=604=15 (an integer, and 0.40×15=6 apples sold is also an integer)
- B=3k-A=3(68)-15=204-15=189 (an integer, and 189≥96)

All values are valid positive integers. Thus, the smallest possible total number of fruits in the stock at the beginning of the day is:
N=5k=5×68=340

The correct answer is 340.

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • SSC
  • intermediate
  • 1 hour and 30 mins
  • english, general awareness, logical reasoning, mathematics

A comprehensive SSC MTS 2026 Mock Test 4 designed to help aspirants strengthen their preparation and improve their performance for the Staff Selection Commission Multi-Tasking Staff examination. This mock test covers all major sections including Numerical and Mathematical Ability, Reasoning Ability and Problem Solving, General Awareness, and English Language and Comprehension. It includes a balanced combination of conceptual, analytical, and exam-oriented multiple-choice questions aligned with the latest SSC MTS syllabus and exam pattern. Ideal for practice, revision, self-evaluation, accuracy improvement, speed enhancement, and effective time management, this mock test helps candidates assess their exam readiness, identify improvement areas, and build confidence for the SSC MTS 2026 examination

  • SSC
  • intermediate
  • 1 hour and 30 mins
  • english, general awareness, logical reasoning, mathematics

A comprehensive SSC MTS 2026 Mock Test 3 designed to help aspirants prepare thoroughly for the Staff Selection Commission Multi-Tasking Staff examination. This mock test covers all important sections including Numerical and Mathematical Ability, Reasoning Ability and Problem Solving, General Awareness, and English Language and Comprehension. It features a carefully curated set of multiple-choice questions that test conceptual understanding, logical reasoning, problem-solving skills, speed, and accuracy in accordance with the latest SSC MTS exam pattern. Ideal for practice, revision, self-assessment, performance evaluation, and time management improvement, this mock test enables candidates to identify strengths and weaknesses while building confidence for the SSC MTS 2026 examination.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: