Results 271 to 280 of about 566,663 (314)
Some of the next articles are maybe not open access.
Prime Numbers and Highly Composite Numbers
2012In 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
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
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
On distinguishing prime numbers from composite numbers
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980A new algorithm for testing primality is presented. The algorithm is distinguishable from the lovely algorithms of Solvay and Strassen [36], Miller [27] and Rabin [32] in that its assertions of primality are certain (i.e., provable from Peano's axioms) rather than dependent on unproven hypothesis (Miller) or probability (Solovay-Strassen, Rabin).
openaire +1 more source
1998
If K is the compositum of two number fields k 1 and k 2 then the discriminant of K is divisible by all those rational prime numbers which divide the discriminant of k 1 or the discriminant of k 2 or both and only by those prime numbers.
openaire +1 more source
If K is the compositum of two number fields k 1 and k 2 then the discriminant of K is divisible by all those rational prime numbers which divide the discriminant of k 1 or the discriminant of k 2 or both and only by those prime numbers.
openaire +1 more source
Classification of composite numbers
Classification of Composite Numbers: A system that categorizes numbers by their exact number of factors using σ(n), with labels like Terti, Quadra, Penta, etc., and a digit-syllable method for easy reference. It highlights patterns in numbers and their structure in a simple, organized way.openaire +2 more sources
CARD APPEARANCE NUMBERS AND COMPOSITION
Payment cards have evolved from embossed paper tokens in the 1920s to today’s multilayered, data-rich, machine-readable artefacts. Their outward appearance—the printed design, dimension, embossing and embedded electronics—hides a precisely standardised internal logic.Abdisamatov, Otabek, Najimov, Zohid
openaire +1 more source
Cancer treatment and survivorship statistics, 2022
Ca-A Cancer Journal for Clinicians, 2022Kimberly D Miller +2 more
exaly
Compositions and Fibonacci Numbers
The Fibonacci Quarterly, 1969V. E. Hoggatt, D. A. Lind
openaire +1 more source