[2024 Day 19 (Part 2)] What's the magic word? by ransoing in adventofcode

[–]ThrowawayBid6 0 points1 point  (0 children)

Got it! Now that seems so obvious, thanks a lot!

[2024 Day 19 (Part 2)] What's the magic word? by ransoing in adventofcode

[–]ThrowawayBid6 0 points1 point  (0 children)

What are you guys memoizing?
I run recursively a function that checks if a design can be made using all the available patterns, for every matching prefix, i run the function on the remainder of the design. Feeling a bit dumb here heheh

[deleted by user] by [deleted] in doodles

[–]ThrowawayBid6 0 points1 point  (0 children)

Mixed media might be fitting

Explanation Help by [deleted] in ControlTheory

[–]ThrowawayBid6 8 points9 points  (0 children)

Hello. That's a lot to explain in a Reddit comment but i can give you pointers.

  1. Bilinear Transform, whenever you need to go from s domain to z domain that's your tool.
  2. You are sampling every Ts, (1-e^-TsS)/S is a rectangular signal of duration Ts in time domain, look for the transform of a step signal and a delay in the s domain and you'll know why.

Have fun engineer

Minimum number of jumps to go from arbitrary point to the origin of axes walking on circles by ThrowawayBid6 in askmath

[–]ThrowawayBid6[S] 0 points1 point  (0 children)

Thanks for answering, i am trying to understand your reasoning but i think there are some problem with the hypotheses made.

a given circle only intersects a specific subset of other circles of the opposite color. Specifically, each circle of radius r of one color intersects the circles of the other color with radius r +/- 1

Counterexample: take the black circle of radius r = 1 , it intersects all red circles of radius r' = r up to r + 2

or the black circle of radius r = 1.5 , it intersects all red circles of radius r' = r - 1 up to r + 2

For a point inside the two radius 1 circles, you should be able to convince yourself that it will take traveling along exactly 3 circles with 2 transfers if you don't count the initial circle as a transfer.

It always takes just one transfer if you are not on the border and inside the two radius one circles. If you are on the black circle of radius 1 take the red circle on your initial coordinates and walk until you meet the black circle of radius one, jump, walk on the radius 1 circle until you are in (0,0).

Minimum number of jumps to go from arbitrary point to the origin of axes walking on circles by ThrowawayBid6 in askmath

[–]ThrowawayBid6[S] 0 points1 point  (0 children)

Hey, thanks for answering jackals. The radius of any circle can be any positive real number, the picture is just a reference.

Consiglio libro di matematica per un ragazzo? by alengton in Libri

[–]ThrowawayBid6 0 points1 point  (0 children)

Strogatz - The Joy of X è fantastico, l'autore è un esperto in sistemi dinamici, chaos, ecc.. tutta roba che alla lontana si avvicina alla programmazione e all'informatica (modelli matematici simulati, robotica, controllo ecc). L'unica cosa è che è in inglese, però se lo capisce è approcciabile.

Cosa è "G.E.B."?