Common factors among pairs of consecutive integers

2018 ◽  
Vol 14 (03) ◽  
pp. 871-880 ◽  
Author(s):  
Tsz Ho Chan

In this paper, we study products of consecutive integers and prove an optimal bound on their greatest common factors. In contrast, we obtain a modest upper bound for the greatest common factor in the perfect square situation. Using this and an upper bound on the size of solutions to hyperelliptic curves, we prove a gap principle when [Formula: see text] divides [Formula: see text] with some additional restrictions. We also obtain a stronger gap principle under the abc conjecture.

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.


Author(s):  
Joachim König ◽  
François Legrand

We provide evidence for this conclusion: given a finite Galois cover $f:X\rightarrow \mathbb{P}_{\mathbb{Q}}^{1}$ of group $G$ , almost all (in a density sense) realizations of $G$ over $\mathbb{Q}$ do not occur as specializations of $f$ . We show that this holds if the number of branch points of $f$ is sufficiently large, under the abc-conjecture and, possibly, the lower bound predicted by the Malle conjecture for the number of Galois extensions of $\mathbb{Q}$ of given group and bounded discriminant. This widely extends a result of Granville on the lack of $\mathbb{Q}$ -rational points on quadratic twists of hyperelliptic curves over $\mathbb{Q}$ with large genus, under the abc-conjecture (a diophantine reformulation of the case $G=\mathbb{Z}/2\mathbb{Z}$ of our result). As a further evidence, we exhibit a few finite groups $G$ for which the above conclusion holds unconditionally for almost all covers of $\mathbb{P}_{\mathbb{Q}}^{1}$ of group $G$ . We also introduce a local–global principle for specializations of Galois covers $f:X\rightarrow \mathbb{P}_{\mathbb{Q}}^{1}$ and show that it often fails if $f$ has abelian Galois group and sufficiently many branch points, under the abc-conjecture. On the one hand, such a local–global conclusion underscores the ‘smallness’ of the specialization set of a Galois cover of $\mathbb{P}_{\mathbb{Q}}^{1}$ . On the other hand, it allows to generate conditionally ‘many’ curves over $\mathbb{Q}$ failing the Hasse principle, thus generalizing a recent result of Clark and Watson devoted to the hyperelliptic case.


2021 ◽  
Vol 40 (1) ◽  
pp. 833-847
Author(s):  
Y. A. Khan ◽  
Y. M. Chu ◽  
S. Z. Abbas

This paper investigates governments’ performance in the country. We achieved this objective differently. We employed an inverse method of assessment, with the utilization of factor copula modeling technique, to study the dependence relationship of exchange rates returns as auxiliary variables, the performance of political and army government tenures in the country in the last two decades are evaluated. Through factor analysis, common factors for the exchange rate are obtained. The analysis shows that conditioned on the common factors, the dependence amongst the elected currencies are strongly asymmetric in most of the tenures except the term of Pakistan Muslim League-Nawaz, and condition on common factor Clayton copula demonstrating hypothesis is more suitable. However, we perceive high left tail reliance among foreign currency returns during Pakistan Muslim League-Nawaz tenure, and the condition on common factor Gumbel copula molding assumption is more appropriate. We are signifying the foulest government performance in the country among all occupancies under consideration.


1989 ◽  
Vol 65 (1) ◽  
pp. 155-160 ◽  
Author(s):  
Raymond Hubbard ◽  
Stuart J. Allen

Given nuances in the computer programs, unwary researchers performing a common factor analysis on the same set of data can be expected to arrive at very different conclusions regarding the number and nature of extracted factors if they use the BMDP, as opposed to the SPSSx (or SAS), statistical software package. This is illustrated using six well-known empirical data sets from the psychology literature.


Author(s):  
Marco Lippi

High-Dimensional Dynamic Factor Models have their origin in macroeconomics, precisely in empirical research on Business Cycles. The central idea, going back to the work of Burns and Mitchell in the years 1940, is that the fluctuations of all the macro and sectoral variables in the economy are driven by a “reference cycle,” that is, a one-dimensional latent cause of variation. After a fairly long process of generalization and formalization, the literature settled at the beginning of the year 2000 on a model in which (1) both n the number of variables in the dataset and T, the number of observations for each variable, may be large, and (2) all the variables in the dataset depend dynamically on a fixed independent of n, a number of “common factors,” plus variable-specific, usually called “idiosyncratic,” components. The structure of the model can be exemplified as follows: xit=αiut+βiut−1+ξit,i=1,…,n,t=1,…,T,(*) where the observable variables xit are driven by the white noise ut, which is common to all the variables, the common factor, and by the idiosyncratic component ξit. The common factor ut is orthogonal to the idiosyncratic components ξit, the idiosyncratic components are mutually orthogonal (or weakly correlated). Lastly, the variations of the common factor ut affect the variable xit dynamically, that is through the lag polynomial αi+βiL. Asymptotic results for High-Dimensional Factor Models, particularly consistency of estimators of the common factors, are obtained for both n and T tending to infinity. Model (∗), generalized to allow for more than one common factor and a rich dynamic loading of the factors, has been studied in a fairly vast literature, with many applications based on macroeconomic datasets: (a) forecasting of inflation, industrial production, and unemployment; (b) structural macroeconomic analysis; and (c) construction of indicators of the Business Cycle. This literature can be broadly classified as belonging to the time- or the frequency-domain approach. The works based on the second are the subject of the present chapter. We start with a brief description of early work on Dynamic Factor Models. Formal definitions and the main Representation Theorem follow. The latter determines the number of common factors in the model by means of the spectral density matrix of the vector (x1tx2t⋯xnt). Dynamic principal components, based on the spectral density of the x’s, are then used to construct estimators of the common factors. These results, obtained in early 2000, are compared to the literature based on the time-domain approach, in which the covariance matrix of the x’s and its (static) principal components are used instead of the spectral density and dynamic principal components. Dynamic principal components produce two-sided estimators, which are good within the sample but unfit for forecasting. The estimators based on the time-domain approach are simple and one-sided. However, they require the restriction of finite dimension for the space spanned by the factors. Recent papers have constructed one-sided estimators based on the frequency-domain method for the unrestricted model. These results exploit results on stochastic processes of dimension n that are driven by a q-dimensional white noise, with q<n, that is, singular vector stochastic processes. The main features of this literature are described with some detail. Lastly, we report and comment the results of an empirical paper, the last in a long list, comparing predictions obtained with time- and frequency-domain methods. The paper uses a large monthly U.S. dataset including the Great Moderation and the Great Recession.


2002 ◽  
Vol 12 (05) ◽  
pp. 429-443 ◽  
Author(s):  
NAOKI KATOH ◽  
HISAO TAMAKI ◽  
TAKESHI TOKUYAMA

We give an optimal bound on the number of transitions of the minimum weight base of an integer valued parametric polymatroid. This generalizes and unifies Tamal Dey's O(k1/3 n) upper bound on the number of k-sets (and the complexity of the k-level of a straight-line arrangement), David Eppstein's lower bound on the number of transitions of the minimum weight base of a parametric matroid, and also the Θ(kn) bound on the complexity of the at-most-k level (the union of i-levels for i = 1,2,…,k) of a straight-line arrangement. As applications, we improve Welzl's upper bound on the sum of the complexities of multiple levels, and apply this bound to the number of different equal-sized-bucketings of a planar point set with parallel partition lines. We also consider an application to a special parametric transportation problem.


1988 ◽  
Vol 35 (5) ◽  
pp. 36-38
Author(s):  
Robert J. Jensen

The concept of factor is often confusing for students when it is first introduced in the elementary curriculum. Motivating the development of new ideas through problem-solving episodes can be a fruitful approach before formal instruction begins. A tiling problem is posed here for your students to investigate using the microcomputer as a tool. Since factors, common factors, and the greatest common factor play a crucial role in the solution to problems of this type, this advance activity will give students a specific context upon which to build meaning for these concepts when they are fo rmally introduced.


1987 ◽  
Vol 3 (2) ◽  
pp. 208-222 ◽  
Author(s):  
C. W. J. Granger

Many observed macrovariables are simple aggregates over a large number of microunits. It is pointed out that the generating process of the macrovariables is largely determined by the common factors in the generating mechanisms of the microvariables, even though these factors may be very unimportant at the microlevel. It follows that macrorelationships are simpler than the complete microrelationships, but that empirical investigations of microrelationships may not catch those components, containing common factors, which will determine the macrorelationship. It is also shown that an aggregate expectation or forecast is simply the common factor component of the individual agents expectations.


Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 140
Author(s):  
Nobuoki Eshima ◽  
Claudio Giovanni Borroni ◽  
Minoru Tabata ◽  
Takeshi Kurosawa

This paper proposes a method for deriving interpretable common factors based on canonical correlation analysis applied to the vectors of common factors and manifest variables in the factor analysis model. First, an entropy-based method for measuring factor contributions is reviewed. Second, the entropy-based contribution measure of the common-factor vector is decomposed into those of canonical common factors, and it is also shown that the importance order of factors is that of their canonical correlation coefficients. Third, the method is applied to derive interpretable common factors. Numerical examples are provided to demonstrate the usefulness of the present approach.


Sign in / Sign up

Export Citation Format

Share Document