Recent content by oli4

Open curves on the left contain no 'black filling' only closed curves do (but here is only one of them) The second image on the right is the only one applying this rule since we have empty triangles in the first image and an unclosed triangle containing some 'black filling' in the third one I...

Hi supernova1203 If you talk about rules like what to do when 'sending something at the other side of the equation' then you should just forget about those 'rules' They don't exist You only need to know that an equation is a magic formula involving the most powerful symbol of the universe :)...

Oh no, definitely not, but if you don't already know emacs, and have not much interest for programming, than maybe you won't want to try it. the learning curve is very very steep (very rewarding though)

Hi Moose_Ryder You could try emacs + org-mode it's very nice :)

are trailing zeros allowed ? is the ascending/descending condition strict ? I'm getting this for the different possibilities: strict, no leading 0: 2142 strict, accepting leading 0:2892 not strict, no leading 0: 6237 not strict, accepting leading 0: 7942

Hi guys, of course it is! I am the one mixing n! and n :) Cheers...

Hi cragar, yes it looks good, but you are mixing n and n! here and there so it is a bit confusing, you might want to rephrase it. The original statement is probably at the origin of it, but when they say "Hint: There is always a prime between n/2 and n if n>3", it's not the same n that was used...

Hi Knaapje I could recommend "From Frege to Gödel, a source book in mathematical logic" by van Heijenoort in which a section is dedicated to Peano I don't remember any specific connection to Euclid there, so maybe I am being offtopic if what you really are after is showing or disproving such an...

Hi, sorry I don't know about ICs, I am not into electronics, I just have some memories about it but they are quite old :) Anyway, multiplication is hard, I think you can avoid it by just doing addition, you just need to do 13 additions, it should be fast. Once the additions are done, you convert...

Hi ProPatto16 You could multiply by 14 and divide by 10 :) You are going to use BCD I guess, in any case you will need 2 bytes that would allow you to display up to 4 digits So pretend you have 4 digits and whatever number you have to itself 13 times, and carry up to the second byte At the end...

Hi Darth Frodo, aren't you just trying to solve a simple arithmetic serie ? u(n)=n a(n)=1+2+...+n=n(n+1)/2 ?

Hi Cbas Yes it helps, now I know that the projection is along the normal of the plane and apparently it does not matter where the plane actually is (any // plane would do if I understood correctly your 'picking the furthest corner of the box') You could pick any corner then, it wouldn't change...

Hi Cbas That would depend a lot on the previous steps you had for the projection on the plane, how you did it and the actual necessity of doing it For instance, you could 'rotate your scene' from the beginning so that you are facing the plane and you don't have to project your points anymore...

Hi Supermiedos You get an infinity of answers because you just solved the fact that 2 planes should be // to each others Now you have to put them at specific points Look at the first equation, it's a sphere with radius √7 So you know that for whichever plane you can think of, there will...

To each his own, I would put this as an example of networking hack :smile: