On rings whose prime ideals are completely prime

We investigate in this paper rings whose proper ideals are 2-primal. We concentrate on the connections between this condition and related concepts to this condition, and several kinds of π-regularities of rings which satisfy this condition. Moreover, we add counterexamples to the situations that occur naturally in the process of this note.     

Density functions for prime and relatively prime numbers

Letr ^*(x) denote the maximum number of pairwiserelatively prime integers which can exist in an interval (y,y+x] of lengthx, and let ^*(x) denote the maximum number ofprime integers in any interval (y,y+x] whereyx. Throughout this paper we assume the primek-tuples hypothesis. (This hypothesis could be avoided by using an alternative sievetheoretic definition of ^*(x); cf. the beginning of Section 1.) We investigate the differencer ^*(x)—^*(x): that is we ask how many more relatively prime integers can exist on an interval of lengthx than the maximum possible number of prime integers. As a lower bound we obtainr ^*(x)—^*(x)<x ^c for somec>0 (whenx). This improves the previous lower bound of logx. As an upper bound we getr ^*(x)—^*(x)=o[x/(logx)²]. It is known that ^*(x)—(x)>const.[x/(logx)²];.; thus the difference betweenr ^*(x) and ^*(x) is negligible compared to ^*(x)—(x). The results mentioned so far involve the upper bound or maximizing sieve. In Section 2, similar comparisons are made between two types of minimum sieves. One of these is the erasing sieve, which completely eliminates an interval of lengthx; and the other, introduced by Erdös and Selfridge [1], involves a kind of minimax for sets of pairwise relatively prime numbers. Again these two sieving methods produce functions which are found to be closely related.     

On prime,weakly prime ideals in ordered semigroups

Communicated by J. S. Ponizovsk?     

On the least prime primitive root modulo a prime

We derive a conditional formula for the natural density of prime numbers having its least prime primitive root equal to , and compare theoretical results with the numerical evidence.

     

Special prime numbers and discrete logs in finite prime fields

A set of primes involving numbers such as , where and , is defined. An algorithm for computing discrete logs in the finite field of order with is suggested. Its heuristic expected running time is for , where as , , and . At present, the most efficient algorithm for computing discrete logs in the finite field of order for general is Schirokauer's adaptation of the Number Field Sieve. Its heuristic expected running time is for . Using rather than general does not enhance the performance of Schirokauer's algorithm. The definition of the set and the algorithm suggested in this paper are based on a more general congruence than that of the Number Field Sieve. The congruence is related to the resultant of integer polynomials. We also give a number of useful identities for resultants that allow us to specify this congruence for some .

     

Asymmetric prime ends

Summary Each simply connected domain in the plane has at most countably many prime ends whose right and left wings do not coincide. On the other hand, to each countable setE on the unit circleC there corresponds a function which is holomorphic and univalent in the unit diskD and which has the property that it carries each point ofE and no point ofC\E onto a prime end with unequal wings.     

n-almost prime submodules

Let R be a commutative ring with identity. A proper submodule N of an R-module M will be called prime [resp. n-almost prime], if for r ∈ R and a ∈ M with ra ∈ N [resp. ra ∈ N \ (N: M) ^n?1 N], either a ∈ N or r ∈ (N: M). In this note we will study the relations between prime, primary and n-almost prime submodules. Among other results it is proved that:

1. If N is an n-almost prime submodule of an R-module M, then N is prime or N = (N: M)N, in case M is finitely generated semisimple, or M is torsion-free with dim R = 1.
2. Every n-almost prime submodule of a torsion-free Noetherian module is primary.
3. Every n-almost prime submodule of a finitely generated torsion-free module over a Dedekind domain is prime.
4. There exists a finitely generated faithful R-module M such that every proper submodule of M is n-almost prime, if and only if R is Von Neumann regular or R is a local ring with the maximal ideal m such that m ² = 0.
5. If I is an n-almost prime ideal of R and F is a flat R-module with IF ≠ F, then IF is an n-almost prime submodule of F.

     

Fully prime rings

The structure of rings all of whose ideals are prime is studied and several examples of such rings are constructed.     

On sums of a prime and four prime squares in short intervals

In this paper, we are able to sharpen Hua's classical result by showing that each sufficiently large integer can be written as

     

On sums of a prime and four prime squares in short intervals

In this paper, we prove that each sufficiently large integer N ≠1（mod 3） can be written as N=p＋p1^2＋p2^2＋p3^2＋p4^2, with
｜p-N/5｜≤U,｜pj-√N/5｜≤U,j=1,2,3,4,
where U=N^2/20＋c and p,pj are primes.     

关于一个素数和一个素数的k次方和问题

设k≥2,且Hk表示一个正整数n的集合,使得该集合中的元素满足a+bk≡n(modq)对任意的q,在模q的既约剩余系中有解,令Dk(N)表示所有的n≤N,且n∈Hk且不能表成p1+p2k=n形式的整数.那么在GRH下, Dk(N)相似文献   

Regularity of prime ideals

Mathematische Zeitschrift - We answer several natural questions which arise from a recent paper of McCullough and Peeva providing counterexamples to the Eisenbud–Goto Regularity Conjecture....     

No distribution is prime

Summary Letℱ denote the convolution semigroup of probability distributions on the real line. We prove thatno element of ℱ is prime in the sense that given anℱ one can always find two distributionsG,H∈ℱ such thatF is a convolution factor ofG#x002A;H but neither ofG nor ofH. In contrast,ℱ is known to possess many irreducible elements.