In this note, we show that the set of n such that the arithmetic mean of the first n primes is an integer is of asymptotic density zero. We use the same method to show that the set of n such the sum of the first n primes is a square is also of asymptotic density zero. We also prove that both the arithmetic mean of the first n primes as well as the square root of the sum of the first n primes ar...

In an examination of the time course of activation of phonological and semantic information in processing kanji script, two lexical decision experiments were conducted with native readers of Japanese. Kanji targets were preceded at short (85-msec) and long (150-msec) intervals by homophonic, semantically related, or unrelated primes presented in kanji (Experiment 1) or by hiragana transcription...

A modified priming task was used to investigate whether skilled readers are able to adjust the degree to which lexical and sublexical information contribute to naming. On each trial, participants named 5 low-frequency exception word primes or 5 nonword primes before a target. The low-frequency exception word primes should have produced a greater dependence on lexical information, whereas the no...

Cognitive linguists suggest that understanding metaphors requires activation of conceptual mappings between the involved concepts. We tested whether mappings are indeed in use during metaphor comprehension, and what mapping means as a cognitive process with Event-Related Potentials. Participants read literal, conventional metaphorical, novel metaphorical, and anomalous target sentences preceded...

Since cryptosystem based on the problem of factoring the composite number N can be attacked with P − 1 and P +1 methods, it is required that P −1 and P +1 should be difficult to be factored into many small primes, where we assume that the P is a factor of N . In this paper, first, we consider the distribution of secure primes against both P −1 and P +1 methods. Second, we propose two efficient ...

In recent years, a number of models of orthographic coding have been proposed in which the orthographic code consists of a set of units representing bigrams (open-bigram models). Three masked priming experiments were undertaken in an attempt to evaluate this idea: a conventional masked priming experiment, a sandwich priming experiment (Lupker & Davis, 2009) and an experiment involving a masked ...

A graph is edge-primitive if its automorphism group acts primitively on the edge set of graph. Edge-primitive graphs form an important subclass symmetric graphs. In this paper, order as a product two distinct primes are completely determined. This depends non-abelian simple groups with subgroup index pq being classified, where p>q odd primes.

A action is often criticized for causing reverse discrimination and lowering the qualifications of those hired under the policy. However, the magnitude of such adverse effects depends on whether the best suited candidate is hired absent the policy. Indeed affirmative action may compensate for the distortion discrimination imposes on the selection of candidates. This paper asks whether affirmati...

Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method is guaranteed to work if we use a sufficiently large set of good primes. In many applications, however, there is no efficient way of excluding bad primes. In...

arising from the localization sequence in algebraic K-theory has a torsion cokernel. Here p runs over a set of primes which satisfy a certain condition explained below. When C is an elliptic curve, all but finite number of primes p satisfy the condition. By using this fact, Langer and Saito give a finiteness result for the torsion subgroup of the Chow group CH(C × C)([LS]). When g = genus(C) > ...