send mail to support@abhimanu.com mentioning your email id and mobileno registered with us! if details not recieved
Resend Opt after 60 Sec.
By Loging in you agree to Terms of Services and Privacy Policy
Claim your free MCQ
Please specify
Sorry for the inconvenience but we’re performing some maintenance at the moment. Website can be slow during this phase..
Please verify your mobile number
Login not allowed, Please logout from existing browser
Please update your name
Subscribe to Notifications
Stay updated with the latest Current affairs and other important updates regarding video Lectures, Test Schedules, live sessions etc..
Your Free user account at abhipedia has been created.
Remember, success is a journey, not a destination. Stay motivated and keep moving forward!
Refer & Earn
Enquire Now
My Abhipedia Earning
Kindly Login to view your earning
Support
Type your modal answer and submitt for approval
In a post office, stamps of three different denominations of Rs 7, Rs 8, and Rs 10 are available. The exact amount for which one cannot buy stamps is
29
23
20
19
- To solve this, let's understand the concept behind the problem. When dealing with linear combinations of stamps or denominations, the biggest challenge is finding the smallest amount that cannot be purchased.
- Denominations available are Rs 7, Rs 8, and Rs 10. We need to figure out which option can't be expressed using these combinations.
- Option 1: 29 can be formed by 7+7+7+8.
- Option 2: 23 can be formed by 7+8+8.
- Option 3: 20 can be formed by 10+10.
- Option 4: 19 cannot be formed using any combination of Rs 7, 8, and 10.
-
Report error
Please Wait..
Access to prime resources