Mathematics

Associated with Math.SE; for both general discussion & math qu...
Dec 6, 2020 03:37
btw if you don't know what a quadratic residue is, it just means that $0^2\equiv 2^2\equiv 0$ and $1^2\equiv 3^2\equiv 1$ so there isn't any number whose square is $3\mod 4$
Dec 6, 2020 03:34
for $n\geq 4$, $n!\equiv 0 \mod 4$ and then you have $m^2\equiv 3$ which is impossible because 3 is not a quadratic residue mod 4
Dec 6, 2020 03:31
consider mod 4
Dec 6, 2020 03:31
oh
Dec 6, 2020 03:28
so it has the potential to be really hard
Dec 6, 2020 03:28
Dec 6, 2020 02:10
I find these funny
Nov 24, 2020 16:26
Oh nice it was propsed by Erdos
Nov 24, 2020 16:24
hmm it has an oeis
Nov 24, 2020 16:24
Nov 24, 2020 16:18
If I have a set of $n$ points in $\mathbb{R}^2$ what is the maximum number of segments of unit length between two points of the set?
Nov 12, 2020 12:19
Why is the Bonferroni correction the value that it is, intuitively? I understand the proof but consider the following argument:

Imagine I have $n=10$ hypotheses and I a desired $p=0.05$. Then if the null hypothesis holds then the probability that at least one of them will appear true is $1-(1-p)^n=0.4$. We wish this was $p$ instead so we have to divide $p$ by $(1-(1-p)^n)p^{-1}$ so our new threshold is $p^2(1-(1-p)^n)^{-1}=0.006$. This is more than the true value $p/n=0.005$, so the argument fails. Why?
Oct 19, 2020 20:43
@anakhro that's a nice name
Oct 19, 2020 20:32
@MikeMiller it's a general method not just for that equation
Oct 19, 2020 20:31
the point and line method? It was something like that but I can't remember it to save my life
Oct 19, 2020 20:31
I'm having a brainfart. That method where you have a curve and a rational point on it and then you trace a line through that point to find other rational points. What's it called?
Oct 19, 2020 19:22
@porridgemathematics and it will also not be an integer
Oct 19, 2020 19:20
@porridgemathematics okay so then what's the next step if you have $\gcd(5n-3,2n^2-3)$?
Oct 19, 2020 19:16
@porridgemathematics I mean more like... I want to know what all the solutions look like. Is it always a product of the gcd of x and a constant? In particular, while I know how to do this case my approach is not general
Oct 19, 2020 19:11
Is there a general algorithm for finding out the GCD of two polynomials? Not the polynomial gcd, the gcd of the polynomials evaluated at every integer. For example I just proved that $\gcd(2n^2-4n+3,2n^2-3)=\gcd(n,3)$
Oct 16, 2020 21:41
@TedShifrin I feel like ever since 2010 when everyone got cellphones with social media in their pockets all the time it has been terrible all over the world, but maybe that's because I don't recall much about politics before then
Oct 16, 2020 21:40
american politics is such a nightmare
Oct 15, 2020 14:39
Do you ever just stumble upon a matrix of order 6? i.imgur.com/NPw8lhO.png
Oct 13, 2020 05:19
@JosephRock plugging into the integral definition you get $F(0)=\int_0^\infty \cos(ax)dx$, does that converge?
Oct 13, 2020 00:50
@TedShifrin I'm figuring it out
Oct 13, 2020 00:46
yes, it inherits the groups properties
Oct 13, 2020 00:45
no
Oct 13, 2020 00:44
@TedShifrin okay I give up. I don't see why that is either. Why?
Oct 13, 2020 00:25
when I googled it I only found theorems about when the domain of the homomorphism is cyclic
Oct 13, 2020 00:25
Thorgott told me here yesterday that a homomorphism $f:S_3\rightarrow C_n$ has a non-trivial kernel. How do I prove that?
Oct 12, 2020 20:29
It sounds really hard to get over 6
Oct 12, 2020 20:27
yeah I got it
Oct 12, 2020 20:25
That's a funny way of saying it's a triangular lattice lol
Oct 12, 2020 20:23
does it still hold?
Oct 12, 2020 20:23
but what if the graph is infinite?
Oct 12, 2020 20:14
Can someone prove this? "Any planar graph will always have vertices with degree <6"
Oct 12, 2020 03:15
I think by most definitions the empty set is clopen
Oct 12, 2020 03:09
makes sense right? Or do you want a proof?
Oct 12, 2020 03:09
@sheltonBenjamin yes P is the circumcenter because the angle of a segment of a circle seen from the center is twice that seen from another point in the circle
Oct 12, 2020 00:37
@Thorgott Oh god I need to study more algebra
Oct 11, 2020 23:52
@Thorgott I mean I want $g_1,g_2\in G$ so that $g_1(a)=g_2(a)$ and $g_1\neq g_2$
Oct 11, 2020 23:48
@Thorgott Yes but I still don' get it
Oct 11, 2020 23:46
what?
Oct 11, 2020 23:43
@Thorgott yeah you're right I meant $S_3$
Oct 11, 2020 23:41
but I think so
Oct 11, 2020 23:41
I don't know much topology
Oct 11, 2020 23:40
Consider the group generated by the two functions $x\mapsto \frac 1x$ and $x\mapsto -1-x$. It is isomorphic to $C_3$ and contains the following elements:

$$G=\left\{x,\frac 1x, -1-x,-\frac{1}{1+x},-\frac{x}{1+x},-\frac{1+x}{x}\right\}$$

I want to prove that for a prime $p$, when this group acts on an element $a$ of $\mathbb{Z}/p\mathbb{Z}$ such that $a^3\not\equiv 1\pmod p$ no pair of the group's actions maps $a$ to the same number. Assuming that $a$ and $a+1$ are invertible, I found by equating the identity to the other 5 transformations that there are collisions when $a\equiv -2^{-1}, -
Oct 7, 2020 00:38
@JoeShmo Interesting
Oct 6, 2020 17:25
I mean I asked myself that question to see if I really understood what was happening