Computers are built to work with bits, and compare it natively (it compares the physical bits).
This question is basically asking how to compare bits using algebra. Algebra doesn’t work with binary representations.
Bitwise operations are literally are not designed for anything other then use with binary bits (which you can’t do in gimkit creative).
The only way to do it in gimkit is recursion (which has alot of lag).
For anyone new seeing this topic, string operations solves the problem in general, and this post is now just asking if such math exists to solve it without looping (which does not).
@Blackhole927 Can you summarize the last 800 posts? I don’t want to read them all. I also want to confirm if the original post is still accurate with the info.
Half of them are discussing why he wants them and a workaround for that purpose. The other half is people saying that it’s really hard and that they don’t understand it.
You can prove that things aren’t impossible, you know. You need to think about it first. The post by bh says that most things in gkc aren’t impossible, emphasizing most.
However saying nearly nothing is impossible in gimkit is way different from something that literally is impossible mathmatically.
It’s the same as you saying it’s impossible for this equation to be true: 1 + 1 = 3,
and me replying with that nothing is impossible. If you truly believe it’s doable, prove it.
Also this post has become not really related to gimkit anymore and more a discussion about math. Blackhole you should either lock or resolve it at this point.
That’s my point lol. You quite literally cannot do bitwise operations with just algrebra, and them saying “nothing is impossible” is the exact same thing. I just used 1 + 1 = 3 to make it absolutely clear what I mean. Nobody would challenge it because everyone knows 1 + 1 != 3. It’s the same with bitwise (I finally learned it while bored lol), just it’s more advanced math.