Results 61 to 70 of about 174,940 (323)
Polynomial Triangles Revisited [PDF]
, 2012 A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to fill this gap.
Mohammedia Morocco, Nour-eddine Fahssi
core
On sums of binomial coefficients [PDF]
Proyecciones (Antofagasta)We investigate the integral representation of infinite sums involving the ratio of binomial coefficients. We also recover some wellknown properties of ζ (3) and extend the range of results given by other authors.
openaire +3 more sources
Arthritis Care &Research, Accepted Article.Objectives This study aims to develop hip morphology‐based radiographic hip osteoarthritis (RHOA) risk prediction models and investigates the added predictive value of hip morphology measurements and the generalizability to different populations. Methods We combined data from nine prospective cohort studies participating in the World COACH consortium ...
Myrthe A. van den Berg +26 more
wiley +1 more source
Vieta's triangular array and a related family of polynomials
International Journal of Mathematics and Mathematical Sciences, 1991 If n≥1, let the nth row of an infinite triangular array consist of entries B(n,j)=nn−j(jn−j), where 0≤j≤[12n].
Neville Robbins
doaj +1 more source
Gauss Sums and Binomial Coefficients
Journal of Number Theory, 2002 Let \(p= tn+r\) be a prime which splits in \(\mathbb{Q}(\sqrt{-t})\) where \(t\) has one of the following forms \[ \begin{aligned} t= k>3 &\;\text{ for a prime } k\equiv 3\pmod 4,\\ t= 4k &\;\text{ for a prime } k\equiv 1\pmod 4,\\ t= 8k &\;\text{ for an odd prime } k.
Sang Geun Hahn, Dong Hoon Lee
openaire +3 more sources
Magnetic Unclonable Functions Leveraging Remanence and Anhysteretic States
Advanced Functional Materials, EarlyView.A micrometric array of magnetic pillars provides a stable and unclonable hardware for generating cryptographic keys. From a single device, the ability is demonstrated to produce a 470‐bit key while also offering a reconfigurable mode of operation.
Alessandro Magni +6 more
wiley +1 more source
MathematicsLet q1+⋯+qn+m objects be arranged in n rows with q1,…,qn objects and one last row with m objects. The Janjić–Petković counting function denotes the number of (n+k)-insets, defined as subsets containing n+k objects such that at least one object is chosen ...
Marcus Kollar
doaj +1 more source
Quotients of sequences under the binomial convolution [PDF]
Notes on Number Theory and Discrete MathematicsThis paper gives expressions for the solution {a(n)} of the equation Σ_{k=0}^{n} (n choose k)a(k)b(n-k)=c(n),n=0,1,2,..., where b(0) ≠ 0, that is, of the equation a ○ b = c in a, where ○ is the binomial convolution.
Pentti Haukkanen
doaj +1 more source
Engineering Science and Technology, an International Journal, 2023 A quad-port MIMO antenna based on a quasi-binomial series-fed array is presented in this paper for n257 and n258 millimeter-wave applications with an investigation of additional loaded patches on performance enhancement of the conventional binomial ...
Md. Abu Sufian, Niamat Hussain, Nam Kim
doaj +1 more source
Generalized Compositions and Weighted Fibonacci Numbers [PDF]
, 2010 In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient.
Janjic, Milan
core