نتایج جستجو برای: rainbow arithmetic progression
تعداد نتایج: 232746 فیلتر نتایج به سال:
We determine all nontrivial integer solutions to the equation (x+r)2+(x+2r)2+⋯+(x+dr)2=yn for 2≤d≤10 and 1≤r≤104 with gcd(x,y)=1. make use of a factorization argument primitive divisors theorem due Bilu, Hanrot Voutier.
Article history: The ability of rainbow trou Received 21 August 2007 Received in revised form 10 March 2008 Accepted 11 March 2008
Let [Formula: see text] be a polynomial with the property that corresponding to every prime there exists an integer such text]. In this paper, we establish some equidistributed results between number of partitions whose parts are taken from sequence and those which in certain arithmetic progression.
We present some binomial identities for sums of the bivariate Fi-bonacci polynomials and for weighted sums of the usual Fibonacci polynomials with indices in arithmetic progression.
the major aim of this study was to investigate the relationship between iq, eq and test format in the light of test fairness considerations. this study took this relationship into account to see if people with different eq and iq performed differently on different test formats. to this end, 90 advanced learners of english form college of ferdowsi university of mashhad were chosen. they were ask...
We describe a particular greedy construction of an arithmetic progression-free sequence from a finite composition. We also give an analysis on the properties of the resulting sequence.
In this paper we determine the perfect powers that are sums of three fifth in an arithmetic progression. More precisely, completely solve Diophantine equation(x−d)5+x5+(x+d)5=zn,n≥2, where d,x,z∈Z and d=2a5b with a,b≥0.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید