Results 251 to 260 of about 10,631,891 (293)
Some of the next articles are maybe not open access.

On Distinguishing Prime Numbers from Composite Numbers

The Annals of Mathematics, 1983
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adleman, Leonard M.   +2 more
openaire   +2 more sources

On Highly Composite Numbers

Journal of the London Mathematical Society, 1944
A (positive whole) number is called highly composite if it has more divisors than any smaller number, highly abundant if the sum of its divisors is greater than that for any smaller number, and superabundant if the sum of the reciprocals of its divisors is greater than that for any smaller number. The author uses \textit{A. E.
openaire   +2 more sources

The least witness of a composite number

1998
We consider the problem of finding the least witness of a composite number. If n is a composite number then a number w for which n is not a strong pseudo-prime to the base w is called a witness for n. Let w(n) be the least witness for a composite n. Bach [7] assuming the Generalized Riemann Hypothesis (GRH) showed that w(n) < 2log2 n.
R. Balasubramanian, S. V. Nagaraj
openaire   +1 more source

On the Number and the Composition of Varieties

The Economic Journal, 2009
At the same time, the composition of final goods may also differ across countries. Indeed, classical studies by Pyatt (1964) and Paroush (1965) examined priority patterns of final goods in Britain (using British Market Research Bureau Survey) and in Israel (using Labour Force Survey, Central Bureau of Statistics), respectively.
openaire   +1 more source

The basis number of the composition of graphs

2012
Summary: The basis number of a graph \(G\) is defined to be the least integer \(k\) such that \(G\) has a \(k\)-fold basis for its cycle space. We investigate the basis number of the composition of two paths, two cycles, a path and a cycle, a path and a wheel, a cycle and a wheel, a star and a wheel, a star and a path, a star and a cycle, a wheel and a
Hailat, Mohammad, Al-Zoubi, Ma'ared
openaire   +2 more sources

Stick Numbers and Composition of Knots and Links

Journal of Knot Theory and Its Ramifications, 1997
We address the concept of stick number for knots and links under various restrictions concerning the length of the sticks, the angles between sticks, and placements of the vertices. In particular, we focus on the effect of composition on the various stick numbers.
Adams, Colin C.   +3 more
openaire   +1 more source

Highly Composite Numbers

2012
In 1915, the London Mathematical Society published in its Proceedings a paper by Ramanujan entitled Highly Composite Numbers.
George E. Andrews, Bruce C. Berndt
openaire   +1 more source

Notes on composite numbers

Proceedings of the Institution of Electrical Engineers, 1963
A certain number system, governing combinatorial operations of elements of a given set, is provided. The operations are commutative, associative and distributive. The system rules countable sets of elements, i.e. parameters, such as define a complex number, and serves for precise and compact statements and for rational evaluation of explicit computable
openaire   +1 more source

Prime Numbers and Highly Composite Numbers

2012
In 1915, Ramanujan wrote a long paper on “highly composite numbers.” This paper gives us a general method to analyse the growth of arithmetic functions. It is curious that this paper finds no discussion in Hardy’s “Twelve lectures.” In hindsight, we learn that the theory has a rich structure as well as interplay with other parts of number theory ...
M. Ram Murty, V. Kumar Murty
openaire   +1 more source

ON BRIDGE NUMBERS OF COMPOSITE RIBBON KNOTS

Journal of Knot Theory and Its Ramifications, 2000
Bleiler and Eudave-Muñoz showed that composite ribbon number one knots have two-bridge summands. In this paper, we show that there exists an infinite family of composite ribbon number one knots which have arbitrary large bridge numbers.
openaire   +2 more sources

Home - About - Disclaimer - Privacy