On the density of odd integers of the form (p − 1)2−n and related questions

It is shown that odd integers k such that k · 2ⁿ + 1 is prime for some positive integer n have a positive lower density. More generally, for any primes p₁, …, p_r, the integers k such that k is relatively prime to each of p₁,…, p_r, and such that k · p₁^n₁p₂^n₂ … p_r^n_r + 1 is prime for some n₁,…, n_r, also have a positive lower density.     

Über (k,r)-Zahlen

For given integersr andk, 0<r<k, any integern>1 is uniquely representable in the formn=d ^k ·m withm k-free (that means there is nok-th prime powerp ^k dividingm);n is called a (k, r)-integer, ifm isr-free. In the present paper asymptotic formulae are derived for the number of (k, r)-integersn≤x contained in a given arithmetic progression and for the number of representations of a positive integer, as the sum of a (k ₁,r ₁)-integer and a (k ₂,r ₂)-integer.     

Analytic methods applied to a sequence of binomial coefficients

In previous work we have shown that the binomial coefficients C_n··kr, r are strongly logarithmically concave for 0?r?[n/(k+1)] and hence have at most a double maximum. Let r_{n, k} be the least integer at which this maximum occurs. Properties of {r_{n, k}}_{n, k} are best derived by introducing the polynomial family Q_k(x,y) defined by Q_k(x,y) = ∏^k+1_j=1 [1?(k+1)x+jy]?x∏^k_j=1[1?kx+jy]. It is shown that for each k there is a unique function η_k(y) defined on [0, 1/(k+1)] which is analytic in a neighbourhood of zero and which satisfies Q_k(η_k(y), y)=0. Setting η_k(0)=δ_k, η¹_k(0)=α_k we prove that r_rn,k = [nδ_k] o[nδ_k]+1 and further, that the number of times that r_m,k = [mδ_k]+1 for k+1? m ? n is asymptotically nα_k. Several other properties of α_k are derived, including 0<α_k <1/2.     

Successes,runs and longest runs

The probability distribution of the number of success runs of length k (⩾1) in n (⩾1) Bernoulli trials is obtained. It is noted that this distribution is a binomial distribution of order k, and several open problems pertaining to it are stated. Let S_n and L_n, respectively, denote the number of successes and the length of the longest success run in the n Bernoulli trials. A formula is derived for the probability P(L_n ⩽ k | S_n = r) (0 ⩽ k ⩽ r ⩽ n), which is alternative to those given by Burr and Cane (1961) and Gibbons (1971). Finally, the probability distribution of X_{n, Ln}^(k) is established, where X_{n, Ln}^(k) denotes the number of times in the n Bernoulli trials that the length of the longest success run is equal to k.     

Successes,runs and longest runs

The probability distribution of the numbeer of success runs of length k ( >/ 1) in n ( ⩾ 1) Bernoulli trials is obtained. It is noted that this distribution is a binomial distribution of order k, and several open problems pertaining to it are stated. Let S_n and L_n, respectively, denote the number of successes and the length of the longest success run in the n Bernoulli trials. A formula is derived for the probability P(L_n ⩽ k | S_n = r) (0 ⩽ k ⩽ r ⩽ n), which is alternative to those given by Burr and Cane (1961) and Gibbons (1971). Finally, the probability distribution of X_{n, Ln}^(k) is established, where X_{n, Ln}^(k) denotes the number of times in the n Bernoulli trials that the length of the longest success run is equal to k.     

Exact constants in Jackson inequalities for periodic differentiable functions in the space L ∞

It is proved that, in the space L _∞[0, 2π], the following equalities hold for all k = 0, 1, 2, …, n ∈ ?, r = 1, 3, 5, …, µ≥ r: where E _n?1(f) and E _n,µ (f) are the best approximations of f by, respectively, trigonometric polynomials of degree n ? 1 and 2π-periodic splines of minimal deficiency of order µ with 2n equidistant nodes, ω(f ^(r), h) is the modulus of continuity of f ^(r), Ψ _r,2k+1 is the rth periodic integral of the special function Ψ _0,2k+1, which is odd and piecewise constant on the partition jπ/(2k + 1), j ∈ ?. For k = 0, this result was obtained earlier by Ligun.     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

Polynomials generalizing binomial coefficients and their application to the study of Fermat's last theorem

