Digit Sums and Infinite Products

Consider the sequence un defined as follows: un=+1 if the sum of the base b digits of n is even, and un=−1 otherwise, where we take b=2. Recall that the Woods-Robbins infinite product involves a rational function in n and the sequence un. Although several generalizations of the Woods-Robbins product are known in the literature, no other infinite product involving a rational function in n and the sequence un was known in closed form until recently. In this chapter we introduce a systematic approach to these products, which may be generalized to other values of b. We illustrate the approach by evaluating a large class of similar infinite products.

A New Integer-to-Integer Transform

This chapter presents a detailed analysis of an integer-to-integer transform that is closely related to the discrete Fourier transform, but that offers insights into signal structure that the DFT does not. The transform is analyzed for its underlying properties using concepts from number theory. Theorems are given along with proofs to help establish the salient features of the transform. Two kinds of redundancy exist in the transform. It is shown how redundancy implicit in the transform can be eliminated to obtain a simple form. Closed-form formulas for the forward and inverse transforms are presented.

Moments of Catalan Triangle Numbers

In this chapter, we consider the Catalan numbers, C n = 1 n + 1 2 n n , and two of their generalizations, Catalan triangle numbers, B n , k and A n , k , for n , k ∈ N . They are combinatorial numbers and present interesting properties as recursive formulae, generating functions and combinatorial interpretations. We treat the moments of these Catalan triangle numbers, i.e., with the following sums: ∑ k = 1 n k m B n , k j , ∑ k = 1 n + 1 2 k − 1 m A n , k j , for j , n ∈ N and m ∈ N ∪ 0 . We present their closed expressions for some values of m and j . Alternating sums are also considered for particular powers. Other famous integer sequences are studied in Section 3, and its connection with Catalan triangle numbers are given in Section 4. Finally we conjecture some properties of divisibility of moments and alternating sums of powers in the last section.

Elliptic Curve over a Local Finite Ring Rn

The goal of this chapter is to study some arithmetic proprieties of an elliptic curve defined by a Weierstrass equation on the local ring Rn=FqX/Xn, where n≥1 is an integer. It consists of, an introduction, four sections, and a conclusion. In the first section, we review some fundamental arithmetic proprieties of finite local rings Rn, which will be used in the remainder of the chapter. The second section is devoted to a study the above mentioned elliptic curve on these finite local rings for arbitrary characteristics. A restriction to some specific characteristic cases will then be considered in the third section. Using these studies, we give in the fourth section some cryptography applications, and we give in the conclusion some current research perspectives concerning the use of this kind of curves in cryptography. We can see in the conclusion of research in perspectives on these types of curves.

Identification of Eigen-Frequencies and Mode-Shapes of Beams with Continuous Distribution of Mass and Elasticity and for Various Conditions at Supports

In the present article, an equivalent three degrees of freedom (DoF) system of two different cases of inverted pendulums is presented for each separated case. The first case of inverted pendulum refers to an amphi-hinge pendulum that possesses distributed mass and stiffness along its height, while the second case of inverted pendulum refers to an inverted pendulum with distributed mass and stiffness along its height. These vertical pendulums have infinity number of degree of freedoms. Based on the free vibration of the above-mentioned pendulums according to partial differential equation, a mathematically equivalent three-degree of freedom system is given for each case, where its equivalent mass matrix is analytically formulated with reference on specific mass locations along the pendulum height. Using the three DoF model, the first three fundamental frequencies of the real pendulum can be identified with very good accuracy. Furthermore, taking account the 3 × 3 mass matrix, it is possible to estimate the possible pendulum damages using a known technique of identification mode-shapes via records of response accelerations. Moreover, the way of instrumentation with a local network by three accelerometers is given via the above-mentioned three degrees of freedom.

Some Identities Involving 2-Variable Modified Degenerate Hermite Polynomials Arising from Differential Equations and Distribution of Their Zeros

In this chapter, we introduce the 2-variable modified degenerate Hermite polynomials and obtain some new symmetric identities for 2-variable modified degenerate Hermite polynomials. In order to give explicit identities for 2-variable modified degenerate Hermite polynomials, differential equations arising from the generating functions of 2-variable modified degenerate Hermite polynomials are studied. Finally, we investigate the structure and symmetry of the zeros of the 2-variable modified degenerate Hermite equations.

The Borel-Cantelli Lemmas, and Their Relationship to Limit Superior and Limit Inferior of Sets (or, Can a Monkey Really Type Hamlet?)

The purpose of this chapter is to show that if a monkey types infinitely, Shakespeare’s Hamlet and any other works one may wish to add to the list will each be typed, not once, not twice, but infinitely often with a probability of 1. This dramatic fact is a simple consequence of the Borel-Cantelli lemma and will come as no surprise to anyone who has taken a graduate-level course in Probability. The proof of this result, however, is quite accessible to anyone who has but a rudimentary understanding of the concept of independence, together with the notion of limit superior and limit inferior of a sequence of sets.

Prime Numbers Distribution Line

During the analysis of the fractal-primorial periodicity of the natural series of numbers, presented in the form of an alternation (sequence) of prime numbers (1 smallest prime factor > 1 of any integer), the regularity of prime numbers distribution was revealed. That is, the theorem is proved that for any integer = N on the segment of the natural series of numbers from 1 to N + 2N: (1) prime numbers are arranged in groups, by exactly three consecutive prime numbers of the form: (Р1-Р2-Р3). In this case, the distance from the first to the third prime number of any group is less than 2N integers, that is, Р3–Р1 < 2N integers. (2) These same prime numbers are redistributed in a line in groups, by exactly two consecutive prime numbers, on all segments of the natural series of numbers shorter than 2Nintegers.

I–Convergence of Arithmetical Functions

Let n > 1 be an integer with its canonical representation, n = p 1 α 1 p 2 α 2 ⋯ p k α k . Put H n = max α 1 … α k , h n = min α 1 … α k , ω n = k , Ω n = α 1 + ⋯ + α k , f n = ∏ d ∣ n d and f ∗ n = f n n . Many authors deal with the statistical convergence of these arithmetical functions. For instance, the notion of normal order is defined by means of statistical convergence. The statistical convergence is equivalent with I d –convergence, where I d is the ideal of all subsets of positive integers having the asymptotic density zero. In this part, we will study I –convergence of the well-known arithmetical functions, where I = I c q = A ⊂ N : ∑ a ∈ A a − q < + ∞ is an admissible ideal on N such that for q ∈ 0 1 we have I c q ⊊ I d , thus I c q –convergence is stronger than the statistical convergence ( I d –convergence).

Modular Sumset Labelling of Graphs

Graph labelling is an assignment of labels or weights to the vertices and/or edges of a graph. For a ground set X of integers, a sumset labelling of a graph is an injective map f:VG→PX such that the induced function f⊕:EG→PX is defined by f+uv=fu+fv, for all uv∈EG, where fu+fv is the sumset of the set-label, the vertices u and v. In this chapter, we discuss a special type of sumset labelling of a graph, called modular sumset labelling and its variations. We also discuss some interesting characteristics and structural properties of the graphs which admit these new types of graph labellings.