Search results
Results from the WOW.Com Content Network
A strong acid, such as hydrochloric acid, at concentration 1 mol dm −3 has a pH of 0, while a strong alkali like sodium hydroxide, at the same concentration, has a pH of 14. Since pH is a logarithmic scale, a difference of one in pH is equivalent to a tenfold difference in hydrogen ion concentration.
The identities of logarithms can be used to approximate large numbers. Note that log b (a) + log b (c) = log b (ac), where a, b, and c are arbitrary constants. Suppose that one wants to approximate the 44th Mersenne prime, 2 32,582,657 −1. To get the base-10 logarithm, we would multiply 32,582,657 by log 10 (2), getting 9,808,357.09543 ...
The prime number race generalizes to other moduli and is the subject of much research; Pál Turán asked whether it is always the case that π c,a (x) and π c,b (x) change places when a and b are coprime to c. [34] Granville and Martin give a thorough exposition and survey. [33] Graph of the number of primes ending in 1, 3, 7, and 9 up to n ...
Because log(x) is the sum of the terms of the form log(1 + 2 −k) corresponding to those k for which the factor 1 + 2 −k was included in the product P, log(x) may be computed by simple addition, using a table of log(1 + 2 −k) for all k. Any base may be used for the logarithm table. [53]
Other units include the nat, based on the natural logarithm, and the hartley, based on the base 10 or common logarithm. In what follows, an expression of the form p log p {\displaystyle p\log p\,} is considered by convention to be equal to zero whenever p {\displaystyle p} is zero.
[10]: 280–4 Hence, a single experiment can be used to measure the logarithms of the partition coefficient (log P) giving the distribution of molecules that are primarily neutral in charge, as well as the distribution coefficient (log D) of all forms of the molecule over a pH range, e.g., between 2 and 12.
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
An abbreviated version appeared as "The k th prime is greater than k(log k + log log k − 1) for k ≥ 2", Mathematics of Computation, Vol. 68, No. 225 (1999), pp. 411–415. ^ Erhard Schmidt, "Über die Anzahl der Primzahlen unter gegebener Grenze", Mathematische Annalen , 57 (1903), pp. 195–204.