Recent content by Vishalrox

I found the values of p and q...as i found the value k...and by the way p and q are not the roots...only pk and qk are the roots which i found...

The question was from Hall & Knight...i know the problem is wrong...so we have to prove the trivial case...so i did it...everything i did...i did using Vieta's theorem...

theory of quadratic equations... theres a quadratic equation lx^2 + nx + n where its roots are in the ratio p:q .we need to prove that √(p/q) + √(q/p) + √(n/l) = 0 what i did was..i introduced a proportionality constant k... so pk + qk = -(n/l) while pq(k^2) = n/l...

Oh thanks...

that was one of the steps i did...i tried with many properties meddled with this a lot...but couldn't get a thing...instead of what you said i would just add R(2) and R(3) and get a 0..(R2 -> R2 + R3)...so that's aint the problem...u will get zeros...bu the problem gets more complicated i u...

1. The problem Prove that | (a+b-c) (-c+a-b) (a+b+c) | | (a-c) (c-a) (b-a) | = (a+b-c)(-c+a-b)(a-c) | (a-b) (a-c) (a+b) | using properties of determinants without expanding a determinant 2. The attempt at a solution I tried a lot of...

there are 4 circles and 4 straight lines...find the maximum number of intersecting points possible in the intersection of all these given figures...i can't get how to solve it...

Here is a good question for maths enthusiasts. I really find this sum very tough. Any help, advice or guidance for this question will be greatly appreciated. find the product upto n terms (1+(1/2^2)) . (1+(1/3^2)) . (1+(1/5^2)) . (1+(1/7^2)) . (1+(1/11^2))...upto n terms Where the nth...

I need help in this ques ! ABC is acute triangle. A1, B1, C1 are foot of altitudes. A1 is reflected about AC to get A2. Prove that B1, C1, A2 are collinear...i couldn't evn figure out how to solve it...but i need it just tell me the method no need to proove...or just tell me the idea how to...

Wanted help in c++ ! Program to print the number of prime numbers between two user given numbers. MY ATTEMPT TO SOLUTION : I hv found how to print the prime numbers between two given numbers but couldn't print the number of prime numbers between two given numbers. #include<iostream.h>...

C++ question...awesome question...challenging too ! How to write the c++ code for this sort of question...i couldn't get the logic even... to print the factors of a number given by the user in a pyramid pattern...like if 4 is the number given by the user...its factors are 1,2,4...the we hv...

i got it mysely...just say whether its r8...Barycentric coordinates as a function of the side lengths. The circumcenter has trilinear coordinates (cos α, cos β, cos γ) where α, β, γ are the angles of the triangle. The circumcenter M has coordinates: M = (a^2(-a^2 + b^2 + c^2), b^2(a^2 - b^2 +...

Nice ques to solve ! Given a triangle ABC find a point M on its circumcircle such that MA=MB+MC...It is easy for an equilateral triangle... I got it... but I couldn't get how to find for any arbitrary triangle...

Just split it into cases. Either (1) m and n have the same parity (either both odd or both even); or (2) m and n have different parities (one odd and the other even). In both cases, you can explicitly find the ceilings in question.

Nice ques to solve ! Homework Statement Let set 'A' have 'n' number of elements and let set 'B' have 'm' number of elements and let their's a defined function f:A→B. Determine the number of possible 'onto' functions that are possible and valid..!..prove it by mapping of elements from 'A' to...