Displaying similar documents to “Vieta’s Formula about the Sum of Roots of Polynomials”

Special isomorphisms of F [ x 1 , ... , x n ] preserving GCD and their use

Ladislav Skula (2009)

Czechoslovak Mathematical Journal

Similarity:

On the ring R = F [ x 1 , , x n ] of polynomials in n variables over a field F special isomorphisms A ’s of R into R are defined which preserve the greatest common divisor of two polynomials. The ring R is extended to the ring S = F [ [ x 1 , , x n ] ] + and the ring T = F [ [ x 1 , , x n ] ] of generalized polynomials in such a way that the exponents of the variables are non-negative rational numbers and rational numbers, respectively. The isomorphisms A ’s are extended to automorphisms B ’s of the ring S . Using the property that the isomorphisms A ’s preserve...

A note on k-c-semistratifiable spaces and strong β -spaces

Li-Xia Wang, Liang-Xue Peng (2011)

Mathematica Bohemica

Similarity:

Recall that a space X is a c-semistratifiable (CSS) space, if the compact sets of X are G δ -sets in a uniform way. In this note, we introduce another class of spaces, denoting it by k-c-semistratifiable (k-CSS), which generalizes the concept of c-semistratifiable. We discuss some properties of k-c-semistratifiable spaces. We prove that a T 2 -space X is a k-c-semistratifiable space if and only if X has a g function which satisfies the following conditions: (1) For each x X , { x } = { g ( x , n ) : n } and g ( x , n + 1 ) g ( x , n ) for each...

Global behavior of a third order rational difference equation

Raafat Abo-Zeid (2014)

Mathematica Bohemica

Similarity:

In this paper, we determine the forbidden set and give an explicit formula for the solutions of the difference equation x n + 1 = a x n x n - 1 - b x n + c x n - 2 , n 0 where a , b , c are positive real numbers and the initial conditions x - 2 , x - 1 , x 0 are real numbers. We show that every admissible solution of that equation converges to zero if either a < c or a > c with ( a - c ) / b < 1 . When a > c with ( a - c ) / b > 1 , we prove that every admissible solution is unbounded. Finally, when a = c , we prove that every admissible solution converges to zero.

Linear recurrence sequences without zeros

Artūras Dubickas, Aivaras Novikas (2014)

Czechoslovak Mathematical Journal

Similarity:

Let a d - 1 , , a 0 , where d and a 0 0 , and let X = ( x n ) n = 1 be a sequence of integers given by the linear recurrence x n + d = a d - 1 x n + d - 1 + + a 0 x n for n = 1 , 2 , 3 , . We show that there are a prime number p and d integers x 1 , , x d such that no element of the sequence X = ( x n ) n = 1 defined by the above linear recurrence is divisible by p . Furthermore, for any nonnegative integer s there is a prime number p 3 and d integers x 1 , , x d such that every element of the sequence X = ( x n ) n = 1 defined as above modulo p belongs to the set { s + 1 , s + 2 , , p - s - 1 } .

An Inequality for Trigonometric Polynomials

N. K. Govil, Mohammed A. Qazi, Qazi I. Rahman (2012)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

The main result says in particular that if t ( ζ ) : = ν = - n c ν e i ν ζ is a trigonometric polynomial of degree n having all its zeros in the open upper half-plane such that |t(ξ)| ≥ μ on the real axis and cₙ ≠ 0, then |t’(ξ)| ≥ μn for all real ξ.