Let and be points on a plane such that , where is a positive integer. Let be the set of all points such that , where is a real number. The path that traces is continuous, and the value of is minimized. Prove that is rational for all positive integers
This post has been edited 2 times. Last edited by ReticulatedPython, Yesterday at 8:06 PM
Some researchers are going to put you to sleep. During the two days that your sleep will last, they will briefly wake you up either once or twice, depending on the toss of a fair coin (Heads: once; Tails: twice). After each waking, they will put you back to sleep with a drug that makes you forget that waking. When you are first awakened, to what degree ought you believe that the outcome of the coin toss is Heads?
[source: Wikipedia
Is there a way to do this without drawing obscure auxiliary lines? (the auxiliary lines might not be obscure I might just be calling them obscure)
For example I tried rotating triangle MBC 80 degrees around point C (so the BC line segment would now lie on segment AC) but I couldn't get any results. Any help would be appreciated!
Is there a way to prove
\frac{1}{(1+1)!}+\frac{2}{(2+1)!}+...+\frac{n}{(n+1)!}=1-\frac{1}{{n+1)!}
without induction and using only combinatorial arguments?
Induction proof wasn't quite as pleasing for me.
This post has been edited 1 time. Last edited by MathBot101101, Apr 21, 2025, 6:45 AM Reason: im dum
This blog reflects my thoughts on the mathematics that I grapple with. Hopefully these rumblings could be organized as to be palatable to a mathematical audience.