wisha 4h ago • 100%
Yeah, the four color problem becomes obvious to the brain if you try to place five territories on a plane (or a sphere) that are all adjacent to each other.
I think one of the earliest attempts at the 4 color problem proved exactly that (that C5 graph cannot be planar). Search engines are failing me in finding the source on this though.
But any way, that result is not sufficient to proof the 4-color theorem. A graph doesn’t need to have a C5 subgraph to make it impossible to 4-color. Think of two C4 graphs. Choose one vertex from each- call them A and B. Connect A and B together. Now make a new vertex called C and connect C to every vertex except A and B. The result should be a C5-free graph that cannot be 4-colored.
wisha 1d ago • 100%
There are a few typst packages for making presentation slides. Which one did you use?
https://lemmy.smeargle.fans/post/220300
wisha 2mo ago • 100%
Did you choose components and plan the connections on the perfboard yourself?
Also what was the original like? Would things work if you replace for example the transformer input side either the new kit and keep the output side the same?
wisha 2mo ago • 100%
Were you modding an existing power supply or making one from scratch?
wisha 3mo ago • 100%
Anything that’s updated with the OS can be rolled back. Now Windows is Windows so Crowdstrike handles things it’s own way. But I bet if Canonical or RedHat were to make their own versions of Crowdstrike, they would push updates through the o regular packages repo, allowing it to be rolled back.
wisha 3mo ago • 100%
Awesome! Do you plan on publicly sharing the source code? I’d like to make a white on black background version.
wisha 4mo ago • 100%
I don’t understand your question, but are you talking about the sigmoid or arctan function?
wisha 4mo ago • 100%
Since this is a Rust comm, will you at least post an example using your tool with Rust?
wisha 4mo ago • 100%
They will upstream stuff, but sadly they are not going to mainline.
wisha 4mo ago • 100%
No. It uses Hallium (Android kernel, basically).
wisha 4mo ago • 100%
It’s already delivered - a Mastodon user got one.
But getting an OEM to make a phone under your brand is easy. The real question is how long will they keep the software maintained?
These people seem like passionate Linux enthusiasts, so one can hope.
wisha 4mo ago • 100%
According to the Librem people: this is Android kernel (& other low level stuff) with Debian userspace, not a true Debian phone. https://social.librem.one/@dos/112686932765355105
wisha 4mo ago • 100%
If I give you the entire real line except the point at zero, what will you pick? Whatever you decide on, there will always be a number closer to zero then that.
wisha 4mo ago • 83%
They have to get smaller to fit the problem statement- if all levers are the same size or have some nonzero minimum size then the full set of levers would be countable!
Now we play the game again 🤓. I start by removing the levers in the field/scale of view of your microscope’s default orientation.
wisha 4mo ago • 80%
But look at the picture: the levers are not all the same size- they get progressively smaller until (I assume from the ellipsis) they become infinitesimally small. If a cluster has this dense side facing you, then you won’t “see” a lever at all. You would only see a uniform sea of gray or whatever color the levers are. You now have to choose where to zoom in to see your first lever.
wisha 4mo ago • 50%
This reply applies to @Cube6392@beehaw.org’s comment too.
wisha 4mo ago • 95%
It might sound trivial but it is not! Imagine there is a lever at every point on the real number line; easy enough right? you might pick the lever at 0 as your “first” lever. Now imagine in another cluster I remove all the integer levers. You might say, pick the lever at 0.5. Now I remove all rational levers. You say, pick sqrt(2). Now I remove all algebraic numbers. On and on…
If we keep playing this game, can you keep coming up with which lever to pick indefinitely (as long as I haven’t removed all the levers)? If you think you can, that means you believe in the Axiom of Countable Choice.
Believing the axiom of countable choice is still not sufficient for this meme. Because now there are uncountably many clusters, meaning we can’t simply play the pick-a-lever game step-by-step; you have to pick levers continuously at every instant in time.
cross-posted from: https://lemmy.ml/post/13397700 > Malicious KDE theme can wipe out all your data > > Or is it [just buggy](https://www.reddit.com/r/openSUSE/comments/1biunsl/comment/kvnf4f5)?
Or is it [just buggy](https://www.reddit.com/r/openSUSE/comments/1biunsl/comment/kvnf4f5)?