If we have x(x-6) + 1(x+6)=0. Then , how do I make x-6 and x+6 equal in sign. What I think is that if I put a minus sign on both sides. Then , we get -x(x-6)-1(x+6)=0 . Then , for -x^2. It doesn’t matter if x is +ve or -ve. Due to ^2 , it will be + ve always in end. So , x(x+6) - 1(x+6)=0. Is this right way ?
@SrijanM.T No, this is incorrect. I have no idea why you're trying to do this. Just expand and simplify and solve the quadratic: $x^2-6x+x+6 = x^2-5x+6=0$. Now solve in the usual way.
@TedShifrin There are two ways I know. One is completing the square which I know. 2nd is by x(x-6) + 1(x+6) = 0. If x+6 we’re both equal , then I would have just written x+6 = 0 or x+1=0. That’s what I wanted to do here. But I have one side x-6 and other side x+6 which is causing the problem.
@SrijanM.T the roots are x = 2 and x = 3, as a few seconds work with the quadratic equation will show. I must admit I wonder if I'm missing something and the equation was written in the form x(x-6) + 1(x+6)=0 for a reason. I don't see it though ...
@TedShifrin Srijan is preparing for the JEE exam in India, and the JEE questions tend to be written in such a way as to give hints to the student, so it seems likely that writing the equation as x(x-6) + 1(x+6)=0 was supposed to give a hint. However I don't see it.
@JohnRennie Ok. So , in many Q for similar like x(x-6)+1(x+6)=0. The sing for x-6 is changed to x+6 to make the Q easier to solve by some way. I am not getting is how to approach that way .
although between you and me, there was a point in my life where because i had the quadratic formula hammer in my hand, every quadratic equation looked like a nail.
Well everyone. Thank you so much for your help. I will search about this way on internet as well and find if there is a way or not only. Then , Ill share it with you,
@robjohn The point is. I wanted to learn as many methods as possible. Especially , in this equation. The concept which I wanted to know was if we can change x-6 to x+6 somehow. So , the Q is not solving the quadratic equation and finding the roots only. It’s that I wanted to know if this concept is present or not.
@SrijanM.T: You should think more on this also and generalize: Suppose you want to solve $7x^2-157x+150=0$ then I claim that its roots will be 1/7 times the roots of $x^2-157x+1050=0$ (note that this is very easy to factorize).
and this will also help you save a lot of calculations!
So we have a quadratic equation: $px^2+qx+r=0,p\ne 0$ and we are multiplying throughout by $p$ to get $(px)^2+q(px)+rp=0$ whence we solve for $px$ and divide the answer by $p$. :-)
@SrijanM.T Few months ago, I saw this type of question on this website only. That's when I observed it. So when I saw the discussion here on quadratic equations, I recalled that question..
Second equation: $y^2+qy+rp=0$, where $y=px$ (x is (are) the root(s) of the old equation), can be solved to get $y=y_1,y_2$ whence $px=y_1,y_2$ and we get x (the roots of the old equation).
Second equation: $y^2+qy+rp=0$, where $y=px$ (x is (are) the root(s) of the old equation), can be solved to get $y=y_1,y_2$ whence $px=y_1,y_2$ and we get x (the roots of the old equation).
So we have a quadratic equation: $px^2+qx+r=0,p\ne 0$ and we are multiplying throughout by $p$ to get $(px)^2+q(px)+rp=0$ whence we solve for $px$ and divide the answer by $p$. :-)
@rain1 where is this? your comment does not link to it.
Disclaimer: I undestand this is a horrific subject to discuss.
In Greece, rape has a prevalence of $1.1$ per $100,000$ people. Greece's population is $10.8$ million. To calculate the probability of at least $52$ yearly occurences, one would have to use the cumulative distribution function for $X...
@user178758 This is a crime statistic; however, it could be asked without reference to the crime. The mention of the crime is causing some people to be disturbed. Other people seem to think that the crime is being belittled by removing its mention.
@robjohn yes so what? Both the equations have the same root (x). What I said earlier was that root of the 1st equation are $x=a,b$ then root of the second equation (considering $px$ as variable) are $px=pa, pb$ and dividing these by $p$ gives $x$ (roots of the first equation). I don't see what's causing confusion.
@robjohn we solve this for z and get $z= -q\pm \sqrt {q^2-4pr}\implies px=-q\pm \sqrt {q^2-4pr}\implies x= \frac{-q\pm \sqrt {q^2-4pr}}{p}$. That's all.
@robjohn yes professor Rob, I agree. what do you want to say?
@SrijanM.T: You should think more on this also and generalize: Suppose you want to solve $7x^2-157x+150=0$ then I claim that its roots will be 1/7 times the roots of $x^2-157x+1050=0$ (note that this is very easy to factorize).
here things are better, you are separating the usage of $p$, it is not also a coefficient in the original equation. You have also explicitly stated that $z=px$ and so the variable being solved for is clearer.
Let me write a proof for the statement I made so that everything is clear. We have a quadratic equation: $px^2+qx+r=0, p\ne 0$, we multiply both sides by $p$ to get $(px)^2+q(px)+rp=0$ and we put $z=px$ to get $z^2+qz+rp=0$ which gives $z=px=-q\pm \sqrt {q^2-4rp}\implies x= \frac{-q\pm \sqrt {q^2-4rp}}p$(these roots are the same as those of the old equation).
@robjohn :)
since so many trailing messages are there, let me also state why multiplication by $p$ came up in the first place.
Here is the way that might be clearer: start with $ax^2+bx+c=0$. Multiply by $p^2$ to get $ax^2p^2+bxp^2+cp^2=0$ now substitute $z=px$ to get $az^2+bpz+cp^2=0$
@robjohn The point was to simply calculation: if we have $7x^2-179x+100=0$ then solving it by usual formula may be complicated so if we multiply both sides by $7$ and solve for $7x=y$ in $y^2-179y+700=0$ we get $(y-175)(y-4)=0\implies y=7x =175,4$.
Something like that :)
now we just have to divide by $7$ to recover $x$. :)
I recently found out that the randomness followed by f(n)=3n+1 and g(n)=n/2 based on some rules mentioned below.
1: If the output f(n) is even we insert it to g(n).
2:If the output is odd, we insert it to f(n) again.
Now here is my question, does this work for any odd in place of 1, for example f...
@robjohn professor Rob, recently I learned to handle non-homogeneous recursive sequences a bit differently
For example: $a_{n+1}=2a_n+9$ then we can convert this to homogeneous recursive sequence: $a_{n+1}-2a_n=a_{n+2}-2a_{n+1}$ and then solve this as usual. :)
Another way that comes to mind is: if $f(x)=\frac 1{4-3x}$ then the given recursive sequence is $a_{n+1}=f(a_n)$ and then using an exercise problem from Rudin's derivative chapter if $|f'(x)|\le c\lt 1$ for some constant $c$ then $(a_n)$ is a Cauchy sequence. But here ofcourse the difficulty is to find such bound $c$.
but then what would be $c$? Why I ask for $c$ is because $f$ does not seem to be bounded in the appropriate interval and hence supremum of range of f will not exist
if it I did, I would have said $c=sup$ of range of $f$ on that interval.
anything except $a_1=\frac{3^{n+1}-1}{3^{n+1}-3}$ works as per the answer.
And for $a_1=1$ the sequence converges to 1 but for other allowed values of $a_1$, the sequence converges to 1/3
if we write first few terms we get this pattern: $a_n=\frac{(3^{n-1}-1)-(3^{n-1}-3)a_1}{3^n-1-(3^n-3)a_1}$ and we get the above answer so it seems that the answer is correct but the problem is what if we are not able to guess this nth term
Given that you don't say in your question what "randomness" you're referring to, there's not really any way you're going to get a useful answer.
If you're thinking of a specific portion of the Veritasium video on Collatz, that's a start to providing context. But you'll need to actually say what you mean.
(Having watched that video as well, I would guess it's the appearance of Benford's law. But there's no way anyone reading your question can read your mind and know that's what you mean.)
Well, the appearance of Benford's law at least is genuine math. The Veratisium video includes comments from Alex Kontorovich, who has published papers on Collatz including one with proofs regarding Benford's law showing up in it (arxiv.org/abs/math/0412003).
i haven't watched the one-way speed of light video, though. seeing it in my feed did motivate me to learn about the Fizeau experiment, though.
@SamyakMarathe If you're simply asking whether there's other $x\mapsto ax+b$ maps for which their version of the Collatz conjecture is known, there are certainly some examples where the conjecture is definitely false
Take $x\mapsto 3x-1$. Then 5 -> 14 -> 7 -> 20 -> 10 ->5, i.e., a cycle
@robjohn I tried to compute $a_n$ in terms of $a_1$ but it's getting inordinately lengthy so I think writing the first few terms and recognizing the pattern to write $a_n$ (general term) and then verifying it by induction, is the only way I have right now to solve the question :-(
cause a monic polynomial of degree 5 is uniquely determined by its value at 5 different points
more precisely, $P\mapsto(P(1),...,P(5))$ is a linear map from monic polynomials of degree 5 to $\mathbb{R}^5$ and its represented by a Vandermonde matrix relative to the standard bases, hence is invertible
with a bit of work, you can write down the inverse explicitly - this is known as Lagrange interpolation
I can't use it here, right? to say $|L-G|<\epsilon$ since the two $f(x)$ on the last line aren't actually the same and have different bounds on their domain
Trying to find a proof of the following: If {a_n,k} is a doubly-indexed sequence of non-negative real numbers, and if {b_m} is an enumeration of {a_n,k}, then (sum_n sum_k a_n,k) = sum_m b_m.
Seems like it should be true but can't find a fully satisfying proof.
@Thorgott: Interesting. Can the conditions for this result be broadened to something like the conditions for swapping the order of summation? Or is non-negativity the broadest interesting condition that you know of?
Also, know of any book that discusses this identification with the sup over finite sums?
non-negativity is the best possible condition in order to write down the series as a sup. the result you want is also true under the assumption of absolute convergence, but that requires a more subtle argument
I don't know a reference off-hand, but this should no doubt be standard. if not in real analysis, it will be in measure theory textbooks
Hm, I've searched tons of real analysis and measure theory texts. I did find basically this in one of them but not in any of the others. I'll study the one that I did find though.
Is there a term for the concept of treating different prime factors as the differentiators between "spaces?" e.g. the numbers that are multiples of 1 are the natural numbers, the numbers that are multiples of 2 are another, the numbers that are multiples of 3 are another; with intersections between the "spaces" at 6, and so on
For context, I was thinking idly about the concept of 3, 6, 9, ... as 1, 2, 3 in the "space" of 3; 5, 10, 15 as 1, 2, 3 in the "space" of 5; and so on...
regarding dot product, I am a bit confused of it's actual meaning. I know it to be |A|*|B|*cos Theta, I read somewhere that we use it to get the angle between two vectors but I think they have to be unit vectors, so i used to think of it to be the angle between A and B. recently I read that A dot B is the projection of A into B, does this means that the dot product return the length of the projection?
another thing is I read that the scalar projection is |A|*cos(Theta),so is the it different from the projection of the dot product? it looks like the projection of A into B from the dot product en.wikipedia.org/wiki/Scalar_projection
@Thorgott Thanks, so to be sure, can we say that the scalar projection is the length of the projection of $A$ onto the line spanned by $B$ and the dot product is the scalar projection times the length of $B$, right? assuming the definition I said for the scalar projection is true
@copper.hat Problem is that Fubini's theorem talks about changing the order of summation but not in the sense of enumerating the terms in an arbitrary enumeration.
In effect, you don't get a single-indexed series where every term is represented uniquely by an index.
@fido9dido if $B \neq 0$ you can always write $A = A \cdot ({B \over \|B\|}) {B \over \|B\|} + (A- A \cdot ({B \over \|B\|}) {B \over \|B\|})$. it is easy to check that the term in parentheses is perpendicular to $B$.
@Thorgott True, but as far as I know, the measure-theoretic version relies on sub-additivity of Lebesgue outer-measure, the proof of which relies on taking sums in any order (at least as proved in Royden and Axler).
this can all be non-circularly, but it's not like there's any need to invoke Fubini to prove this much more elementary result. it's really just a remark that it does follow from there.
it shows that $A$ can be written as a component along the direction of $B$ and a component orthogonal to $B$. The scalar $(A \cdot {B \over \|B\|})$ gives the length along a unit vector in the $B$ direction.
Hello, I'm reading Misha's proof here https://math.stackexchange.com/questions/2961783/is-a-convex-function-always-continuous And I don't know how to prove that the convex hull of the hypercube w circumscribed aroud S contains S
pictorially it seems right, at least in three dimensions, but I don't know how to prove it