This implies otherwise, unless I missed something else.
First up, look at the image. Second, I’ve been on this post for a long, long time, and I know that bh wants a general solution now.
Oh, okay then. This solution would work for his original question though.
Ah I see. Guess I’m a bit late lol
Can you link the other solutions?
after a year, this finnally rests… in peace.
I was there when it started!!! (I think)
gg
also
what is ciel and floor?
(ceiling and floor?)
Rounding up and down.
Is a AND operation without recursion possible though?
(I mean, figuring out the AND operation without recursion was the original question lol)
A 13yo does. (Def. not me… in trigonometry already.)
lil less off topic
I’m in 8th grade
Though, I’d like to try to help.
It was already solved…
It’s not an implementation. Blackhole wants a solution that is proven to work and a feasible in-gimkit system that works according to the solution – there was no gimkit implementation shown in this thread.
Sorry for the late reply lol. With recursion, AND operations are 100% doable. Without, it’s not possible no matter how many blocks you use (assuming you don’t hard code the if’s for digit one of each, digit two, etc, which isn’t humanly feasible).
Use a complex Fourier transform with the imaginary part being the 2nd input and the 1st part being the real part.
Read this pdf about it (https://www.analog.com/media/en/technical-documentation/dsp-book/dsp_book_Ch31.pdf), and I don’t think this is doable in gimkit is it?
Would that actually work?