We study properties of the polynomials φ_k(X) which appear in the formal development Π_{k ? 0}ⁿ (a + bX^k)^rk = Σ_{k ≥ 0}φ_k(X) a^{r ? k}b^k, where r_k ∈ $\text{l}$ and r = Σr_k. this permits us to obtain the coefficients of all cyclotomic polynomials. Then we use these properties to expand the cyclotomic numbers G_r(ξ) = Π_{k = 1}^{p ? 1} (a + bξ^k)^kr, where p is a prime, ξ is a primitive pth root of 1, a, b ∈ $\text{l}$ and 1 ≤ r ≤ p ? 3, modulo powers of ξ ? 1 (until (ξ ? 1)^{2(p ? 1) ? r}). This gives more information than the usual logarithmic derivative. Suppose that $\text{p ? ab(a + b)}$. Let $\text{m = ?}\text{b}\text{a}$. We prove that G_r(ξ) ≡ c^p mod p(ξ ? 1)² for some c ∈ $\text{l}$, if and only if Σ_{k = 1}^{p ? 1}k^{p ? 2 ? r}m^k ≡ 0 (mod p). We hope to show in this work that this result is useful in the study of the first case of Fermat's last theorem.     

Long time small solutions to nonlinear parabolic equations

A sharp result on global small solutions to the Cauchy problem $$u_t = \Delta u + f\left( {u,Du,D^2 u,u_t } \right)\left( {t > 0} \right),u\left( 0 \right) = u_0 $$ In Rⁿ is obtained under the the assumption thatf is C^1+r forr>2/n and ‖u ₀‖C²(R ⁿ ) +‖u ₀‖W ₁ ² (R ⁿ ) is small. This implies that the assumption thatf is smooth and ‖u ₀ ‖W ₁ ^k (R ⁿ )+‖u ₀‖W ₂ ^k (R ⁿ ) is small fork large enough, made in earlier work, is unnecessary.     

Estimation of an algebraic polynomial in a plane in terms of its real part on the unit circle

We consider the class P _n ^* of algebraic polynomials of a complex variable with complex coefficients of degree at most n with real constant terms. In this class we estimate the uniform norm of a polynomial P _n ∈ P _n ^* on the circle Γ_r = z ∈ ?: ¦z¦ = r of radius r = 1 in terms of the norm of its real part on the unit circle Γ₁ More precisely, we study the best constant μ(r, n) in the inequality ||P_n||C(Γ_r) ≤ μ(r,n)||Re P_n||C(Γ₁). We prove that μ(r,n) = rⁿ for rⁿ⁺² ? r ⁿ ? 3r² ? 4r + 1 ≥ 0. In order to justify this result, we obtain the corresponding quadrature formula. We give an example which shows that the strict inequality μ(r, n) = r ⁿ is valid for r sufficiently close to 1.     

Limit distributions for the maxima of stationary Gaussian processes

Let {X_n} be a stationary Gaussian sequence with E{X₀} = 0, {X²₀} = 1 and E{X₀X_n} = rⁿ_n Let c_n = (2ln n)^{$\text{built1}\text{2}$}, b_n = c_n? $\text{1}\text{2}$c^-1_n ln(4π ln n), and set M_n = max_{0 ?k?n}X_k. A classical result for independent normal random variables is that

$\text{P[c}{}_{\mathrm{n}}\text{(M}{}_{\mathrm{n}}\text{?b}{}_{\mathrm{n}}\text{)?x]→exp[-e}{}^{\mathrm{-x}}\text{] as n → ∞ for all x.}$

Berman has shown that (1) applies as well to dependent sequences provided r_nlnn = o(1). Suppose now that {r_n} is a convex correlation sequence satisfying r_n = o(1), (r_nlnn)^-1 is monotone for large n and o(1). Then

