Mathematics

Associated with Math.SE; for both general discussion & math qu...
Apr 23, 2022 01:39
or favorite songs? :)
Apr 23, 2022 01:39
do you have a favorite album?
Apr 23, 2022 01:38
awesome
Apr 23, 2022 01:37
Do you like The Cure?
Apr 23, 2022 01:37
Yes! He turned 63 :)
Apr 23, 2022 01:04
@leslietownes Thank you. I will check it out again for mistakes :)
Apr 23, 2022 01:04
The book said it can be found with "simple arithmetic". I know I could calculate it, but through a relatively lengthy process
Apr 23, 2022 01:03
I have a question, is there a simple step to calculate s in the last pic?
Apr 23, 2022 01:03
Apr 23, 2022 00:01
@robjohn I don't. I will install it now.
Apr 23, 2022 00:00
@robjohn I don't. I will install it now.
Apr 22, 2022 23:55
@robjohn I didn't understand this. Did I type something wrong?
Apr 22, 2022 23:54
I'm getting lost among all this calculations. Does it makes sense that if I know $1771^{16}=3647$ mod 3793 then I can do $1771^{128}=(1771^16)^8 = 3647^8 = (3647^2)^4=13300609^4 = 2351^4 = (2351^2)^2=800^2 = 640000 = 2776$ using mod 3793?
Apr 22, 2022 23:14
@leslietownes I'm not sure if I can fully see what you mean, but from what I tried, I found that $1771 = 2^{10}+2^9+2^7+2^6+2^5+2^3+2^1+2^0$
Apr 22, 2022 23:01
very
Apr 22, 2022 22:52
151 is already a prime number
Apr 22, 2022 22:52
Anyone knows if it is possible to reduce $1771^{151} \mod{3793}$ ?
Oct 12, 2020 20:54
I tried multiplying everything by factor $u(t)$ and $u(y)$ but nothing I could solve appeared. Multiplying everything by $u(t,y)$ leads to a partial differential equation too hard to solve.
Oct 12, 2020 20:53
I know I need to find an integrating factor to make it exact, but any attempt I've made has been hopeless.
Oct 12, 2020 20:52
Anyone has any clue on how to solve $(y^3+ty^2+y) dt = (t^3+yt^2+t)dy$ ?
May 25, 2020 16:22
If $W$ is the set of all intersections $A_i\cap A_j$, I think that the map $f:W\to \mathbb{Q}$ can be defined as $f(A_i\cap A_j) = i/j$. Doesn't this define a bijection? And $\mathbb{Q}$ is countable.
May 25, 2020 16:13
In that case, the set of all intersections is $A$
May 25, 2020 16:11
Maybe the set of all intersections could be arranged like Cantor's diagonalization?
May 25, 2020 16:11
and it's bijective.
May 25, 2020 16:10
If there is a map from $\mathbb{N}$ to the set.
May 25, 2020 16:08
It would be the set containing all the $A_i\cap A_j$.
May 25, 2020 16:07
Hello. Quick question: let's say that $A=\{A_1,A_2,\dots\}$ is an infinite-countable collection of sets. Then, is the set of all intersections of $A_i$ still countable?
Apr 22, 2020 20:35
Or does it mean that I probably can't?
Apr 22, 2020 20:34
Say, in relation to my question a while ago:
Given $F(w,x,y,z)=(F_1,F_2, F_3)$ and I would like to express each $x,y,z$ in terms of $w$.

This would be possible if the determinant for the jacobian matrix with partial derivatives for $x,y,z$ were non-zero.

I have shown that it is zero, does that mean I can't express $x,y,z$ in terms of $w$?
Apr 22, 2020 19:40
I'm trying to prove a function cannot be defined implicitly. Not sure if it's enough to show the Jacobian matrix has determinant zero.
Apr 22, 2020 19:40
Does the reciprocal of the implicit function theorem holds true?
Apr 22, 2020 13:37
Hello! I have a question regarding invertible functions. Say I have a function $f:\subset\mathbb{R}to\mathbb{R]$. If I find an inverse function $f^{-1}$ using some computations, and then I find the jacobian matrix of both $J_{f}$ and $J_{f^{-1}}$.

