Related papers: Features of a high school olympiad problem
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
We deal with the existence of quantitative estimates for solutions of mixed problems to an elliptic second order equation in divergence form with discontinuous coefficient. Our concern is to estimate the solutions with explicit constants,…
For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
We give new examples of pairs composed of a real and a $p$-adic numbers that satisfy a conjecture on simultaneous multiplicative approximation by rational numbers formulated by Einsiedler and Kleinbock in 2007.
We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…
In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.
The objective quantification of similarity between two mathematical structures constitutes a recurrent issue in science and technology. In the present work, we developed a principled approach that took the Kronecker's delta function of two…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
We discover a novel connection between two classical mathematical notions, Eulerian orientations and Hadamard codes by studying the counting problem of Eulerian orientations (\#EO) with local constraint functions imposed on vertices. We…
The gap between high school and university level mathematics has long been deemed problematic. Felix Klein referred to this gap as the ''double discontinuity'' meaning that students come to university unprepared for university courses and…
This is the first part of a series of papers aiming to show how trigonometry and analytic tools can help into tackling demanding Olympiad geometry problems. We present several novel techniques for tackling hard problems from various…
We intend to contribute to the Collatz dynamics problem by seeking to analyze the Collatz conjecture from the tree of numbers sequences. First, we show numerically that the distribution of odd numbers has an initial transient, and proceeds…
For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
The inverse Galois problem asks whether any finite group can be realised as the Galois group of a Galois extension of the rationals. This problem and its refinements have stimulated a large amount of research in number theory and algebraic…
The notion of $(a,b)$-cores is closely related to rational $(a,b)$ Dyck paths due to Anderson's bijection, and thus the number of $(a,a+1)$-cores is given by the Catalan number $C_a$. Recent research shows that $(a,a+1)$ cores with distinct…
In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…
$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of…
The 6th problem of the 50th International Mathematical Olympiad (IMO), held in Germany, 2009, is called 'the grasshopper problem'. To this problem Kos developed theory from unique viewpoints by reference of Noga Alon's combinatorial…