Recent content by ayusuf
-
A
Proving the Equivalence of Languages over \Sigma: A Mathematical Approach
Homework Statement If L is a language over \Sigma then lim n -> inf of Ln = \Sigma* iff (\Sigma\cup{\lambda})\subseteq L Also Lk = {x1x2...xk | x1, x2, ...xk \in L} Homework Equations The Attempt at a Solution I started by saying there is an w is an element of sigma then it is...- ayusuf
- Thread
- Replies: 1
- Forum: Calculus and Beyond Homework Help
-
A
Prove, if p and q are distinct prime numbers
Okay for the first part kind of what I was saying that c = dk. It's like saying 12 = 6*k where k = 2 right? I know it's pretty clear but I just want to make sure I fully digest this stuff. Okay now for p divides b2 because according to Euclid's lemma it must divide one of the factors right...- ayusuf
- Post #9
- Forum: Calculus and Beyond Homework Help
-
A
Understanding the Difference between \subseteq and \subset in Sets
Okay I kind of get it. Thanks!- ayusuf
- Post #10
- Forum: Calculus and Beyond Homework Help
-
A
Prove, if p and q are distinct prime numbers
The reason your saying b2 is a multiple of p is because c/d = k and if we isolate c we get c = dk. So in this c is b2, d is p and k is c2q right? also how do go from p dividing b2 to p dividing b? Thanks.- ayusuf
- Post #7
- Forum: Calculus and Beyond Homework Help
-
A
Understanding the Difference between \subseteq and \subset in Sets
Right so from that example it would be wrong to say that A \subseteq B but rather we should say A is a proper \subset of B because A \neq B.- ayusuf
- Post #7
- Forum: Calculus and Beyond Homework Help
-
A
Prove, if p and q are distinct prime numbers
Okay now I understand what you meant by multiple but where are you getting that famous fact from? Okay so now if we isolate b2 in this equation we will have b2 = pc2q and by taking the square root of both sides we'll have b = sqrt(pc2q) = csqrt(pq). Why would p divide b?- ayusuf
- Post #5
- Forum: Calculus and Beyond Homework Help
-
A
Understanding the Difference between \subseteq and \subset in Sets
But everytime A \subseteq B that must mean A = B right? If not please give me an example. Thanks.- ayusuf
- Post #5
- Forum: Calculus and Beyond Homework Help
-
A
Prove, if p and q are distinct prime numbers
So from a2q = b2p which implies that p divides a2. I understand up to there but when you say write a as a multiple of p I get confused. Could you elaborate a little bit more on that? Thanks.- ayusuf
- Post #3
- Forum: Calculus and Beyond Homework Help
-
A
Understanding the Difference between \subseteq and \subset in Sets
Yes exactly so if A \subseteq B then every element in A must be in B and if A does not equal B then A is a proper \subset of B.- ayusuf
- Post #3
- Forum: Calculus and Beyond Homework Help
-
A
Understanding the Difference between \subseteq and \subset in Sets
If A \subseteq B does that mean A = B which means B = A because if A is a proper \subset of B then A does not equal B right. I am wrong right?- ayusuf
- Thread
- Confused Sets
- Replies: 12
- Forum: Calculus and Beyond Homework Help
-
A
Prove, if p and q are distinct prime numbers
Prove, if p and q are distinct prime numbers, then sqrt(p/q) is irrational. I know how to prove that if p is a distinct prime number, then sqrt(p) is irrational. From there let sqrt(p) = q/r and then prove but for this I'm stuck. Do we let sqrt(p/q) = (a/b)/(c/d).Thanks.- ayusuf
- Thread
- Numbers Prime Prime numbers
- Replies: 9
- Forum: Calculus and Beyond Homework Help
-
A
Proving 2^n > n^2 for n >= 4 by Induction
Cool, Thanks! :D- ayusuf
- Post #15
- Forum: Precalculus Mathematics Homework Help
-
A
Proving 2^n > n^2 for n >= 4 by Induction
Okay I kind of get. By showing that for k>=3 we know (k-1)^2 >= 2 which originally means 2k^2 >= (k+1)^2 for k>=4 but by proving the first inequality we have proved the previous inequality and thus by proving the previous inequality this means we have proved 2^k >= k^2 for k >= 4. Am I right?- ayusuf
- Post #13
- Forum: Precalculus Mathematics Homework Help
-
A
Proving 2^n > n^2 for n >= 4 by Induction
It is 3 because (3-1)^2 >= 2 because 2^2 >= 2 which is 4 >= 2 but what does that prove then?- ayusuf
- Post #11
- Forum: Precalculus Mathematics Homework Help
-
A
Proving 2^n > n^2 for n >= 4 by Induction
Okay so from k^2 - 2k - 1 >= 0 for k>= 4 we can rewrite it as (k-1)^2 >= 0 for k>= 4. Yes I'm sorry but I still don't see it.- ayusuf
- Post #9
- Forum: Precalculus Mathematics Homework Help