This is probably my favorite video I've made yet. It's about an underrated mathematical concept known as "integer complexity" and my personal journey to discover it. 0:00 - Introduction 1:20 - A Mathematical Question I Stumbled Into 3:23 - Discoveries Among the First Dozen Numbers 6:49 - What is the Largest Number We Can Build? 11:19 - Number Webs With Mysterious Gaps 13:54 - Incorporating Subtraction and Division 17:23 - How I Found the Name of this Concept 21:00 - Further Directions We Could Take This 24:40 - A Philosophical Question I Stumbled Into 27:27 - Outroduction (see video description for more links and info!)
here is a programm that generates all numbers with complexety 25 or lower by using multiplication or addition. maxlen=25 numbers=[(1,)] representation=dict() representation[1]=(1,"1") for w in range(2,maxlen+1): newnum=[] for i in range((len(numbers)+1)//2): a=numbers[i] b=numbers[-1-i] for x in a: for y in b: if x+y not in representation: n=x+y newnum.append(n) representation[n]=(w,f"({representation[x][1]}+{representation[y][1]})") if x*y not in representation: n=x*y newnum.append(n) representation[n]=(w,f"({representation[x][1]}*{representation[y][1]})") numbers.append(newnum) print(f"found {len(newnum)} new numbers of length {w}") for i in range(1000): if i in representation: length,r=representation[i] print(i,length,r) else: print(f"could not find {i}")
Absolutely riveting! I have been digging into the sequence (of integer complexity) for a few days and found some cool stuff, but you brought up the e thing and I hadn't even realized that was why the (2^a)(3^b).. that's so cool.
The fires are locally unstable, if it starts it finishes long before it could start again :) lastly I've seen some math freethinker video about the planet diameter that would need to be to be Able to keep an alcohol vapour flame to keep up with sunset cycle or so on, Mr Mould
I like to imagine that he's just going through his day and suddenly he thinks up a next sentence to say in his video, so he records it in any place where he is at that moment.
I imagine he also has an interest in the cosmos and geology. So technically he can introduce himself as someone who studies astronomy, crystals, and number theory. Bonus points if he switches out the lab coat for a woven hemp poncho.
I fully believe that one day Domotro will discover some sort of eldritch mathematical concept that opens his mind to some horrific elder god which will drive him absolutely mad. And nobody will notice the difference.
“There's evidence in the arithmetic record that the study of formal systems reached a pernicious apex in the Long Before. Advancements made by mathematicians such as Russell, Gödel, Eisencruft, Atufu, Wheatgrass, and System Star contributed to the understanding of notions like undecidability, pointed regularism, and abyssalism. Upon reaching this minimal degree of mathematical maturity, equipped with sophisticated grammars, researchers set out to experiment with the limits of expressibility. They contrived bold research programs and galloped into the mathematical wood, unwitting of the dangers that brood there. The record is even scarcer than usual, due to the efforts of successive generations to obfuscate the venture. As best as I can gather, at some point in the course of inquiry, a theorist from a mathematical seminary called the Cupola formulated a conjecture on the fragility of formal semantics. The conjecture ripened to a broader theory, out of which spawned a formal system called the penumbra calculus. In the few fragments of texts that predate the obfuscation, it's stated that, in the penumbra calculus, certain theorems are provable, but are falsified upon the completion of their proofs. As much as this result is at odds with the systems of thought I've encountered in my own inquiries, I find little reason to doubt the veracity of the authors. Nevertheless, it's certainly a peculiar property. The Cupola theorist's results erupted into a grand investigation into the expressibility of the penumbra calculus. The conclusions were troubling. Pushing further, researchers constructed sister systems with alternate axioms. These systems were still more fragile, with the systems' inference rules themselves unraveling upon the completion of certain proofs. Convinced that their discoveries were made possible by some idiosyncrasy of self-awareness, but synchronously fearful of the implications of their results, some schools of theorists engineered complex automated deduction systems to probe boundary theorems and launched them into neutron stars. The outcome is undocumented, but the result convinced theorists across the Coven to abandon research and blacklist anyone who studied the penumbra calculus and its derivative systems. Peculiarly, support for the injunction was unanimous. Of note, even the spacefolder Ptoh agreed to abandon its investigation into the forbidden calculi from the reaches of its bleak star. Though the manner of its consent was not without controversy; to announce its accord, it inverted the color charge of quarks in a small region of space, causing a research station to collapse in on itself. Nonetheless, Ptoh's consent is testament to the degree of existential anxiety that could cause investigation into the penumbra calculus to go dark.” - On the Origins and Nature of the Dark Calculus
@@Teapotman2 like guess I can assume nobody died cause the videos out lol, but I was genuinely concerned about how big that fire was and how close it was to a structure 😅
Worth remembering as well, while it's a website these days, it's actually far older than the web. For decades it was stored on paper in filing cabinets.
Also don’t sleep on their superseeker function - send an appropriately formatted email with a sequence and it will not only check if it matches any existing entry but it will perform a variety of transformations to try to find a match.
Thanks to this website I finally found out that someone had already discovered the sequence "0, 1, 10, 2, 100, 11, 1000, 3, 20, 101, 10000, 12, 100000, 1001, 110, 4, 1000000, 21..." before me.
I think it's fun to extend this to other numbers. For example with 4, you get the funny possibility that fodd sounds like quad, but every thing made of quads must be feven.
Its a funny way to describe dividing and taking the remainder. It has its own operator "modulo" and is defined as % in programming languages. So if your Integer has remainder 0 when divided by 3 its "threven", and remainder 1 is "throdd" but what is remainder 2 called?
@@tinyturtle1898pretty sure that is still throdd. The only threeven numbers are those evenly divisible by three. Just like the only even numbers are those evenly divisible by 2.
As far as I know they are terms he made up. He specifically defined "threeven" in a previous video as divisible by 3 but it is such a great portmanteau that no definition is required. Truly inspired.
I was bizarrely discussing about this same thing with my cat the other day while high. However, I wasn't able to find anything about it on the internet and ended up forgetting it. It's such a mystique coincidence for you to have posted this video so close to those thoughts, thank you
This doesn't quite hold in general (take 10^1 > 1^10 as a simple counterexample). In fact, with b > 2e - 1, you can always find a small enough number 0 < x < e - 1 such that (1 + x)^b < b^(1 + x) (note that since b > 2e - 1, we have |b - e| = b - e > 2e - 1 - e = e - 1 > e - 1 - x = e - (1 + x) = |(1 + x) - e|, so (1 + x) is closer to e than b is). this can be seen heuristically as the left hand side can be approximated by (1 + x)^a ≈ 1 + ax for small enough x, while the right hand side tends towards a as x tends towards 0.
@@SirNobleIZH That's true, if you only count integers (and include the equal case of 2^4 and 4^2), then the result holds. Other counterexamples if we allow non-integers are e.g. 1.5^5 < 5^1.5 (approx. 7.59 and 11.18, respectively)
This feels tailor-made for people with ADHD. There's never a moment to get bored because there's always something new on screen to pay attention to while listening.
This just showed up in my feed, first time watching one of your videos. As a math major myself, I truly admire your mad mathematician vibes, with your calculations done in the wold with no clear uses, the true calling of all mathematicians.
Just hang around with this guy. He started way back with much more simple principles and systems and it has been fun seeing the progression; from the maths and the mad mathematician
Hi! I'm one of the mathematicians who has done some work on Integer Complexity, especially work with Harry Altman. A few quick notes: A related fun open problem: do powers of 2 have the obvious complexity? That is for any n>1, is the complexity of 2^n just 2n? Also, I gave a version of the Gaussian problem as a research problem to a student group a while ago. There work is I believe still under review. Edit: Your thoughts about rationals are interesting. I think you are correct that that problem has not had much work (or at least if there is work on it, I don't know of it). To some extent, your 5/6 example seems to be taken advantage of "Egyptian fractions" which are ways of writing a number as the sum of fractions of the form 1/a for various distinct a. In particular, for 5/6, you are using that 1/2 + 1/3=5/6. Frequently it seems that using an efficient Egyptian fraction representation for a number will give rise to a low cost way of writing that fraction.
For the open problem: yes assuming a strong version of the generalized Catalan conjecture. Conversely, if we can prove this then we have some control on the subcase |2^m - 3^n| = k in the conjecture.
@@aadfg0 Yes, they are closely related. It turns out also to be related to what the base 3 expansion of power of 2 can look like. The claim implies roughly speaking that powers of 2 cannot have disproportionately many zeros in their base 3 expansion.
I want to float the concept that if we're bringing in fractions, we're no longer in the realm of integers. So at that point we'd need to start talking about Rational Complexity, no? Also, using exponetiation, division and subtraction I can bring it into Complex Complexity with 6 1's to make an i, by writing it as (1-1-1)^(1/(1+1) I don't know how to get to the transcendentals though, so it'd be Complex but with gaps in the number lines. Which is a weird concept to think about.
On that last philosophical point: there's also this feeling that if the new thing you discovered hasn't been researched before, that it's perhaps too contrived or useless or uninteresting. It's not too difficult to discover a sequence that isn't on the OEIS, but you have to ask yourself if you were motivated purely by the math, or if you were motivated by finding the lowest hanging fruit of undiscovered (uninteresting) math. If something you discovered has been researched before, at least you know it's important enough to have been worthy of the time and effort of serious mathematicians. If not, you're left wondering how important your discovery really is, even if it is new. To analogize this to exploring islands, if you discover a new island, and it's extremely rich in natural resources, nature, hospitable for humans, spacious, etc., chances are, someone has already discovered the island, and people already live on it. If, however, you discover an island that truly no one has discovered before, chances are, it's probably just a small rock full of bird poop. Should you be excited in the first case or in the second case? The second case is your original discovery, but it's also less meaningful and useful than the first case, but the first case isn't your original discovery. Rather than be disappointed in either case, may as well be excited in both cases. Like you said, if it hasn't been discovered before, that's an awesome feeling. Even if the reason for it not having been discovered before is that it is somewhat contrived, it was clearly interesting enough for you to stumble across naturally. You should feel proud in that case. If the thing you discovered has been discovered before, and researched before, you should feel proud that your mathematical intuition is well-honed enough to tread the same paths that the giants before you have. You should also feel excited that you can skip to the front of the line. The foundations and path has been built for you, so you have no excuse to not rush to the frontier as fast as you can (by learning and studying and catching up on research) so you can start making new discoveries from a different (more developed, new) starting point.
Quoting: Seabird poop-sometimes called guano-was the “white gold” of fertilizers for humans for millennia. Rich in nitrogen and phosphorus from birds’ fish-based diets, the substance shaped trade routes and powered economies
@@josephsummer777 I was half joking when I said bird poop because of that, but maybe that's a point in and of itself. Even what seems like the most useless of discoveries can turn out to be a life-changing resource.
Flawed logic. Implies both the valuable and worthless islands have all been discovered before you, but the worthless islands were just never claimed or inhabited. So the discovery wasn'tnovel in either case. However, the assumption is that somebody has been there before, which isn't necessary. Over time it becomes more unlikely but still possible to discover truly novel things, both valuable and worthless novel things. Some unclaimed sequence in OEIS may have never been found before you found it.
Incredible coincidence that this video found its way into my recommendations. A few weeks ago I encountered exactly this problem while working on an idea about bypassing some filter in a program that blocked digits, but allowed string like ‘true’. By using things like ‘true+true+true’ which equals 3, I could create numbers that I needed. But it would take a lot of text to create, say, the number 100. I realized that through multiplication and parentheses I could create larger numbers more quickly but had to figure out an algorithm to generate these. It ended up being a pretty messy brute-force algorithm but I could generate the equations for the numbers I needed with exactly this idea!
Thank you for filming this outside. It is strangely comforting to see surfaces illuminated by the sun or places covered in mud due to rain, maybe it's because I don't go out much
really interesting how all of the low numbers feel like they have a pattern until you reach a big number and that pattern just shatters, incredible how common it is (talking about the primes being one bigger than the ones below)
I was inspired to come up with the following generalization: Let the cost of one 1 be zero, the cost of addition be A and the cost of multiplication be B. What's the cheapest that we can buy an integer for? The integer complexity defined in the video is equivalent to letting A = B = 1 (and adding 1, as you set the cost of 1 to be one, while it would be zero for me). I think a very interesting case comes up when we set B = 0. The first few values of the cost of n are equal to the optimal values for something called "addition chains". The first value where they differ is n = 23. I think I might study this more in detail! Thank you for letting me know about this topic.
rly interesting how this method is used to construct integers irrespective of bases. rly looking forward to the video on eulers constant. its role in number bases is rly intriguing and im excited to learn more
Love your enthusiasm for presenting obscure mathematics with the most chaotic energy possible. Changing the set of available operations from {+, *} to instead include all hyperoperations {+, *, ^, tetration, pentation, ...} might be an interesting way to extend the topic, to me it "feels" less arbitrary than cutting off the set of operations off after the first two.
I have studied the unique way to write a positive integer using only the prime function: p(n)= the n-th prime, and the integer 1. 2=p(1) = () 3=p(2)=p(p(1)) =(()) 4=2*2=p(1)*p(1) =()() 5=p(3)=p(p(p(1))) = ((())) 6=p(1)*p(p(1)) = ()(()) This can be mapped into the number of ways of Dyck numbers: counting the number of ways of a string of Xs and Os (X = left parentheses O = right parentheses) so that in any initial segment there are more Xs than Os.
This video was enthralling, I'm so glad you survived filming it. But most of all, your philosophical point at the end was important for anyone working in research.
@@defenestrated23 Me too, although I think I have a twist that prevents me from being able to actually string those clips together into a whole thing other people can see.
Lol I could be wrong but as far as I know this guy never said anything about being neurodivergent. Maybe he makes a video like this because he has a unique personality and perspective on the world, just like anyone else. Funny how we can essentially call people mentally ill with no blowback using this new PC word “neurodiversity”.
@thecoolv130 He doesn't have to say it to be true. It's more common than you think for people to not realise or find out until they're 40. He's either a truly incredible actor or he is on the spectrum, heck he's the kind of person one would be better off calibrating the tests to!
*This* is what the internet is for in the area of math, just putting out there ideas & concepts you have encountered/thought of and hopefully eventually someone will find it and can think on it, give a new set of eyes. We can advance with mostly unheard of or new ideas that no one would have really taken the time to dive into, that would have been forgotten otherwise. Occasionally, inevitably someone will think of something new. Instead of forgetting about these things and just going “huh. Whatever.”, *document it* in some way. Even just write it down in a notes app or something, but preferably in a way that will make other people think about it.
Friend: 📞 "Hey D, wanna come out tonight? Have some fun with people?" D: "No way, I'm figuring out how many 1's go into numbers tonight and for 2 weeks straight."
It's crazy to see a video on my home page of the almost exact topic that I was investigating yesterday. I was trying to find an answer to the problem: What is the minimum of ones that I need to use to form all the numbers? (using addition, multiplication, exponentiation, tetration...) Great video!
This reminds me of some recent homework I was doing for computer science in university! First we had to write a dialect of the esoteric language P′′ (P double prime) in C. Then we had to write code in this language to do something basic like add two numbers together or print a message to terminal. Each character of the code is a single instruction/operation such as incrementing or decrementing by 1, or performing something in a loop (functionally the same as parentheses for multiplication). Long story short, I went down a bit of a rabbit hole trying to optimise my program to make it as short as possible and I found similar patterns to yours, especially around Euler's number.
The whole thing is dope. From the form to content, without forgetting the feeling of epiphany when you finally find the keywords to quenching your curiosity. 💯
The fact that you just found some interesting little problem, worked out some solutions, and struggled to find out other ways people had experimented with this idea until you found the OEIS, and THEN you learned that plugging in your solutions brought you to this whole concept... It is so freaking cool and I'm so happy for you that you found it like this. This is insanely fun!
This was a rather interesting concept. It reminds me a bit of floating point arithmetic. In fact, in many ways, your question about non-integer numbers is a question of floating point representations. Floating point might not be the right word to use, but I think you might understand what I'm saying.
I have actually thought a lot about the section "What is the Largest Number We Can Build?" before seeing this video. I also came to the conclusion that you would be using 2s and 3s a lot. Wonderful video for those who like number theory and pure mathematics!
This is super interesting! This sounds a bit related to height functions in diophantine geometry, where they are used to quantify the "complexities" of solutions (complexities of rationals, Weil complexity of algebraic numbers, etc.), although integer complexity seems to have a more "combinatorics" feel to it. I wonder if the connection goes beyond face value, that would be super cool!
16:30 Well yeah, you build up with multiplications of 2 and 3. Of course a division would cost even more one's. Moments later, WTF?! HOW??? Also, I expected you to mention something like "to the power of". (1+1)^(1+1+1) = 8 Which reduces the number of ones from 6 to 5. Great video. Happy THE squirrel is still around. Have you named it yet?
Why would we stop to powers ? What about tetration or even stronger ones ? The question i had myself is about if substraction was allowed or not, since i’m pretty sure numbers 31 or 63 would be more optimized by taking (the formula for 32/64)-1 than the formula for 31/63 without substraction. Same for numbers like 62, that would be the most efficient by doing 31×2, with 31 having a substraction in it’s formula Edit: i literally wrote that when i was 1 minute before he was talking to it, nvm
Division is helpful since if you have your number, call it n, and you are trying to make it, then there are four basic ways, you write n = a * b, a + b, a - b, a/b. If division is ever useful, then some number needs to have a minimal cost of the form n = a/b. Now how can this happen? You want a number n such that bn has a small cost. If bn is very close to a number of the form 3^k, then its cost will be small. In fact, I would not be surprised if the cost of numbers of the form (3^k+1)/2 have this as their form with the least cost for k sufficiently large.
Really powerful point about being grateful for those who have already solved the problems we're working on. I think the fire and destruction is probably unnecessary, what you do is already cool enough.
Adding more functions results in needing less 1s. You can even say that for every number y there even exists a functions Fn so that Fn(1) = y Allowing more functions reduces the costs at the number side. However it increases the costs at the function side. So you need to evaluate the total costs as a sum of the number side and the costs of the amount of functions you need. However you can not simply add them as it are different things and the costs of a number is not always per definition the same as the costs of a function. Regarding e.g prime numbers there is a function Fp(x) that gives the x-th prime number. So even if you don't know the next value in a sequence you already can descibe it using a function.
Hey man, I only knew you for your shorts, I didn't know you actually knew math. Let me tell you, this video is amazing, I've never been interested in number theory until now. Keep it up ❤
This is cool. I always had trouble making sense of shuffling patterns. In high school I would shuffle poker chips and looked at how many times it takes for a stack to return to it's original permutation when doing perfect shuffles. I made a small program on my calculator to do this but I never understood the math behind it (I think it's some group theory stuff). I didn't pursue mathematics but I think I might learn more about this from the OEIS.
@@quentind1924 Of course, this is a very silly little mistake. I am learning english and my math background is not the best, so I am happy for any mistakes I find. The videos from this channel are great.
as a computer scientist i would be absolutely delighted to find a way to algorithmically define a bunch of the functions behind integer complexity, when i find the time im definitely going to write a paper about this!
Your mind seems wildly tempered in wonderful ways, I would love to sit down and talk shop about large number theory and complex relative maths. The video was a wild ride and is worth recommending to a friend.
Additively I'd like to give you another indexing idea that I think will lead to the future of number theory, if Pi is infinite we could theoretically have all numbers derived from Pi and using either their integer value to return different values (0 gives 3, 1 gives 1, 2 gives 4 but say 0~2 would be 14) to eventually have computers look at all numbers as their related index of pi, depth of relation of numbers and since it goes on indefinitely you could get all values eventually when they are all tallied.
10:35 For anyone seeking explanation, imagine you split 10 into x pieces. In this case he set x=4 which results in (2.5)(2.5)(2.5)(2.5)=(2.5)^4 Using this pattern we can define this as: f(x) = (a/x)^x =e^(x ln(a/x)) (The variable a is the amount of ones we can use, in this case it would be 10) Which if you derive you get: a^x (1/x)^x (ln(1/x) - 1 + ln(a)) = 0 First two cannot be 0 since x is a real number -ln(x) - 1 + ln(a) = 0 x=e^(ln(a)-1) x=a/e But remember that we split "a" ones into "x" pieces So every piece would have the value a/x, plugging x=a/e You get that it should be exactly e!
You might want to look into Kolmogorov complexity that generalise all the questions you are asking. It is pretty straightforward, under this framework, to demonstrate that, given a complexity k, only an exponentially small fraction of numbers in a range can be expressed with less than k operations. The framework talk specifically about "programs" (like computer programs for turing complete systems) but you can easily see the similarities. Also, note that since for example multiplication can be defined in terms of addition, the complexities under different set of operations can differ only by a constant (e.g. the complexity of the definition of "multiplication" in terms of addition). Kolmogorov complexity is in fact the minimum length of a program across all possible set of operations. However, since we think we can compute only what a Turing machine can compute, every computer language (C, python, etc.) would allow to reach the same complexity for a number (only differing by a constant value).
i totally love problems in math where it's a completely 'natural' question - something you'd actually start wondering while on the toilet another example includes: does every closed curve contain four points that can be connected to form a square?
Or the other partitioning of THE ONE problems ;). I think the answer to this one is NO, I am thinking about a roman arc with widening side walls and with skewed flat floor and I can't find the vertically symmetrical square but maybe tgere is some skewed square ,didn't check all possible squares :)
if you modify it slightly so that the square and the curve don't have infinitely many intersections, you can cut a circle in half and connect the two halves with parallel lines
There's something I've been thinking about ever since your video on what operations really were. Sequence/Counting > Adding (Counting in groups) > Multiplying (Adding in groups) > Exponentiation(Multiplying in groups) etc And originally I assumed that going the other way would work the same, but it breaks down by division. Division isn't subtracting in groups, hell sometimes the answer is bigger than the factors. So then, what IS division? The explanation of it just being multiplication's inverse is super unsatisfying, and I can't help but think there's more to it. It isn't subtracting in groups, but it is still grouping. Only it groups the answer rather than the factors. Would love to hear more about the subject if you're able!
I was looking at the same thing recently, was having ChatGPT start by explaining one and zero to me, see how far I could get. When it came to division, it actually popped out something that is entirely relevant to this question. I was specifically questioning this very thing, why division is the inverse of multiplication, and why we can't divide by zero. It said something like division is specifically the process of asking the question 'how many times can I subtract a given number from the number I started with', and that's why we can't throw zero in, because there is no number of times you can subtract zero from another number to reach anything different. I've never seen it described exactly that way before, and it actually did
You can extend this concept by adding ones and twos to get a number, for example 2 needs 1 number, thats 2, 3 needs 2 numbers 1+2, and so on. Also you can keep adding numbers, like 3,4,5, etc. Great video!
i love it!!! i can't believe that you checked 50,000,000 and it was only 221,174 larger! also, i relate SO HARD to the last section about the paradox of rediscovery! i definitely think i lean toward disappointment upon discovery when i know it's something i'd be able to fully understand and handle myself, and excited/relieved when it's a complex topic i want some help with
Glad you related! In case you're not joking about the 50,000,000 thing (or in case anyone else needs clarification) I should clarify that I did not check that many numbers myself. I checked about 50 numbers manually for different combinations of operations. The "I didn't check more than 50 million numbers" line was just saying that was how many numbers I would have had to check if I were to have found the next statistic myself.
Complexity in comp sci is a measure for the amount needed of some abstract resource. That can be time, space in bits, area for a circuit, circuit depth, gate count, edges in a graph, or how many "ones" you need for integers.
My thoughts just go toward continuing up toward bigger operations. Exponents, tetration. How does the integer complexity change when those are considered. Like if 9 is (1+1+1)(1+1+1) with just addition and multiplication, but is (1+1+1)^(1+1) with exponents.
The most satisfying situation I got to was when I was doing some personal programming languages research during university and got to the point where some of the questions I was coming up with were things that people were only investigating in the past few years. I could still go look at other people's thoughts about it, but it was confirmation that I really was approaching new stuff.
Isn't this just "prime factorization" extended to include operations other than the usual multiplications? 4 = 2 * 2 (simple prime factorization, and the "cost" is simply the addition of factors) or 2 + 2 (4 ones) 5 = 2 * 2 + 1 (prime can't be factorized, so we include addition operation) or 1+1+1+1+1 (5 ones either way) And because each number can be written as x = 1 + 1 + ... x times, we can say that each number has a maximum cost of X ones. so, for 5, you can just write 5 ones. 6 = 2 * 3 (5 ones by using prime factorization). 7 = 2 * 3 + 1 (prime number can't be factorized, reuses cost of previous factorization and adds one) and so on. The whole (2^a) * (3^b) is simply a consequence of all prime numbers (greater than 3) being of the form 6k + 1 or 6k - 1.
I think it's very cool that Daniel Bryan has enough free time to be a math youtuber. Seriously though, I love your videos. The topics are untouched by other math channels and your video style is totally unique on top of that.
Cool topic. I can't recall if I have come across this before. Certainly not in school. Such a tantalizing thing mathematics is. A brilliant universal language that taunts you into believing that all of its universe of subtopics possess some degree of real world relevance even when most show no sign whatsoever!
You can think of this as a special case of Kolmogorov complexity from algorithmic information theory. The Kolmogorov complexity of a string of text is the length of the shortest computer program which produces the string, in a given programming language or Turing machine encoding. It's a really profound definition related to Cantor's diagonal argument, the halting problem, and Gödel's incompleteness theorems.
This is probably my favorite video I've made yet. It's about an underrated mathematical concept known as "integer complexity" and my personal journey to discover it.
0:00 - Introduction
1:20 - A Mathematical Question I Stumbled Into
3:23 - Discoveries Among the First Dozen Numbers
6:49 - What is the Largest Number We Can Build?
11:19 - Number Webs With Mysterious Gaps
13:54 - Incorporating Subtraction and Division
17:23 - How I Found the Name of this Concept
21:00 - Further Directions We Could Take This
24:40 - A Philosophical Question I Stumbled Into
27:27 - Outroduction
(see video description for more links and info!)
sounds like Kevin from Vsauce.
here is a programm that generates all numbers with complexety 25 or lower by using multiplication or addition.
maxlen=25
numbers=[(1,)]
representation=dict()
representation[1]=(1,"1")
for w in range(2,maxlen+1):
newnum=[]
for i in range((len(numbers)+1)//2):
a=numbers[i]
b=numbers[-1-i]
for x in a:
for y in b:
if x+y not in representation:
n=x+y
newnum.append(n)
representation[n]=(w,f"({representation[x][1]}+{representation[y][1]})")
if x*y not in representation:
n=x*y
newnum.append(n)
representation[n]=(w,f"({representation[x][1]}*{representation[y][1]})")
numbers.append(newnum)
print(f"found {len(newnum)} new numbers of length {w}")
for i in range(1000):
if i in representation:
length,r=representation[i]
print(i,length,r)
else:
print(f"could not find {i}")
I can't help wondering if this might form part of the proof of Collatz conjecture.
Absolutely riveting! I have been digging into the sequence (of integer complexity) for a few days and found some cool stuff, but you brought up the e thing and I hadn't even realized that was why the (2^a)(3^b).. that's so cool.
Hey you could try creating a video in numberphile!
I'm glad you're free-range, I'd be terrified to see what would happen if you were contained
The fires are locally unstable, if it starts it finishes long before it could start again :) lastly I've seen some math freethinker video about the planet diameter that would need to be to be Able to keep an alcohol vapour flame to keep up with sunset cycle or so on, Mr Mould
Lol!
Industrial mathematicians aren't good for your arteries...
Looks to me like he's been kept caged for a long time
@@joefarrow1599 Chastity? 😳
I like to imagine that he's just going through his day and suddenly he thinks up a next sentence to say in his video, so he records it in any place where he is at that moment.
@anonemos, I kinda thot of it as steam punk b4 steam power was invented -- but looking at it thru a Picasso lens.
This is the most flat earth theory vibe I've ever seen on a video that has actual substance
I imagine he also has an interest in the cosmos and geology. So technically he can introduce himself as someone who studies astronomy, crystals, and number theory. Bonus points if he switches out the lab coat for a woven hemp poncho.
@soingpeirce LOL What a wonderful way to describe it!
I read this reply and chuckled and then he said "threeven" and I understood it
The difference being that a flat-earther will never actually do the math.
@@yurisich not astronomy, "the stars"
I fully believe that one day Domotro will discover some sort of eldritch mathematical concept that opens his mind to some horrific elder god which will drive him absolutely mad.
And nobody will notice the difference.
I was about to say, how do you know that hasn't already happened?
That seems to have already happened
“There's evidence in the arithmetic record that the study of formal systems reached a pernicious apex in the Long Before. Advancements made by mathematicians such as Russell, Gödel, Eisencruft, Atufu, Wheatgrass, and System Star contributed to the understanding of notions like undecidability, pointed regularism, and abyssalism. Upon reaching this minimal degree of mathematical maturity, equipped with sophisticated grammars, researchers set out to experiment with the limits of expressibility. They contrived bold research programs and galloped into the mathematical wood, unwitting of the dangers that brood there.
The record is even scarcer than usual, due to the efforts of successive generations to obfuscate the venture. As best as I can gather, at some point in the course of inquiry, a theorist from a mathematical seminary called the Cupola formulated a conjecture on the fragility of formal semantics. The conjecture ripened to a broader theory, out of which spawned a formal system called the penumbra calculus. In the few fragments of texts that predate the obfuscation, it's stated that, in the penumbra calculus, certain theorems are provable, but are falsified upon the completion of their proofs. As much as this result is at odds with the systems of thought I've encountered in my own inquiries, I find little reason to doubt the veracity of the authors. Nevertheless, it's certainly a peculiar property.
The Cupola theorist's results erupted into a grand investigation into the expressibility of the penumbra calculus. The conclusions were troubling. Pushing further, researchers constructed sister systems with alternate axioms. These systems were still more fragile, with the systems' inference rules themselves unraveling upon the completion of certain proofs.
Convinced that their discoveries were made possible by some idiosyncrasy of self-awareness, but synchronously fearful of the implications of their results, some schools of theorists engineered complex automated deduction systems to probe boundary theorems and launched them into neutron stars. The outcome is undocumented, but the result convinced theorists across the Coven to abandon research and blacklist anyone who studied the penumbra calculus and its derivative systems.
Peculiarly, support for the injunction was unanimous. Of note, even the spacefolder Ptoh agreed to abandon its investigation into the forbidden calculi from the reaches of its bleak star. Though the manner of its consent was not without controversy; to announce its accord, it inverted the color charge of quarks in a small region of space, causing a research station to collapse in on itself. Nonetheless, Ptoh's consent is testament to the degree of existential anxiety that could cause investigation into the penumbra calculus to go dark.”
- On the Origins and Nature of the Dark Calculus
Not even Ptoh would mess with the Penumbra Calculus.
@@recursiveslacker7730 All hail YOG-SOTHOTH !
1. You don't have enough clocks.
2. The "e" reveal was beautiful.
I loved seeing the mini connect four in the middle of the clocks lounging on the chaise lounge.
It had never occurred to me before that 3 is equal to both e and pi (to 0 decimal places).
I demand e be renamed to "Markiplier number"
It's always e, why? There are explanations, do I understand them? Not reallt
"Dad, why is there smoke in our neighbor's house?" "Damn it, it's that guy again"
"Why don't you stop him dad?"
"Son, he might be reckless but his math checks out"
The whiteboard was retrieved from a future apocalypse
“it’s that guy again”
@@Teapotman2 like guess I can assume nobody died cause the videos out lol, but I was genuinely concerned about how big that fire was and how close it was to a structure 😅
Most unfunny comment on this platform
How does this guy only have 40k subs!? He lit stuff on fire and then started talking about math.
Well, there are people who think that's weird and therefore refuse to subscribe! 😱
What? Only 40k????
His other channel has 200k
@@michaelneufeld4515 what other channel?
@@michaelneufeld4515 what other channel?? I didnt know he had another one
The OEIS is one of the most-important websites ever.
Worth remembering as well, while it's a website these days, it's actually far older than the web. For decades it was stored on paper in filing cabinets.
Also don’t sleep on their superseeker function - send an appropriately formatted email with a sequence and it will not only check if it matches any existing entry but it will perform a variety of transformations to try to find a match.
Sloan would approve this comment 👍
Thanks to this website I finally found out that someone had already discovered the sequence "0, 1, 10, 2, 100, 11, 1000, 3, 20, 101, 10000, 12, 100000, 1001, 110, 4, 1000000, 21..." before me.
Never heard of "throdd" and "threeven" before, love it.
I think it's fun to extend this to other numbers. For example with 4, you get the funny possibility that fodd sounds like quad, but every thing made of quads must be feven.
Its a funny way to describe dividing and taking the remainder. It has its own operator "modulo" and is defined as % in programming languages. So if your Integer has remainder 0 when divided by 3 its "threven", and remainder 1 is "throdd" but what is remainder 2 called?
@@tinyturtle1898pretty sure that is still throdd. The only threeven numbers are those evenly divisible by three. Just like the only even numbers are those evenly divisible by 2.
As far as I know they are terms he made up. He specifically defined "threeven" in a previous video as divisible by 3 but it is such a great portmanteau that no definition is required. Truly inspired.
We found the new viewer
I thought that the whole "i couldnt find the numbers in the millions since i wasnt a programmer" segment would lead to a Brillinat sponsor.
Classic Brillinat
Dark - Internet sure is cluttered now
"Now before I go into how I found out about numbers that large, let me tell you about" today's sponsor, Brillinat.
Thank god it wasn't
Dimitro > Brilliant
I was bizarrely discussing about this same thing with my cat the other day while high. However, I wasn't able to find anything about it on the internet and ended up forgetting it. It's such a mystique coincidence for you to have posted this video so close to those thoughts, thank you
Math is so rad when you're high!
That's absolutely crazy
Smart cat!
Did you ask your cat at the time? Perhaps you missed something from him / her.
I hope, unlike the video, you realised he was sometimes talking about numerals, calling them numbers. There are no stand-alone numbers.
That revelation with e reminds me of when i realized a^b will always be greater than b^a so long as a is closer to e than b
Yeah, but you probably didn't pull the proof out of your coat.
This doesn't quite hold in general (take 10^1 > 1^10 as a simple counterexample). In fact, with b > 2e - 1, you can always find a small enough number 0 < x < e - 1 such that (1 + x)^b < b^(1 + x) (note that since b > 2e - 1, we have |b - e| = b - e > 2e - 1 - e = e - 1 > e - 1 - x = e - (1 + x) = |(1 + x) - e|, so (1 + x) is closer to e than b is). this can be seen heuristically as the left hand side can be approximated by (1 + x)^a ≈ 1 + ax for small enough x, while the right hand side tends towards a as x tends towards 0.
@TomasIngi00 yeah, 1 is the exception, thanks for the counterexample. That's what math is all about
@@SirNobleIZH That's true, if you only count integers (and include the equal case of 2^4 and 4^2), then the result holds. Other counterexamples if we allow non-integers are e.g. 1.5^5 < 5^1.5 (approx. 7.59 and 11.18, respectively)
This feels tailor-made for people with ADHD. There's never a moment to get bored because there's always something new on screen to pay attention to while listening.
This just showed up in my feed, first time watching one of your videos. As a math major myself, I truly admire your mad mathematician vibes, with your calculations done in the wold with no clear uses, the true calling of all mathematicians.
Just hang around with this guy. He started way back with much more simple principles and systems and it has been fun seeing the progression; from the maths and the mad mathematician
Hi! I'm one of the mathematicians who has done some work on Integer Complexity, especially work with Harry Altman.
A few quick notes: A related fun open problem: do powers of 2 have the obvious complexity? That is for any n>1, is the complexity of 2^n just 2n?
Also, I gave a version of the Gaussian problem as a research problem to a student group a while ago. There work is I believe still under review.
Edit: Your thoughts about rationals are interesting. I think you are correct that that problem has not had much work (or at least if there is work on it, I don't know of it). To some extent, your 5/6 example seems to be taken advantage of "Egyptian fractions" which are ways of writing a number as the sum of fractions of the form 1/a for various distinct a. In particular, for 5/6, you are using that 1/2 + 1/3=5/6. Frequently it seems that using an efficient Egyptian fraction representation for a number will give rise to a low cost way of writing that fraction.
For the open problem: yes assuming a strong version of the generalized Catalan conjecture. Conversely, if we can prove this then we have some control on the subcase |2^m - 3^n| = k in the conjecture.
@@aadfg0 Yes, they are closely related. It turns out also to be related to what the base 3 expansion of power of 2 can look like. The claim implies roughly speaking that powers of 2 cannot have disproportionately many zeros in their base 3 expansion.
I want to float the concept that if we're bringing in fractions, we're no longer in the realm of integers. So at that point we'd need to start talking about Rational Complexity, no?
Also, using exponetiation, division and subtraction I can bring it into Complex Complexity with 6 1's to make an i, by writing it as (1-1-1)^(1/(1+1)
I don't know how to get to the transcendentals though, so it'd be Complex but with gaps in the number lines. Which is a weird concept to think about.
Watching the first minute; pls dont burn ur self.
you must be new here,,, domotro never burns
don't worry, he's a highly trained professional
There's also a highly trained professional cameraman behind the camera that always have his hose ready to make the scene wet =)
@@profquiz1730 professional what? /ferris
Im pretty sure he almost tripped
On that last philosophical point: there's also this feeling that if the new thing you discovered hasn't been researched before, that it's perhaps too contrived or useless or uninteresting. It's not too difficult to discover a sequence that isn't on the OEIS, but you have to ask yourself if you were motivated purely by the math, or if you were motivated by finding the lowest hanging fruit of undiscovered (uninteresting) math.
If something you discovered has been researched before, at least you know it's important enough to have been worthy of the time and effort of serious mathematicians. If not, you're left wondering how important your discovery really is, even if it is new.
To analogize this to exploring islands, if you discover a new island, and it's extremely rich in natural resources, nature, hospitable for humans, spacious, etc., chances are, someone has already discovered the island, and people already live on it. If, however, you discover an island that truly no one has discovered before, chances are, it's probably just a small rock full of bird poop. Should you be excited in the first case or in the second case? The second case is your original discovery, but it's also less meaningful and useful than the first case, but the first case isn't your original discovery.
Rather than be disappointed in either case, may as well be excited in both cases. Like you said, if it hasn't been discovered before, that's an awesome feeling. Even if the reason for it not having been discovered before is that it is somewhat contrived, it was clearly interesting enough for you to stumble across naturally. You should feel proud in that case. If the thing you discovered has been discovered before, and researched before, you should feel proud that your mathematical intuition is well-honed enough to tread the same paths that the giants before you have. You should also feel excited that you can skip to the front of the line. The foundations and path has been built for you, so you have no excuse to not rush to the frontier as fast as you can (by learning and studying and catching up on research) so you can start making new discoveries from a different (more developed, new) starting point.
Minor point: bird poop islands have been very important to humans, lucrative even.
Quoting: Seabird poop-sometimes called guano-was the “white gold” of fertilizers for humans for millennia. Rich in nitrogen and phosphorus from birds’ fish-based diets, the substance shaped trade routes and powered economies
@@josephsummer777 I was half joking when I said bird poop because of that, but maybe that's a point in and of itself. Even what seems like the most useless of discoveries can turn out to be a life-changing resource.
I went from number theories to bird poop islands. Thank you, RUclips comments 🤗
Flawed logic. Implies both the valuable and worthless islands have all been discovered before you, but the worthless islands were just never claimed or inhabited. So the discovery wasn'tnovel in either case. However, the assumption is that somebody has been there before, which isn't necessary. Over time it becomes more unlikely but still possible to discover truly novel things, both valuable and worthless novel things. Some unclaimed sequence in OEIS may have never been found before you found it.
Incredible coincidence that this video found its way into my recommendations.
A few weeks ago I encountered exactly this problem while working on an idea about bypassing some filter in a program that blocked digits, but allowed string like ‘true’. By using things like ‘true+true+true’ which equals 3, I could create numbers that I needed. But it would take a lot of text to create, say, the number 100.
I realized that through multiplication and parentheses I could create larger numbers more quickly but had to figure out an algorithm to generate these. It ended up being a pretty messy brute-force algorithm but I could generate the equations for the numbers I needed with exactly this idea!
Thank you for filming this outside. It is strangely comforting to see surfaces illuminated by the sun or places covered in mud due to rain, maybe it's because I don't go out much
really interesting how all of the low numbers feel like they have a pattern until you reach a big number and that pattern just shatters, incredible how common it is (talking about the primes being one bigger than the ones below)
12:20 True lool 😂
This bings back some ideas i had from my childhood i used to be much more curious back then
Very entertaining. You're the Explosions&Fire of math
dude these shots are underratedly amazing
This guy also gets a good workout while making these videos; lots of hiking, climbing, carrying stuff, stomping out fires off camera.
I was inspired to come up with the following generalization:
Let the cost of one 1 be zero, the cost of addition be A and the cost of multiplication be B. What's the cheapest that we can buy an integer for?
The integer complexity defined in the video is equivalent to letting A = B = 1 (and adding 1, as you set the cost of 1 to be one, while it would be zero for me).
I think a very interesting case comes up when we set B = 0. The first few values of the cost of n are equal to the optimal values for something called "addition chains". The first value where they differ is n = 23.
I think I might study this more in detail! Thank you for letting me know about this topic.
bro finally got those chickens lol, lets go
rly interesting how this method is used to construct integers irrespective of bases. rly looking forward to the video on eulers constant. its role in number bases is rly intriguing and im excited to learn more
Your style is wildly creative and entertaining. I love it
Love your enthusiasm for presenting obscure mathematics with the most chaotic energy possible. Changing the set of available operations from {+, *} to instead include all hyperoperations {+, *, ^, tetration, pentation, ...} might be an interesting way to extend the topic, to me it "feels" less arbitrary than cutting off the set of operations off after the first two.
math gremlin's back
More goblin than gremlin ;)
Ma, there's a weird cat outside. It's spouting maths at me, the weird fuckin thing
Small correction, but for the mysterious gaps at around 12:04, 14 has 8 one's constructed by 7*2, or ((1+1+1)(1+1)+1)(1+1). Great video.
Combo Class is the most underrated concept in youtube algorithm theory
I have studied the unique way to write a positive integer using only the prime function: p(n)= the n-th prime, and the integer 1.
2=p(1) = ()
3=p(2)=p(p(1)) =(())
4=2*2=p(1)*p(1) =()()
5=p(3)=p(p(p(1))) = ((()))
6=p(1)*p(p(1)) = ()(())
This can be mapped into the number of ways of Dyck numbers: counting the number of ways of a string of Xs and Os
(X = left parentheses O = right parentheses) so that in any initial segment there are more Xs than Os.
I discovered something very similar, where p(n) is indicated by wrapping the number in a circle: ruclips.net/video/CrvSmxf8tPs/видео.html
This video was enthralling, I'm so glad you survived filming it. But most of all, your philosophical point at the end was important for anyone working in research.
you're my hero part of the reason I'm going back for my bachelors in mathematics!!
You've got Weird AL energy. I hope you recognize how big of a compliment that is.
I haven't seen a maths video this original since I discovered Vihart many many years ago! Well done!
Thanks! :)
This guy has totally embraced his neurodiversity in engaging people and I'm so here for it!
Brilliantly crafted content and delivery. Subscribed.
I have a very similar flavor of spicy brain (light stuff on fire and geek out about math) so this channel is pure gold
@@defenestrated23 Me too, although I think I have a twist that prevents me from being able to actually string those clips together into a whole thing other people can see.
Lol I could be wrong but as far as I know this guy never said anything about being neurodivergent. Maybe he makes a video like this because he has a unique personality and perspective on the world, just like anyone else. Funny how we can essentially call people mentally ill with no blowback using this new PC word “neurodiversity”.
@thecoolv130 He doesn't have to say it to be true. It's more common than you think for people to not realise or find out until they're 40.
He's either a truly incredible actor or he is on the spectrum, heck he's the kind of person one would be better off calibrating the tests to!
Ffs
*This* is what the internet is for in the area of math, just putting out there ideas & concepts you have encountered/thought of and hopefully eventually someone will find it and can think on it, give a new set of eyes. We can advance with mostly unheard of or new ideas that no one would have really taken the time to dive into, that would have been forgotten otherwise.
Occasionally, inevitably someone will think of something new. Instead of forgetting about these things and just going “huh. Whatever.”, *document it* in some way. Even just write it down in a notes app or something, but preferably in a way that will make other people think about it.
Friend: 📞 "Hey D, wanna come out tonight? Have some fun with people?"
D: "No way, I'm figuring out how many 1's go into numbers tonight and for 2 weeks straight."
That's the thing about being the most interesting person at a party. It takes weeks of experiences to be interesting for 15 minutes.
Absolutely loving the aesthetics and contents of this video! And now I'm considering the implications of the terms threven and throdd.
It's crazy to see a video on my home page of the almost exact topic that I was investigating yesterday. I was trying to find an answer to the problem: What is the minimum of ones that I need to use to form all the numbers? (using addition, multiplication, exponentiation, tetration...) Great video!
It's so great to finally see a teaser for Return to Zork revamped in VR
This reminds me of some recent homework I was doing for computer science in university! First we had to write a dialect of the esoteric language P′′ (P double prime) in C. Then we had to write code in this language to do something basic like add two numbers together or print a message to terminal. Each character of the code is a single instruction/operation such as incrementing or decrementing by 1, or performing something in a loop (functionally the same as parentheses for multiplication). Long story short, I went down a bit of a rabbit hole trying to optimise my program to make it as short as possible and I found similar patterns to yours, especially around Euler's number.
The whole thing is dope. From the form to content, without forgetting the feeling of epiphany when you finally find the keywords to quenching your curiosity. 💯
The fact that you just found some interesting little problem, worked out some solutions, and struggled to find out other ways people had experimented with this idea until you found the OEIS, and THEN you learned that plugging in your solutions brought you to this whole concept... It is so freaking cool and I'm so happy for you that you found it like this. This is insanely fun!
This was a rather interesting concept. It reminds me a bit of floating point arithmetic. In fact, in many ways, your question about non-integer numbers is a question of floating point representations. Floating point might not be the right word to use, but I think you might understand what I'm saying.
I have actually thought a lot about the section "What is the Largest Number We Can Build?" before seeing this video. I also came to the conclusion that you would be using 2s and 3s a lot. Wonderful video for those who like number theory and pure mathematics!
This is super interesting!
This sounds a bit related to height functions in diophantine geometry, where they are used to quantify the "complexities" of solutions (complexities of rationals, Weil complexity of algebraic numbers, etc.), although integer complexity seems to have a more "combinatorics" feel to it.
I wonder if the connection goes beyond face value, that would be super cool!
Wow! I feel like each number has had a tarp over it my whole life, and you lifted the tarp, letting me see the framework inside. Thank you!
16:30
Well yeah, you build up with multiplications of 2 and 3. Of course a division would cost even more one's.
Moments later, WTF?! HOW???
Also, I expected you to mention something like "to the power of".
(1+1)^(1+1+1) = 8
Which reduces the number of ones from 6 to 5.
Great video. Happy THE squirrel is still around. Have you named it yet?
Why would we stop to powers ? What about tetration or even stronger ones ?
The question i had myself is about if substraction was allowed or not, since i’m pretty sure numbers 31 or 63 would be more optimized by taking (the formula for 32/64)-1 than the formula for 31/63 without substraction. Same for numbers like 62, that would be the most efficient by doing 31×2, with 31 having a substraction in it’s formula
Edit: i literally wrote that when i was 1 minute before he was talking to it, nvm
Division is helpful since if you have your number, call it n, and you are trying to make it, then there are four basic ways, you write n = a * b, a + b, a - b, a/b. If division is ever useful, then some number needs to have a minimal cost of the form n = a/b. Now how can this happen? You want a number n such that bn has a small cost. If bn is very close to a number of the form 3^k, then its cost will be small. In fact, I would not be surprised if the cost of numbers of the form (3^k+1)/2 have this as their form with the least cost for k sufficiently large.
@@quentind1924 when you introduce new operations, information is added to the recipe, therefore the complexity must go down
Really powerful point about being grateful for those who have already solved the problems we're working on. I think the fire and destruction is probably unnecessary, what you do is already cool enough.
Most sane Postdoc:
the video set is so crazy, i love it
Adding more functions results in needing less 1s. You can even say that for every number y there even exists a functions Fn so that Fn(1) = y Allowing more functions reduces the costs at the number side. However it increases the costs at the function side. So you need to evaluate the total costs as a sum of the number side and the costs of the amount of functions you need. However you can not simply add them as it are different things and the costs of a number is not always per definition the same as the costs of a function. Regarding e.g prime numbers there is a function Fp(x) that gives the x-th prime number. So even if you don't know the next value in a sequence you already can descibe it using a function.
Yeah, reminds me of Kolmogorov Complexity.
Hey man, I only knew you for your shorts, I didn't know you actually knew math. Let me tell you, this video is amazing, I've never been interested in number theory until now. Keep it up ❤
Your intros are just fantastic
It must have been extremely satisfying to find that 350 million number. And those other large numbers. Subbed.
Giving me Explosions and Fire energy.
Glad to be a new subscriber.
This is cool. I always had trouble making sense of shuffling patterns. In high school I would shuffle poker chips and looked at how many times it takes for a stack to return to it's original permutation when doing perfect shuffles. I made a small program on my calculator to do this but I never understood the math behind it (I think it's some group theory stuff). I didn't pursue mathematics but I think I might learn more about this from the OEIS.
4:14 The "cost" of number 4 is 4, but the example for number 4 in the column has 5 ones.
thank god this man is just a human
in the thumbnail it's (1+1)(1+1)
The extra '1' was just a tip that I left the good doc.
It’s obviously an editing mistake, it doesn’t even add up to 4
@@quentind1924 Of course, this is a very silly little mistake. I am learning english and my math background is not the best, so I am happy for any mistakes I find. The videos from this channel are great.
Your content is unique, clear and entertaining. Great ob!
Bro wake up, new ComboClass just dropped
WAKE UP!
-ITS THE FIRST OF THE MONTH-
COMBO CLASS UPLOADED!
I also love it, i just dont accept that arsonistic approach
@@TymexComputing ok, i get it
Nope. I’m getting a restraining order. This comment causes cancer.
as a computer scientist i would be absolutely delighted to find a way to algorithmically define a bunch of the functions behind integer complexity, when i find the time im definitely going to write a paper about this!
_for a messy guy - in a messy neighbourhood - you've sure got a clean lab coat_
Disappointed you didn't go through with the haiku you started
Your mind seems wildly tempered in wonderful ways, I would love to sit down and talk shop about large number theory and complex relative maths. The video was a wild ride and is worth recommending to a friend.
Additively I'd like to give you another indexing idea that I think will lead to the future of number theory, if Pi is infinite we could theoretically have all numbers derived from Pi and using either their integer value to return different values (0 gives 3, 1 gives 1, 2 gives 4 but say 0~2 would be 14) to eventually have computers look at all numbers as their related index of pi, depth of relation of numbers and since it goes on indefinitely you could get all values eventually when they are all tallied.
Seen 20 seconds of the video, subscribed as I knew this was a channel for me
reminds me of the Fundamental Theorem of Arithmetic. fascinating video
congrats; you invented the french numbering system
10:35 For anyone seeking explanation, imagine you split 10 into x pieces.
In this case he set x=4 which results in (2.5)(2.5)(2.5)(2.5)=(2.5)^4
Using this pattern we can define this as:
f(x) = (a/x)^x
=e^(x ln(a/x))
(The variable a is the amount of ones we can use, in this case it would be 10)
Which if you derive you get: a^x (1/x)^x (ln(1/x) - 1 + ln(a)) = 0
First two cannot be 0 since x is a real number
-ln(x) - 1 + ln(a) = 0
x=e^(ln(a)-1)
x=a/e
But remember that we split "a" ones into "x" pieces
So every piece would have the value a/x, plugging x=a/e
You get that it should be exactly e!
great video, but you should have cut 41 seconds to make the time the first 4 digits of e.
You might want to look into Kolmogorov complexity that generalise all the questions you are asking. It is pretty straightforward, under this framework, to demonstrate that, given a complexity k, only an exponentially small fraction of numbers in a range can be expressed with less than k operations. The framework talk specifically about "programs" (like computer programs for turing complete systems) but you can easily see the similarities. Also, note that since for example multiplication can be defined in terms of addition, the complexities under different set of operations can differ only by a constant (e.g. the complexity of the definition of "multiplication" in terms of addition). Kolmogorov complexity is in fact the minimum length of a program across all possible set of operations. However, since we think we can compute only what a Turing machine can compute, every computer language (C, python, etc.) would allow to reach the same complexity for a number (only differing by a constant value).
i totally love problems in math where it's a completely 'natural' question - something you'd actually start wondering while on the toilet
another example includes: does every closed curve contain four points that can be connected to form a square?
Or the other partitioning of THE ONE problems ;). I think the answer to this one is NO, I am thinking about a roman arc with widening side walls and with skewed flat floor and I can't find the vertically symmetrical square but maybe tgere is some skewed square ,didn't check all possible squares :)
@@TymexComputing So like a capital delta symbol, but the top part is arced?
This definitely permits a square!
@@alganpokemon905 Yes like that but also the floor is not horizontal but straight, skewed base at delta with top arc.
your feelings are irrational
if you modify it slightly so that the square and the curve don't have infinitely many intersections, you can cut a circle in half and connect the two halves with parallel lines
Love your persona with the unpolished surreal props and backgrounds!
There's something I've been thinking about ever since your video on what operations really were.
Sequence/Counting > Adding (Counting in groups) > Multiplying (Adding in groups) > Exponentiation(Multiplying in groups) etc
And originally I assumed that going the other way would work the same, but it breaks down by division. Division isn't subtracting in groups, hell sometimes the answer is bigger than the factors. So then, what IS division? The explanation of it just being multiplication's inverse is super unsatisfying, and I can't help but think there's more to it. It isn't subtracting in groups, but it is still grouping. Only it groups the answer rather than the factors. Would love to hear more about the subject if you're able!
I second this video request!
I was looking at the same thing recently, was having ChatGPT start by explaining one and zero to me, see how far I could get. When it came to division, it actually popped out something that is entirely relevant to this question.
I was specifically questioning this very thing, why division is the inverse of multiplication, and why we can't divide by zero. It said something like division is specifically the process of asking the question 'how many times can I subtract a given number from the number I started with', and that's why we can't throw zero in, because there is no number of times you can subtract zero from another number to reach anything different.
I've never seen it described exactly that way before, and it actually did
You can extend this concept by adding ones and twos to get a number, for example 2 needs 1 number, thats 2, 3 needs 2 numbers 1+2, and so on. Also you can keep adding numbers, like 3,4,5, etc. Great video!
I'd like to see the same concept but allowing exponents as well 8= (1+1)^(1+1+1)
And.... 4 as (1+1)^(1+1) still cost four! 😮
Stayed till minute 15 to see how subtraction would turn out. Was happy the example was such a nice one.
i love it!!! i can't believe that you checked 50,000,000 and it was only 221,174 larger!
also, i relate SO HARD to the last section about the paradox of rediscovery! i definitely think i lean toward disappointment upon discovery when i know it's something i'd be able to fully understand and handle myself, and excited/relieved when it's a complex topic i want some help with
Glad you related! In case you're not joking about the 50,000,000 thing (or in case anyone else needs clarification) I should clarify that I did not check that many numbers myself. I checked about 50 numbers manually for different combinations of operations. The "I didn't check more than 50 million numbers" line was just saying that was how many numbers I would have had to check if I were to have found the next statistic myself.
@@ComboClass HAHA, gotcha. i should have figured that out based on you saying you aren't familiar with coding :)
your feelings are irrational
Complexity in comp sci is a measure for the amount needed of some abstract resource. That can be time, space in bits, area for a circuit, circuit depth, gate count, edges in a graph, or how many "ones" you need for integers.
My thoughts just go toward continuing up toward bigger operations.
Exponents, tetration.
How does the integer complexity change when those are considered.
Like if 9 is (1+1+1)(1+1+1) with just addition and multiplication, but is (1+1+1)^(1+1) with exponents.
Some of the sequences on the OEIS table I mentioned in the episode include exponentiation in that way. Not sure if tetration has been considered.
@@ComboClassnow where getting into some big numbers
The cost for 11 is 7 if exponents are allowed: (1+1+1)^(1+1)+(1+1)
@@ComboClass 27 would become (1+1+1) tetrated by (1+1) and thus the cost would be 5
i dont think ive ever witnessed a video like this before, you got me hooked
You have some amazing sets 😂
I love the basement-looking one with all the vines dangling in a column of sunlight 💕
The most satisfying situation I got to was when I was doing some personal programming languages research during university and got to the point where some of the questions I was coming up with were things that people were only investigating in the past few years. I could still go look at other people's thoughts about it, but it was confirmation that I really was approaching new stuff.
I might be second. (excluding yourself)
Instead of *adding* i to the mix, you could use i *instead of* 1. The "complex complexity" of 1 would be 4 (i*i*i*i), for instance.
If we allow the square root we can calculate the cost of i as √(1-1-1)
so many vibey creative choices in the presentation. love it.
A lot of fire for a math video
The way you inspire curiosity - brilliant as ever! 🤗
Especially how you show genuine research and exploration is fun ! 🥳
Isn't this just "prime factorization" extended to include operations other than the usual multiplications?
4 = 2 * 2 (simple prime factorization, and the "cost" is simply the addition of factors) or 2 + 2 (4 ones)
5 = 2 * 2 + 1 (prime can't be factorized, so we include addition operation) or 1+1+1+1+1 (5 ones either way) And because each number can be written as x = 1 + 1 + ... x times, we can say that each number has a maximum cost of X ones. so, for 5, you can just write 5 ones.
6 = 2 * 3 (5 ones by using prime factorization).
7 = 2 * 3 + 1 (prime number can't be factorized, reuses cost of previous factorization and adds one) and so on.
The whole (2^a) * (3^b) is simply a consequence of all prime numbers (greater than 3) being of the form 6k + 1 or 6k - 1.
I'm super pleased with the algorithm for putting this video of yours into my feed.
This intro is how I imagine most math experiments go. My numbers always explode in my face whenever I try to do math as well.
I'm so happy I clicked on this video. You are such a cool guy, I am gonna watch all your videos now
I think it's very cool that Daniel Bryan has enough free time to be a math youtuber.
Seriously though, I love your videos. The topics are untouched by other math channels and your video style is totally unique on top of that.
Cool topic. I can't recall if I have come across this before. Certainly not in school. Such a tantalizing thing mathematics is. A brilliant universal language that taunts you into believing that all of its universe of subtopics possess some degree of real world relevance even when most show no sign whatsoever!
I'm glad this came up in my recommended
Dom keep going! I love your work. This complexity subject is very promising.
This video was waaaay better than I thought it would be.
Never seen this guy before, but I'm officially subscribed~
You can think of this as a special case of Kolmogorov complexity from algorithmic information theory. The Kolmogorov complexity of a string of text is the length of the shortest computer program which produces the string, in a given programming language or Turing machine encoding. It's a really profound definition related to Cantor's diagonal argument, the halting problem, and Gödel's incompleteness theorems.