We study some arithmetic properties of the Ramanujan function τ(n), such as the largest prime divisor P(τ(n)) and the number of distinct prime divisors ω(τ(n)) of τ(n) for various sequences of n. In particular, we show that P(τ(n)) ≥ (logn)33/31+o(1) for infinitely many n, and P(τ(p)τ(p2)τ(p3)) > (1+o(1)) log log p log log log p loglog log log p for every prime p with τ(p) 6= 0.

we prove the generalized hyers--ulam stability  of n--th order linear differential equation of the form $y^{(n)}+p_{1}(x)y^{(n-1)}+ cdots+p_{n-1}(x)y^{prime}+p_{n}(x)y=f(x)$, with condition that there exists a non--zero solution of corresponding homogeneous equation. our main results extend and improve the corresponding results obtained by many authors.

In the late eighteenth century both Euler and Legendre noticed that n +n+41 is prime for n = 0, 1, 2 . . . 39, and remarked that there are few polynomials with such small degree and coefficients that give such a long string of consecutive prime values. Rabinowitsch, at the 1912 International Congress of Mathematicians [18], showed that n + n + A is prime for n = 0, 1, 2, . . . A − 2 if and only...

Let G=Cn×Cn, where Cn denotes a cyclic group of order n, and let k∈[0,n−1]. We study the structure sequences terms from G with maximal length |S|=2n−2+k that fail to contain nontrivial zero-sum subsequence at most 2n−1−k. For k≤1, this is inverse question for Davenport Constant. k=n−1, η(G) invariant concerning short subsequences. The in both these cases (known respectively as Property B C) was...

If R is a valuation domain of maximal ideal P with a maximal immediate extension of finite rank it is proven that there exists a finite sequence of prime ideals P = L0 ⊃ L1 ⊃ · · · ⊃ Lm ⊇ 0 such that RLj /Lj+1 is almost maximal for each j, 0 ≤ j ≤ m − 1 and RLm is maximal if Lm 6= 0. Then we suppose that there is an integer n ≥ 1 such that each torsion-free R-module of finite rank is a direct s...

For nonnegative real numbers α, β, γ , A, B, and C such that B C > 0 and α β γ > 0, the difference equation xn 1 α βxn γxn−1 / A Bxn Cxn−1 , n 0, 1, 2, . . . has a unique positive equilibrium. A proof is given here for the following statements: 1 For every choice of positive parameters α, β, γ , A, B, and C, all solutions to the difference equation xn 1 α βxn γxn−1 / A Bxn Cxn−1 , n 0, 1, 2, . ...

Two characterizations of hypercubes are given: 1) A graph is a hypercube if and only if it is antipodal and bipartite (0, 2)-graph. 2) A graph is an nhypercube if and only if there are n pairs of prime convexes, the graph is a prime convex intersection graph, and each intersection of n prime convexes (no one of which is from the same pair) is a vertex.

We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some “minimal” reasoning (i.e., in the theory I∆0) using concepts such as (the logarithm) of a binomial coefficient. In fact we prove Bertrand’s Postulate (that there is at least a prime number between n and 2n, for all n > ...

Let n be a positive odd integer and let p > n + 1 be a prime. We mainly derive the following congruence: ∑ 0<i1<···<in<p ( i1 3 ) (−1)i1 i1 · · · in ≡ 0 (mod p).

This paper studies the possible Hodge groups of simple polarizable Q-Hodge structures with Hodge numbers (n, 0, . . . , 0, n). In particular, it generalizes earlier work of Ribet and MoonenZarhin to completely determine the possible Hodge groups of such Hodge structures when n is equal to 1, 4, or a prime p. In addition, the paper determines possible Hodge groups, under certain conditions on th...