Results 201 to 210 of about 9,463,996 (246)
Molecular Oncology, EarlyView.We established the avian chorioallantoic membrane (CAM) assay as a scalable in vivo model for studying circulating tumor cells (CTCs). Human gastrointestinal tumors spontaneously released genetically validated CTCs that were detected across multiple platforms, demonstrating that the CAM model provides an accessible tool for investigating early cancer ...
Dennis Roth +17 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Number of Compositions of Two Polycubes
2021We provide almost tight bounds on the minimum and maximum possible numbers of compositions of two polycubes, either when each is of size n, or when their total size is 2n, in two and higher dimensions. We also provide an efficient algorithm (with some trade-off between time and space) for computing the number of composition two given polyominoes (or ...
Andrei Asinowski +4 more
openaire +1 more source
On the Fibonacci numbers of the composition of graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Loiret Alejandría Dosal-Trujillo +1 more
openaire +1 more source
On Distinguishing Prime Numbers from Composite Numbers
The Annals of Mathematics, 1983zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adleman, Leonard M. +2 more
openaire +2 more sources
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
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
2021
A positive integer p is called a prime, if p has exactly two different positive divisors. Every prime p is thus greater than 1 and it is divisible by itself and 1. Positive integers greater than 1 are called composite if they are not primes.
Michal Křížek +2 more
openaire +1 more source
A positive integer p is called a prime, if p has exactly two different positive divisors. Every prime p is thus greater than 1 and it is divisible by itself and 1. Positive integers greater than 1 are called composite if they are not primes.
Michal Křížek +2 more
openaire +1 more source
The least witness of a composite number
1998We 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, 2009At 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
2012Summary: 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
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
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