siriusmart

Yeah I can't lie, there is no calling this a daily challenge now.

Anyhow, have a go at proving this, I don't want any unrigorous "imagine zooming in until the line is straight" nonsense.

Difficulty: not a lot

Would appreciate if u put ur proofs or attempts below, I got a proof but it's like kinda mediocre.

In light of events following the previous post, it is almost certain shelling of the UN peacekeepers camp was not an accident from attacking nearby hezbollah tunnels.

The UN forces are the target of the Israeli army, as bulldozers usually dont accidentally show up in a warzone to specifically bulldoze a UN watch tower.

Oct 20 (Reuters) - The U.N. peacekeeping force in Lebanon (UNIFIL) said in a statement that an Israeli army bulldozer had demolished an observation tower and perimeter fence of a U.N. position in Marwahin in southern Lebanon on Sunday.

Their reasonings isn't making the slightest sense at all, so unless the article forgot to mention something entirely, this is rediculous.

Follow up post: https://lemmy.world/post/21092844

all nostalgia aside, arras.io is so much better

Draw a hypocycloid using a graphical calculator (such as Desmos or Geogebra).

Your hypocycloid should include

• Inner circle of radius `a
• Outer circle of radius `b
• As time t increases the point on the inner circle should trace out the pattern, you can animate the graph using t.

Below is the link to a Desmos graph:

https://www.desmos.com/calculator/vzgog7xqrz

• Given n and m are coprime, show that there exist integer n' such that nn' mod m=1.
• The extended Euclid's algorithm is given below without proof, which may be useful in your proof.

(I'm too lazy to type out the algorithm again, so look at the image yourself)

• Prove that z(x mod y) = (zx) mod (zy)

Be rigorous

(trust me bro im gonna daily post trust me bro)

EDIT: assume all variables are integers