Displaying similar documents to “Decomposing rational numbers”

Prime rational functions

Omar Kihel, Jesse Larone (2015)

Acta Arithmetica

Similarity:

Let f(x) be a complex rational function. We study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we also derive some conditions for the case of complex polynomials.

Niven’s Theorem

Artur Korniłowicz, Adam Naumowicz (2016)

Formalized Mathematics

Similarity:

This article formalizes the proof of Niven’s theorem [12] which states that if x/π and sin(x) are both rational, then the sine takes values 0, ±1/2, and ±1. The main part of the formalization follows the informal proof presented at Pr∞fWiki (https://proofwiki.org/wiki/Niven’s_Theorem#Source_of_Name). For this proof, we have also formalized the rational and integral root theorems setting constraints on solutions of polynomial equations with integer coefficients [8, 9].

Characterization of linear rational preference structures.

Jacinto González Pachón, Sixto Ríos-Insua (1992)

Extracta Mathematicae

Similarity:

We consider the multiobjective decision making problem. The decision maker's (DM) impossibility to take consciously a preference or indifference attitude with regard to a pair of alternatives leads us to what we have called doubt attitude. So, the doubt may be revealed in a conscient way by the DM. However, it may appear in an inconscient way, revealing judgements about her/his attitudes which do not follow a certain logical reasoning. In this paper, doubt will be considered...