On Congruent Numbers

With respect to some classification of Pythagorean triples, if anumber 𝑘 is congruent then it can easily be proven. This expandsthe quest to resolve the congruent number problem. A proposi-tion is put forward on rational sides forming a congruent number.

The congruent number problem

The congruent number problem is the oldest unsolved major mathematical problem to date. The problem aiming to determine whether or not some given integer n is congruent, which corresponds to a Pythagorean triangle with integer sides, can be settled in a finite number of steps. However, once we permit the triangles to acquire rational values for its sides, the degree of difficulty of the task changes dramatically. In this paper a basis is developed, to produce right Pythagorean triangles with rational sides and integral area in a straightforward manner. Determining whether or not a given natural number n is congruent, is equivalent to a search through an ordered 2D array.

Minimal degrees of algebraic numbers with respect to primitive elements

Given a number field [Formula: see text], we define the degree of an algebraic number [Formula: see text] with respect to a choice of a primitive element of [Formula: see text]. We propose the question of computing the minimal degrees of algebraic numbers in [Formula: see text], and examine these values in degree 4 Galois extensions over [Formula: see text] and triquadratic number fields. We show that computing minimal degrees of non-rational elements in triquadratic number fields is closely related to solving classical Diophantine problems such as congruent number problem as well as understanding various arithmetic properties of elliptic curves.

Background mode selection during asymptotic-de Sitter inflation

For the first time, we choose non-flat vacuum mode for background spacetime based on the minimum number of created particles during early non-de Sitter inflation. In conventional methods for calculating the number of created particles, the flat background is selected automatically and causes a negative number problem for created particles during asymptotic-de Sitter inflation. In a covariant approach to curved spacetime, both real and background spacetimes should be selected, curved and consequently the relation for particle creation should be modify. As an interesting finding from this research, flat space does not include minimum number of particles and there are some asymptotic de Sitter spacetimes with fewer number. Therefore, in the generalized formula for particle creation, we choose a non-flat background containing the minimum number of created particles.

Computation of Hadwiger Number and Related Contraction Problems

We prove that the Hadwiger number of an n -vertex graph G (the maximum size of a clique minor in G ) cannot be computed in time n o ( n ) , unless the Exponential Time Hypothesis (ETH) fails. This resolves a well-known open question in the area of exact exponential algorithms. The technique developed for resolving the Hadwiger number problem has a wider applicability. We use it to rule out the existence of n o ( n ) -time algorithms (up to the ETH) for a large class of computational problems concerning edge contractions in graphs.