Since , the line lies in the domain and satisfies . The restriction of to this line is , whose second derivative is : negative for and positive for . It can be neither globally convex nor globally concave. Hence is neither. Equivalently, its Hessian matrix is , changing the sign of its nonzero directional curvature across .
The denominator is positive throughout the domain. Holding fixed, differentiate with respect to :At the interior point this second partial derivative is , so the restriction to a horizontal line is locally strictly concave, ruling out convexity. At the interior point it is , ruling out concavity. Restrictions of a convex function or a concave function to every line segment must retain that property. Consequently is neither convex nor concave on its stated domain.
Differentiating on the given domain yieldsThe denominator and are positive there. Thus is strictly concave, and is not convex.
Suppose are two products of positive primes. If , then , and necessarily , since any nonempty product of positive primes is at least . Otherwise Euclid's lemma, applied repeatedly to the right-hand product, says divides one . Since is prime, . Reorder the right-hand factors and cancel this common nonzero factor. Repeating, or using induction on the number of factors, matches every factor. Neither side can have factors left over, because their product would then equal . Thus the prime factorization is unique up to rearrangement.
If , there is nothing to prove. Otherwise the only possible positive common divisors of the prime and show that . By Bézout's identity, for some integers . Multiplying by gives . Both terms on the right are divisible by , the second because . Hence . This proves Euclid's lemma, including when either factor is zero or negative.
Use strong induction on the positive integer . The case is represented by the empty product. For , if is prime it is already a product of one prime. Otherwise with ; the induction hypothesis gives prime factorizations for both and , and concatenating them gives one for . This proves existence in the fundamental theorem of arithmetic without presupposing uniqueness.
The Euclidean algorithm repeatedly replaces by , where the new remainder lies between and . Common divisors are unchanged by this subtraction, and decreasing positive remainders ensure termination. The last nonzero remainder is the greatest common divisor.
The extended Euclidean algorithm also tracks coefficients , beginning with coefficient pairs and and applying the same subtraction to the pairs. This invariant produces Bézout coefficients for the last nonzero remainder. Here the divisions areBack substitution givesThus , with and in Bézout's identity.
The greatest common divisor of positive integers is the largest positive integer dividing both, denoted . The set of positive common divisors contains and is finite, so this definition supplies a value.
Fix . Since is surjective, there is with . Injectivity of gives , proving that is surjective. All five conclusions are instances of injectivity and surjectivity under composition.
Suppose . Since is surjective, choose with and . Then , so injectivity gives and therefore . Thus is injective. The use of surjectivity is what makes every point of accessible to this argument.
For any , surjectivity of supplies with . Taking proves that has a preimage under . Thus is surjective.
Suppose . Injectivity of gives , and injectivity of then gives . Thus the function composition is injective.
Take the nonempty intersections of the length-three and length-four blocks. Within the first twelve nonnegative integers the common cut points are , givingThe complete partition of a set consists of these six blocks translated by for every . Indeed, adding increases the two floor quotients by and respectively, preserving equality of both quotients within each translated block. No adjacent displayed blocks can merge because at least one quotient changes at their boundary. This is the periodic common refinement of floor-quotient partitions, with period .
The floor function is constant at on the four consecutive integers . Consequently the partition of a set is . Different blocks are disjoint and every nonnegative integer has exactly one quotient and remainder upon division by .
For every , membership in the relevant equivalence class satisfiesEquality follows by axiom of extensionality. Thus .
For every , both and hold, so the intersection of equivalence relations is reflexive. If , symmetry of both component binary relations gives and , hence . Finally, if and , transitivity in each component gives and , hence . These are precisely the three conditions for an equivalence relation.
Write each member as . Every member is strictly below , so is an upper bound. If , the Archimedean property supplies with ; then . Thus no smaller number is an upper bound, proving . Since , there is no greatest element. Equivalently, each member is followed by a larger member because .
There are unlisted articles, also show them or only show them.