0 evaluări0% au considerat acest document util (0 voturi)
15 vizualizări1 pagină
1. The quadratic equation 2x^2 + 3x - 7 = 0 has roots of 1.266 and -2.766.
2. The quadratic equation x^2 + x - 3 = 0 has given roots of -2 and 3/2 and equation is 2x^2 + x - 6 = 0.
3. The quadratic equation 4x^2 + (p - 1)x = -1 will have equal roots if (p - 1)^2 - 16(4)(1) = 0, or p = -3 or 5.
1. The quadratic equation 2x^2 + 3x - 7 = 0 has roots of 1.266 and -2.766.
2. The quadratic equation x^2 + x - 3 = 0 has given roots of -2 and 3/2 and equation is 2x^2 + x - 6 = 0.
3. The quadratic equation 4x^2 + (p - 1)x = -1 will have equal roots if (p - 1)^2 - 16(4)(1) = 0, or p = -3 or 5.
1. The quadratic equation 2x^2 + 3x - 7 = 0 has roots of 1.266 and -2.766.
2. The quadratic equation x^2 + x - 3 = 0 has given roots of -2 and 3/2 and equation is 2x^2 + x - 6 = 0.
3. The quadratic equation 4x^2 + (p - 1)x = -1 will have equal roots if (p - 1)^2 - 16(4)(1) = 0, or p = -3 or 5.
The given roots are and . 1. 2(3 + x)(2 x) = x + 5 2(6 3x + 2x x2) = x + 5 b 11 += = . 2(6 x x2) = x + 5 a 2 12 2x 2x2 = x + 5 c 6 2x2 + 3x 7 = 0 = = = 3 a 2 3 32 4(2)(7) x= 2(2) The new roots are and 3 65 3 3 x= 4 Sum of new roots x = 1.266 or 2.766 (correct to 3 decimal places) = + 3 3 3 2. The given roots are 2 and . + 2 = 3 3 1 Sum of roots = 2 + = 2 2 11
Product of roots = 2 3 2 = 3 = 3 2
Hence, the quadratic equation is
11 1 = x2 + x 3 = 0 6 2 2x2 + x 6 = 0 Product of new roots 3. 4x2 + (p 1) x = 1 3 3
2 4x + (p 1) x + 1 = 0 = a = 4, b = p 1, c = 1
If the quadratic equation has two equal roots, = b2 4ac = 0 9 2 (p 1) 4(4)(1) = 0 3 = p2 2p + 1 16 = 0 9 p2 2p 15 = 0 1 (p + 3)(p 5) = 0 = p = 3 or 5 3
4. 3x2 + 2x + 4p = 0 Hence, the required quadratic equation is
a = 3, b = 2, c = 4p 11 1 If the quadratic equation has real and distinct x2 + x =0 6 3 roots, then b2 4ac > 0. 6x2 + 11x 2 = 0 b2 4ac > 0 2 2 4(3)(4p) > 0 4 48p > 0 48p > 4 4 p< 48 1 p< 12
AbsA divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,2,...|V |} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then number of edges labeled with 0 and thenumber of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. In this paper we prove that helm Hn , flower graph Fln and Gear graph Gn are divisor cordial graphs. Moreover we show that switching of a vertex in cycle Cn , switching of a rim vertex in wheel Wn and switching of the apex vertex in helm Hn admit divisor cordial labeling.tract