$\text{P[r}{}_{\mathrm{n}}{}^{\mathrm{<mtext>-1</mtext><mtext>2</mtext>}}\text{(M}{}_{\mathrm{n}}\text{? (1?r}{}_{\mathrm{n}}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{b}{}_{\mathrm{n}}\text{)?x] → Ф(x)}$

for all x, where Ф is the normal distribution function. While the normal can thus be viewed as a second natural limit distribution for {M_n}, there are others. In particular, the limit distribution is given below when r_n is (sufficiently close to) γ/ln n. We further exhibit a collection of limit distributions which can arise when r_n decays to zero in a nonsmooth manner. Continuous parameter Gaussian processes are also considered. A modified version of (1) has been given by Pickands for some continuous processes which possess sufficient asymptotic independence properties. Under a weaker form of asymptotic independence, we obtain a version of (2).     

Jackson-type inequalities and widths of function classes in L 2

The sharp Jackson-type inequalities obtained by Taikov in the space L ₂ and containing the best approximation and the modulus of continuity of first order are generalized to moduli of continuity of kth order (k = 2, 3, ... ). We also obtain exact values of the n-widths of the function classes F(k, r, Φ) and F _k ^r (h), which are a generalization of the classes F(1, r, Φ) and F _k ^r (h) studied by Taikov.     

On integrality of Eisenstein liftings

Letf be a holomorphic Siegel modular form of integral weightk for Sp_2r (Z). Forn≥r, let[f] _r ⁿ be the lift off to Sp_2n (Z) via the Klingen type Eisenstein series, which is defined under some conditions onk. We study an integrality property of the Fourier coefficients of[f] _r ⁿ . A common denominator for them is described in terms of a critical value of the standardL-function attached tof, some Bernoulli numbers, and a certain ideal depending only onf. The result specialized to the caser=0 coincides with the Siegel-Böcherer theorem on the Siegel type Eisenstein series.     

Some conformal and projective scalar invariants of Riemannian manifolds

It is proved that, on any closed oriented Riemannian n-manifold, the vector spaces of conformal Killing, Killing, and closed conformal Killing r-forms, where 1 ≤ r ≤ n ? 1, have finite dimensions t _r , k _r , and p _r , respectively. The numbers t _r are conformal scalar invariants of the manifold, and the numbers k _r and p _r are projective scalar invariants; they are dual in the sense that t _r = t _n?r and k _r = p _n?r . Moreover, an explicit expression for a conformal Killing r-form on a conformally flat Riemannian n-manifold is given.     

The Zygmund Morse-Sard Theorem

The classical Morse-Sard Theorem says that the set of critical values off:R ^n+k →R ⁿ has Lebesgue measure zero iff ∈C ^k+1. We show theC ^k+1 smoothness requirement can be weakened toC ^k+Zygmund. This is corollary to the following theorem: For integersn >m >r > 0, lets = (n ?r)/(m ?r); iff:R ⁿ →R ^m belongs to the Lipschitz class Λ _s andE is a set of rankr forf, thenf(E) has measure zero.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

The period of the Fibonacci random number generator

Smith, Green, and Klem introduced the Fibonacci RNG in [7]. A starting vector of k integers is chosen, and new numbers are generated by the recurrence r_n≡r_n−1+r_n−k (mod M). For a prime M and some choices of the parameter k, any non-zero initial vector υ gives a sequence with a period of M^kminus;1. However, in most cases, different initial values give rise to very different periods. This behavior was noted by the authors, but left unexplained. In this paper we review how sequences with short periods arise, and provide an algorithm that selects different starting vectors that give a maximal period.     

On a problem of Chvátal and Erdös on hypergraphs containing no generalized simplex

Let X be an n-element set and $\text{T}$ a family of k-subsets of X. Let r be an integer, k > r ? 2. Suppose that $\text{T}$ does not contain r + 1 members having empty intersection such that any r of them intersect non-trivially. Chvátal and Erdös conjectured that for (r + 1) k ? rn we have |$\text{F}$|$\text{?}\text{n?1}\text{k?1}$. In this paper we first prove that This conjecture holds asymptotically (Theory 1). In Theorems 4 and 5 we prove it for r = 2, K ? 5, n > n_o(k); k ? 3r, n > n_o(k, r), respectively.     

On the odd harmonious graphs with applications

The necessary conditions for the existence of odd harmonious labelling of graph are obtained. A cycle C _n is odd harmonious if and only if n≡0 (mod 4). A complete graph K _n is odd harmonious if and only if n=2. A complete k-partite graph K(n ₁,n ₂,…,n _k ) is odd harmonious if and only if k=2. A windmill graph K _n ^t is odd harmonious if and only if n=2. The construction ways of odd harmonious graph are given. We prove that the graph ∨ _i=1 ⁿ G _i , the graph G(+r ₁,+r ₂,…,+r _p ), the graph $\bar{K_{m}}+_{0}P_{n}+_{e}\bar{K_{t}}$ , the graph G∪(X+∪ _k=1 ⁿ Y _k ), some trees and the product graph P _m ×P _n etc. are odd harmonious. The odd harmoniousness of graph can be used to solve undetermined equation.