Latest activity
-
Bbinbots reacted to fresh_42's post in the thread A prime counting function I have never seen with
Like.
Here is the promised link to the article about a^n+b^n=c^n, Fermat's last theorem... -
Ffresh_42 replied to the thread Proof check (I swear, if I ever misclick again...).Here is my version: If o(ab)\,|\,\operatorname{lcm}(n,m) then \begin{array}{lll} o(ab)&=q\cdot\operatorname{lcm}(n,m)=sn=tm\\[10pt]...
-
Ffresh_42 replied to the thread Proof check (I swear, if I ever misclick again...).It goes as follows...
-
Ffresh_42 replied to the thread Proof check (I swear, if I ever misclick again...).Some remarks on your proof. It would have been clearer if you had used either j or z and explained it as in your last post. I...
-
Boi replied to the thread Proof check (I swear, if I ever misclick again...).well, maybe not tha clean.(o(a)=n, \: o(b)=m, \: d=\mathrm{gcd}(n, m), \: n_0=\frac{n}{d}, \: m_0=\frac{m}{d}) I mean, sure... -
Ffresh_42 replied to the thread Proof check (I swear, if I ever misclick again...).It is only one line with maximal three equality signs. Plus the equation nm=\operatorname{gcd}(n,m)\operatorname{lcm}(n,m) of course...
-
Boi replied to the thread Proof check (I swear, if I ever misclick again...).So, any element of \langle ab \rangle is ab raised to some integer power z. Because G is abelian, we have (ab)^{z}=a^{z}b^{z}. Now, if...
-
Ffresh_42 replied to the thread A prime counting function I have never seen.Here is the promised link to the article about a^n+b^n=c^n, Fermat's last theorem...
-
Bbinbots replied to the thread A prime counting function I have never seen.Thanks for that link. Will definitely go through it when I have time.
-
Bbinbots reacted to fresh_42's post in the thread A prime counting function I have never seen with Like.
I agree, there has to be something to the golden ratio. It has a reason architects used it so often in their designs. E.g., here (source...
-
blamocur reacted to fresh_42's post in the thread Proof check (I swear, if I ever misclick again...) with Like.
As I already said, you lost me with the introduction of x,y. What are they? How are they determined, and why is x\equiv y\pmod{nm}... -
Ffresh_42 replied to the thread Proof check (I swear, if I ever misclick again...).As I already said, you lost me with the introduction of x,y. What are they? How are they determined, and why is x\equiv y\pmod{nm}...
-
blamocur replied to the thread Deplacement-Rotation Algorithmen.I don't see how you can figure out the rotation if you can only measure the displacements.
-
Boi replied to the thread Proof check (I swear, if I ever misclick again...).Okay, I'll try to do that. I'll come back once I succeed. But also, even if the proof is overcomplicated, is it correct?
-
Kkhansaheb replied to the thread Proof check.Thread continued to: https://www.freemathhelp.com/forum/whats-new/ Proof check (I swear, if I ever misclick again...)