I think I have a solution to a... very much an unkown problem, it's a, this is a problem no one was really looking for a solution for, but I think I found one. So there's a thing called the 10958 problem. To demonstrate what the problem is, I'm gonna start with a little number trick a little something, a little bit of number showmanship. Like all good number tricks, it starts with you picking a number. Can you give me any three-digit number? What would you like? Pick a three-digit number. [Brady: "814."] 814, interesting, okay. And can you give me a single digit? What single digit would you like? It can be one of these. It can be a whole new one. Whatever you want. [Brady: "2."] 2, okay, all right. Here's what we're gonna do. So, I can now tell you that 814 equals 22 times (2 plus 2 plus 2) to the power of 2 plus 22. I mean, if you don't believe me, we can double-check that. 2 plus 2 plus 2 is 6. I'm prepared to accept that as given. And 6 squared is 36. So, this, we now want 22 times 36 plus 22... 22 times 36 equals 792, add 22 equals 814. There you go! You gave me a three-digit number, and I could write it out as an expression using only the digit you gave me. Do you think that is exciting enough to do a second time? [Brady: "Yes."] All right! What would you like this time? [Brady: "998."] 998! You've gone for a large, but not predictably large, number! And what one digit would you like to be used? So we had 2 last time. [Brady: "1."] 1, oh my goodness! You are that– now, obviously, I could cheat, and just write, equals, 1+1+1+1... right, and I could have done that over here, because you happened to pick an even number, and 2, I could have written 2+2... The goal is I'm trying to do it in as few digits written out as possible. So I can actually do 998 as 11 minus 1, will give us 10 to the power of 1 plus 1 plus 1 is just, uh, oh, I've done two pluses there, that is a mega-plus, oh my goodness, that's pretty plus. And so, that's ten cubed, is a thousand, minus 1 minus 1, and there we are! We've landed on 998. I could, I could go on all day. In fact I would, but people would cease watching the video quite quickly. And I can confidently tell you that ANY three-digit number you give me I will be able to write it out using any digit you give me because down here I have a paper with all of them in it. So this is Single Digit Representations of Natural Numbers A guy called Taneja. I'm gonna pronounce that wrong. He is from Brazil, so I've definitely pronounced that wrong. And it's just tables and tables of three-digit numbers and how you write them out. So this is all three-digit numbers done using the digit 4. And then over here, using 6 or 5, anything you want to look up. And so the way I was able to do this is I was cheating. And if you want to cheat, it's really quite straightforward. You put aside a month or two just to memorize this, and then you can cheat with this inside your brain! That's the great thing about, you know, the human brain, you can cheat by memorizing your cheat notes, and then you can look at them without anyone being able to tell. It's, you know, it's a real loophole in life, you can cheat by memorizing things. [Brady: "Also known as learning."] Also known... learning, yeah, oh you learn it, and then you do that, right. [Brady: "And we know that they're all the shortest versions? I mean, how, has he used some sort of rigorous proof that they're the shortest versions?"] That is a really good question. I don't know. He claims these are the shortest. I can't remember if he claims DEFINITELY the shortest or the shortest he's found. He just says they're minimal possible digits. I don't know how he has confirmed that. So if you trust this guy, then these are the smallest, but, they may, I mean... I trust him. [Smooth vibraphone music] Did he stop there? Oh, no. No, no, no, he went one step further. So, let's carry on to, in a different color sharpie, let's do any number below 11111. [Brady: "7415."] 7415, okay. So I can tell you that this can be written as, Here's the other one, this one's a bit longer, so, this one's like 160-something pages, and I'm just gonna look it up. So let's find, [Brady: "Did you memorize that one?"] I haven't had time to memorize this one, you know, you know, if I had another holiday on the beach, I could sit there and memorize this one, too. Ooh, you picked a good one! This one has to use subtraction. Not all of them do. [Brady: "You didn't ask me my digit, my single digit."] You don't get to choose this time, because I'm gonna use all the digits. So you said 7415. 7415 is either negative 1 plus 2 times 3456 plus 7 times 8 times 9 or it equals in brackets 9 plus in brackets 8 times 7 plus 6 times 5 in brackets times 43, close up some brackets, multiply it by 2 add 1. Okay, so there is your number written as all the digits in ascending order, so that's 1 to 9 in order, or all the digits in descending order, that's 9 counting all the way back down to 1, only using multiplication, addition, division, subtraction, and you can have powers. So, only using the simple operations. This guy has also gone through and found every number up to 11111, ascending and descending, using only those operations. [Brady: "This guy's a legend!"] This guy is a legend. I love this guy. And he just does it. He just puts them online. They just, you can just find his papers. Yeah, I'd ration them out. You know, I would have a freemium model where you get ascending for free, but you pay for descending, come on! This is premium content. Right. Or, you don't even get the middle digits. So, now, as you may have realized from the name of this video, there is a problem. And it is the 10,958 problem. If you look up, let's look up 10,958, So it should be right at the end. So there it is there. There's 10,958 in descending order. And if we look up the ascending order, it's still not available. [Brady: [gasp]] It is the only gap in all the numbers up to 11111. It's the first one you come across, as you go up, everything from 1, all the way to here, it's all there, And then you end up with: 'still not available.' [Brady: "So, it's like the Achilles' heel."] It's the Achilles' heel. It's the missing piece, right? It's, you know, it's that little bit, you're like, I've done it all, except for that little bit. Similar to before, I don't know how comprehensive he has been in assembling this list. So he thinks it can't be done. But he, he's not, doesn't seem to have completely ruled out that someone else won't do it. Well, I'm never one to leave, leave something like this, at least give it a go, right? That's the spirit. That's my whole philosophy. It may be an impossible task, but you give it a go, and it's just as much fun, anyway. [Brady: "The Parker Square Philosophy?"] It's the Parker Square Philosophy. It may, you may be up against an impossible task, but you give it a go, even though you're probably not gonna succeed. I don't want to get you over-excited. It's not a perfect solution. But, I think it is. I think it's a perfect solution. But other people may argue otherwise. [Smooth vibraphone] ...divide one by the other, we get pi. Pi was, historically, rarely calculated this way, because it is notoriously inaccurate.
The solution
That's Numberwang!
It's so cool to see someone who loves their job this much
This sounds like something that could be brute forced by a somewhat simple program. Neither of the source papers show any code or talk about an automated finder so potentially they were just done by hand.
Gotta be honest, this guy's pretty charming for a mathematician...
But a bitch ain't one
I am currently churning through all possibilities that do not have powers > 1000 and ignoring unary negation.
closest so far is 0.147 away:
((12) + ((3 / 4)5 - (6 * (7 * (8 / 9)))))
Bad news. This number seems to not have a solution. I finally got implemented a program in MATLAB to test all the operators and parentheses combinations. Here it is what I did:
1- There are 68 combinations of operators between the numbers. The starting "1" can be + or -, which accounts for 2* 68 combinations (the combinations with "-1" I still did not try).
2- The combinations of parenthesis are not so many. I found only 2809 meaningful combinations by restricting the parenthesis to cover at least 2 numbers and, most importantly, to follow a nested structure. The following are the total numbers of meaningful combinations of 1,2,...7 parentheses: 36, 217, 530, 711, 630, 430, 255. A 8th nested parenthesis would not change the outcome of the computation. The total combination sums to 2809 * 2* 68 + 2* 68.
3- Disclaimer: my program did not check such cases: a o ( - b o c ). The digit "b" was always positive in my program.
4- The complete brute force run will need more 4 days to complete. However, I made a run without the division operations (as the author claim it was rarely used) and I have not found a solution.
Unfortunately.
Best regards, Ricardo Neves
If exponentiation is allowed, how about logarithms?