One more logic we can use to make it even simpler. We can easily reach at below two possibilities: _ 4 _ 2 5 8 _ 6 _ _ 8 _ 6 5 4 _ 2 _ Now, as first 3 digits are divisible by 3, and middle 3 digits are also be divisible by 3 (to make first 6 digits divisible by 6), last 3 digits will have to be divisible by 3 also. That funnels down to only 4 possibilities which can be reduced to 2 by checking divisibility from 8. Now check these 2 numbers for divisibility of 7 and you are done.
Hey Paras... that's a lovely approach bro. I completely missed it while i solving it. I 100% agree that your solution is further optimized. By the way, this question officially had no full explanation in the book where it was originally published, so that's a great opportunity for everyone to come up with their solution. Cheers mate!! And thanks again for thinking on the last 3 bits and combining it with divisibility by 8. You're the best :)
Paras, for each combination out of those 4 you got (before checking divisibility by 8), the digits (A,C) is reversible as well as (G,I) which will become 4 permutations. So, the 4 possibilities you mentioned will finally become 16 permutations, I believe. Had you considered this? Or, did I miss some other intermediate steps?
We can change the order of the steps at 4:00. As F is 4 or 8 and FGH is divided by 8, GH is divided by 8. As G is an odd number which is not 5, GH = 16, 32 or 72. As G + H + I is divided by 3, if GH = 16, I should be 2, 5 or 8. But none of them satisfies that I is an odd number and is not 5. So GH = 32 or 72. It gives H = 2 and C = 6, and G = 3 or 7. As D + E + F is divided by 3, F = 4, so B = 8 Again, G = 3 or 7. When G = 3, H = 1 (then {A, C} = {7, 9}) or 7 (then {A, C} = {1, 9}). When G = 7, H = 3 (then {A, C} = {1, 9}) or 9 (then {A, C} = {1, 3}). So we get 8 numbers, so we have only to divide ABCDEFG of those 8 numbers by 7.
@@sanket2866 link? I'm still trying to figure it out. But, again, I'm totally new to programming, so I guess I'm not supposed to look at any solution until I figure out mine😃
Kinda happy to say that up until [2:27] or so I deduced myself. I cracked it but I did so with an excel sheet, starting with 5 in the middle, then the 1st digit, then worked my way up, deleting inconsistencies. Obviously took me far longer but yes! - I solved it and reached the same result. It won't save me from a ticking bomb but hey at least I wouldn't starve in the room. :)
Took me 30 minutes to solve this ... First arrived at the conclusion 183654729 ... Skipped to the end of the video and saw that the first and third digit were interchanged and realized my numerical fault.Counting it as solving though ... As usual great puzzle.
My first few steps are also the same but I used divisibility rule of 8 instead of using "that if a number is divisible by 8 then it must be divisible by 4 and 2" which gives me 5 possible combinations (472,496,672,872,896)
Good puzzle. You can make it more complicated by saying the digits are 0-9; instead of 1-9; and ‘0’ cannot be used as the left most digit. Now readers have to first select 9 digits from 10 digits. There is a solution with ‘0’ as well😎. Try it,
56 ia divisible by 7 but it doesn't have an odd number at its units place . Then how did u conclude that odd number will come at places which r the units position of number divisible by odd numbers ?
Saw this puzzle all too many years ago in a column in Scientific American. Major difference was the 9 digit number was claimed to be a social security number....
Answer: Get a car battery with a buck boost converter with copper coils. Complete the circuit and melt the locking mechanism. Why are you still standing at the lock input console ?
@@manusarda at 6:00 , instead of checking for ABC, check for GHI so ther will be lesser possibilities. Then check for divisibility of 7 Also without using abcd we can just attempt by leaving blank spaces that will make the problem easier
This is why when I am taking interviews my question is "what do you want to do with us ?" In the first minute of the answer I know if we should hire or not. Do you know why ? Because if you're self driven you will learn and do what you want to achieve, the rest is plain stupidity. Most companies are not looking to hire an academic, they want doers. Every doer is an academic inside so we don't have to worry about you making blunders.
🟩 Now just add zero at the end to get the number 3️⃣8️⃣1️⃣6️⃣5️⃣4️⃣7️⃣2️⃣9️⃣0️⃣ Which is divisible also by 10. (Why wasn't the problem in this shape from the first place?) The AMAZING thing here, is not only the great solution, (as always with Ammar) but the fact that there is such a number at all. Thank you Ammar for another great problem 👍❤️
One more logic we can use to make it even simpler. We can easily reach at below two possibilities:
_ 4 _ 2 5 8 _ 6 _
_ 8 _ 6 5 4 _ 2 _
Now, as first 3 digits are divisible by 3, and middle 3 digits are also be divisible by 3 (to make first 6 digits divisible by 6), last 3 digits will have to be divisible by 3 also. That funnels down to only 4 possibilities which can be reduced to 2 by checking divisibility from 8. Now check these 2 numbers for divisibility of 7 and you are done.
Hey Paras... that's a lovely approach bro. I completely missed it while i solving it. I 100% agree that your solution is further optimized.
By the way, this question officially had no full explanation in the book where it was originally published, so that's a great opportunity for everyone to come up with their solution.
Cheers mate!! And thanks again for thinking on the last 3 bits and combining it with divisibility by 8. You're the best :)
@@LOGICALLYYOURS Thanks Ammar. Love this channel. So many interesting lateral thinking problems and creative solutions. So much to learn from you.
@@wholesomeparas1 yeah sir cool approach thnx :)
Paras, for each combination out of those 4 you got (before checking divisibility by 8), the digits (A,C) is reversible as well as (G,I) which will become 4 permutations. So, the 4 possibilities you mentioned will finally become 16 permutations, I believe. Had you considered this? Or, did I miss some other intermediate steps?
@@wholesomeparas1 why last three digit must be divisible by 3
Which u mentioned in your solution in 5th line from last
7:50 instead dividing by 7. We can use divisibilty of 8-number formed by last 3 digit must be divisible by 8
Your videos are normally good, but this was on another level. Really enjoyed this.
This is the first video of yours I have seen, and it was excellent fella! Brilliant work right there! I have subbed! 💯👍🙏
Thanks Richard :) highly appreciated!!
@@LOGICALLYYOURS bro
Why so much break😡
Let's be consistent now😄
We can change the order of the steps at 4:00.
As F is 4 or 8 and FGH is divided by 8, GH is divided by 8. As G is an odd number which is not 5, GH = 16, 32 or 72.
As G + H + I is divided by 3, if GH = 16, I should be 2, 5 or 8. But none of them satisfies that I is an odd number and is not 5. So GH = 32 or 72.
It gives H = 2 and C = 6, and G = 3 or 7.
As D + E + F is divided by 3, F = 4, so B = 8
Again, G = 3 or 7. When G = 3, H = 1 (then {A, C} = {7, 9}) or 7 (then {A, C} = {1, 9}). When G = 7, H = 3 (then {A, C} = {1, 9}) or 9 (then {A, C} = {1, 3}). So we get 8 numbers, so we have only to divide ABCDEFG of those 8 numbers by 7.
It took me 3 hours to solve this. It made my day🤗.
Same here.😂 One and a half hour though.😅
I wrote 119 lines of python code to brute force the result
@@bm-ub6zc In how much time did your code give out the number?
@@haleshs66 4 days!
@@bm-ub6zc34 lines of python code (2h 10m)
I felt so guilty and dirty checking all possibilities for 7 that it's quite relieving to know it was the only way to go about it.
Excellent work....your way of explanation was easy and fantastic
I solved it exactly same but was stuck at divisibility rule of 7, so saw your solution and felt relaxed 🤘😇❤️
Thanks Manshul for your feedbacks on my videos :)
I wonder how to writre a program that'll crack it using divisibility rule.
Please give it a try... that'll be awesome to see the code. But i believe it shouldn't be difficult at all, except its optimization.
Using Backtracking Solved it..
@@sanket2866 link? I'm still trying to figure it out. But, again, I'm totally new to programming, so I guess I'm not supposed to look at any solution until I figure out mine😃
@@TheJackal917 For quick start you can use Heap's Algorithm to generate all permutations of 123456789. For each number check if it fits the condition.
Channel providing value to our life
Great...show more of such puzzles 😊
Whenever8 I feel low or disturbed.. I search for something engaging. Especially I love mathematical riddles. This is good one. I solved it in 5mins
Amazing... Clarity of thinking so key
Kinda happy to say that up until [2:27] or so I deduced myself. I cracked it but I did so with an excel sheet, starting with 5 in the middle, then the 1st digit, then worked my way up, deleting inconsistencies.
Obviously took me far longer but yes! - I solved it and reached the same result.
It won't save me from a ticking bomb but hey at least I wouldn't starve in the room. :)
This is awesome. And magic of mathematics
Thanks for sharing! Stay healthy!
❤❤ brilliant
Alhamdulillah... I solved it by a different method which is more easier. 😊
Took me 30 minutes to solve this ... First arrived at the conclusion 183654729 ... Skipped to the end of the video and saw that the first and third digit were interchanged and realized my numerical fault.Counting it as solving though ... As usual great puzzle.
I also get this and I think it's a better solution bcoz there is a pattern ( table of 9) easy to remember for future 😅
mazaaa aggya swaaad🔥🔥🔥🔥🔥🔥🔥🔥
i wrote 119 lines of python code to brute force the result. does that count too?
I tried solving this myself but miscalculated on the “divisible by 8” part
My first few steps are also the same but I used divisibility rule of 8 instead of using "that if a number is divisible by 8 then it must be divisible by 4 and 2" which gives me 5 possible combinations (472,496,672,872,896)
BEST CHANNEL FOR SHARPING THE RUST OF BRAIN
From many answer one is... 123,252,561
It took me 10 mins bt i did it
Not a vaild solution!
Because of the 2nd rule at 0:50
REALLY LOVED IT
Good puzzle. You can make it more complicated by saying the digits are 0-9; instead of 1-9; and ‘0’ cannot be used as the left most digit. Now readers have to first select 9 digits from 10 digits. There is a solution with ‘0’ as well😎. Try it,
56 ia divisible by 7 but it doesn't have an odd number at its units place . Then how did u conclude that odd number will come at places which r the units position of number divisible by odd numbers ?
I got the secret code answer as 987,654,123.
I got to where you were at 2:50 and then gave up and wrote some javascript to brute force it.
Hello sir after long time...👀
I'm so sorry... now you'll see videos timely :)
Revision of divisibility rule😊
Saw this puzzle all too many years ago in a column in Scientific American. Major difference was the 9 digit number was claimed to be a social security number....
Yay, new puzzle!
It was very tricky puzzle. I was able to get only first 5 digits but by different method.
Well tried Dollcy :)
Answer: Get a car battery with a buck boost converter with copper coils. Complete the circuit and melt the locking mechanism.
Why are you still standing at the lock input console ?
8:27 I never knew that before
you always say that you'll post new riddles every week, but you never do that. kindly be more regular.
you're posting after around 14 weeks, that is like 3 months
I really feel sorry for the delay... it happened due to some office related engagements. But I will certainly focus on timely video uploads.
@@LOGICALLYYOURS thank you so much for considering. I'm really fond of all your videos, that's why I desperately wait for the next one
Feels like im playing sudoku
I solved this by myself.
This is like silent hill game riddle when you choice extra difficulty
An excellent riddle. Solved it halfway through, made a mistake somewhere around divisibility by 7 and erroneously arrived to 147258369.
i thought we were going to crack out a formula for this
It is actually interesting and easy for class 10th students... 😁😀😃 I did it in a couple of minutes
can you share your approach here.
because solution shared by ammar will atleast take half an hour.
@@manusarda at 6:00 , instead of checking for ABC, check for GHI so ther will be lesser possibilities. Then check for divisibility of 7
Also without using abcd we can just attempt by leaving blank spaces that will make the problem easier
Wht abt 9! ??
This is why when I am taking interviews my question is "what do you want to do with us ?"
In the first minute of the answer I know if we should hire or not.
Do you know why ?
Because if you're self driven you will learn and do what you want to achieve, the rest is plain stupidity. Most companies are not looking to hire an academic, they want doers. Every doer is an academic inside so we don't have to worry about you making blunders.
Enough Maths for today.
FUN!!!!
I am in that 5% population
Obviously.
123,252,561
Two twos
E
Haha
My answer is: 381654729
Also the number 7 here is really annoying that it kept giving me decimal.
I think i use multiple number, so my ans is 162858564. It is also right 😂 as my aspects.
Took me only 5mins and my ans came out to be 182654729 which is also correct
That's why it is wrong
123654321
🟩 Now just add zero at the end to get the number
3️⃣8️⃣1️⃣6️⃣5️⃣4️⃣7️⃣2️⃣9️⃣0️⃣
Which is divisible also by 10. (Why wasn't the problem in this shape from the first place?)
The AMAZING thing here, is not only the great solution, (as always with Ammar) but the fact that there is such a number at all.
Thank you Ammar for another great problem 👍❤️
Because it will create a lot of complexity & now there are multiple solutions because of it
123,252,561
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E
E