Maths Brain Teasers 62:: Adding up to 1k - Can You Solve iT?

avatar

Hey All; @StemGeeks Mathematician;

Without further, ado, let's get to our puzzle for today:: Maths Brain Teasers 62:: Adding up to 1k - Can You Solve iT?

Add FIVE numerals given in the Box so that when you Add them Up the resultant should be 1000

Numbers cannot be repeated.. that's the main rule as well..

image.png

Have a close look at the image given and see if you can add up the numerals given in the box to get a resultant of 1k. There is no logic here; just simple maths can get you to the right answer.. Guesswork isn't going to help...

With that, I'll leave you all with the Maths Brain Teasers 62:: Adding up to 1k - Can You Solve iT? Good luck solving iT...


Maths Brain Teasers 61:: Can You Decode The Sequence?- Solved with Explanation

image.png

Let's have a look at the Step by Step instructions to Solve the Maths Brain Teasers 61:: Can You Decode The Sequence?

So here is the logic to solving the puzzle;

The answer provided by @jfang003 is a perfect example to solving this Maths puzzle 61.

Multiply the first two Numbers & then Add the Third number to get the result

854 = (8) * (5) + 4 = 44

625 = (6) * (2) + 5 = 17

987 = (9) * (8) + 7 = 79

Now let's take the row in question;

image.png

050 = (0) * (5) + 0 = 0

Hence the Answer to the Maths Brain Teasers 61:: 0


STEM token GiveAway

I'll be again doing a giveaway of STEM tokens to the lucky random winner with the correct answer. For the last contest, which was Maths Brain Teasers 61:: Can You Decode The Sequence?.

We had 2 entries and I happy to see the engagement by everyone. At the same time, it's great to see the detailed answers provided by everyone as to how they arrived at the solution of the puzzle.. Well done guys.. Way to GO... Now the results part; both the entries provided the correct answer and hence I'm going to split the reward between @jfang003 && @minus-pi; congratulations guys for winning the STEM tokens..

image.png

Congratulations @jfang003 && @minus-pi; You both WIN yourself 8 STEM tokens each. You should be having the rewards in your STEM Wallet Soon.


Math Quote for the Day::

Here is the motivation to solve the Maths Equation Puzzle?

image.png


If you like my work, then please spread the Word.. that we do have the Math Brain Teasers competition here @StemGeeks platform. Reblog is much appreciated.

Best Regards

image.png

Find Me on the Other Social Media Platforms::

health-social-header.png

Join me on LBRY.tv & Earn 15 LBCs for FREE... YES for FREE...
HealthDear Youtube; Information tied to Health
HealthDear LearnTogether; Learn English & Hindi
LearnTogether FaceBook Page





PS:: All the Maths Brain Teasers; are made by me using the Pro Canva License Version

Posted with STEMGeeks



0
0
0.000
7 comments
avatar
(Edited)

thanks, @gungunkrishu

here's my input for this puzzle:
21, 30, 135, 373, 441

edit: 21, 64, 126, 373, 416
thanks @roboticmind!

0
0
0.000
avatar

I think you may have misread 411 as 441 unfortunately as I don't see the number 441 in any of the boxes

0
0
0.000
avatar

lol, true - thanks for the hint! :D

0
0
0.000
avatar

Thanks for the STEM tokens.

21,64,416,126,373 is my answer this time.

21+64+416+126+373=1000

0
0
0.000
avatar
(Edited)

Wrote a quick script in Python to find all of the possible solutions:

(21, 64, 126, 373, 416)
and
(64, 66, 126, 328, 416)

EDIT: only (21, 64, 126, 373, 416) because I misread/mistyped 382 as 328 in my code. Thanks for spotting that @minus-pi


Not my best code, but if you are curious, here it is

import itertools
numbers = [373,135,30,375,126,411,416,64,73,382,66,128,418,21,23,425] 

def hasDuplicate(list):
    existingNums = []
    for num in list:
        if num in existingNums:
            return True
        else:
            existing_nums.append(num)
    return False


ways = []
for choice in itertools.product(numbers, repeat=5):
    if sum(choice) == 1000:
        if not hasDuplicate(choice):
            if sorted(choice) not in ways:
                print(sorted(choice))
                ways.append(sorted(choice))

0
0
0.000
avatar

hehe, I think you made a similar copy&paste mistake than me :D
328 should be 382

You can use random.sample then you don't need to check for duplicates:

from random import sample
nums = [373, 135, 30, 375,
        126, 411, 416, 64,
        73, 382, 66, 128,
        418, 21, 23, 425]

sel = []
while sum(sel) != 1000:
    sel = sample(nums, 5)

print(sorted(sel))
0
0
0.000
avatar

Ah whoops fixed that now. Thank you for letting me know. I tend to mistype and misread numbers a lot, so I'm not super surprised I messed that up :)

I could have done it using random samples, but I had assumed there might be multiple solutions, so I wanted to iterate over all possible ones instead. That solution does work too.

Also, I looked back at itertools's documentation and realized I missed that there is a itertools.combinationsfunction I missed that would work as well and make the code I had simpler.

0
0
0.000