Should I expect $[J_f}]^{-1}=[J_{f^{-1}}]$ ?
May 10, 2018 00:02
I have a question about permutations. I'm trying to prove there is no permutation $\alpha$ such that $\alpha(123) \alpha^{-1}=(13)(578)$.

I think I would have to use that $\alpha(123) \alpha^{-1} = (\alpha(1)\alpha(2)\alpha(3))$.

Is the fact that $(13)(578)$ is a disjoint 2-cycle permutation and $(\alpha(1)\alpha(2)\alpha(3))$ is one-cycle enough to argue there is no $\alpha$ that satisfies the condition?
 

  Basic Mathematics

This room is meant for all basic mathematical discussion, incl...
Sep 16, 2020 10:35
Note: "My point of confusion comes from the Axioms of Equality, from which I could surely say \phi(x) \iff \psi(x)" I mean using other info given
Sep 16, 2020 10:33
I tend to think \equiv and \iff are the same (at least for a problem of this kind), but I feel unsure about changing a symbol for one I think is intuitively the same
Sep 16, 2020 10:32
My point of confusion comes from the Axioms of Equality, from which I could surely say \phi(x) \iff \psi(x) ; but I think that to replace the predicate I would need \phi(x) \equiv \psi(x)
Sep 16, 2020 10:30
\{x| \phi(x)\} and \{x| \psi(x)\} are sets that have the same elements
Sep 16, 2020 10:29
I have a question regarding \equiv and \iff . If I want to prove that\{x| \phi(x)\} = \{x| \psi(x)\}, then should I say that \phi(x) \equiv \psi(x), or \phi(x) \iff \psi(x) ?
 

  Logic

This room is meant for discussion about logic, including found...
Sep 12, 2020 19:41
@MaliceVidrine That's interesting. I'm taking a class and the teacher says precisely that — classes are collections of elements too big, and the axioms impose restrictions on how big classes can be. From what (I thought) I understood, a set was a class with restrictions that make sure it is small enough.
Sep 11, 2020 18:53
@MaliceVidrine yeah, I think get it now. I think I was getting mind-blocked by my intuitive ideas of set theory. I thought that theorem said that if x=y, then the elements that are in x are in y, and the elements that are in y are in x, but that's the interpretation after the theory is developed, and before that \in is a binary relation with no further meaning.
Sep 9, 2020 22:36
(of whatever \in comes to mean later, which properties are imposed to it by ZF)
Sep 9, 2020 22:36
Or might be my intuition that is misleading me, and at that stage I should see \in as just a symbol that relates two elements, and the former theorem is true regardless of whatever it comes to mean later?
Sep 9, 2020 22:31
But a (apparently intended) formal proof is given for the theorem I wrote above.
Sep 9, 2020 22:30
At the very start of the book I read they give me a language, two binary symbols we annotate as = and \in . But while there are axioms that explicit what is = (identity and substitution axioms for equality), there aren't that describe how is \in supposed to be used.
Sep 9, 2020 22:27
The used of \in in a formal proof confused me, as I expected its properties to be fully defined by the ZF axioms. When reading that proof, and even the theorem, the question that comes to my mind is What is \in ?
Sep 9, 2020 22:25
and it can be proved using only the axioms of equality (identity and substitution). However, the reciprocal requires the first ZF axiom
Sep 9, 2020 22:24
But once in formalized theory, can anything in regards of \in be said before going into the ZF axioms?

For example, I came across this theorem: \forall x \forall y [x=y \implies \forall z( z\in x \iff z\in y )]
Sep 9, 2020 19:33
Or, to put my question in different terms, what is the meaning of ∈? Should I take it just as symbol which has properties established by the ZF axioms? If so, how come properties related to the relation ∈ among classes are, in several books, established well before the ZF axioms.
Sep 9, 2020 19:28
I now that intuitively always happens either A∈A or A∉A, but why does it need to be the case? And in which ZF axiom is this property implied?
Sep 9, 2020 19:27
I have what I think is trivial question, but I cannot get my head around it. I'm reading about on Foundations of Math, and it starts with set theory, giving the ZFC axioms.

One of the goals of the ZF restrictions on set is to avoid the formation of bigger sets that lead to contradictions, like the one given by Russell's paradox, which ultimately leads to A∈A therefore A∉A , and if A∈A follows A∈A. But why is it a contradiction?