Search results
Jump to navigation
Jump to search
- ...[[Addition|sum]] and [[Subtraction|difference]] of a pair of values whose logarithms are known, without knowing the values themselves.<ref name="Theodora"/> ...s <math>s_b(z)</math> and <math>d_b(z)</math> are also known as ''Gaussian logarithms''. ...7 KB (1,019 words) - 05:13, 19 December 2024
- ...ulus]], '''logarithmic differentiation''' or '''differentiation by taking logarithms''' is a method used to [[derivative|differentiate]] [[function (mathematics ...ic differentiation relies on the [[chain rule]] as well as properties of [[logarithms]] (in particular, the [[natural logarithm]], or the logarithm to the base ' ...7 KB (1,210 words) - 18:58, 26 February 2024
- {{short description|Approximate identity involving logarithms of primes}}In [[number theory]], '''Selberg's identity''' is an approximate ...3 KB (430 words) - 19:56, 21 August 2023
- ...he algorithm gets its security from the difficulty of computing [[discrete logarithms]].<ref name="schneier">Bruce Schneier, ''Applied Cryptography: Protocols, A ...number <math>p</math> needs to be large enough so that computing discrete logarithms modulo <math>p</math> is infeasible.<ref name="schneier"/> To be more prec ...3 KB (439 words) - 04:33, 28 April 2024
- ...operation. The log semiring also arises when working with numbers that are logarithms (measured on a [[logarithmic scale]]), such as [[decibel]]s (see {{slink|De ...n is the same as usual addition, <math>x \otimes_b y = x + y</math>, since logarithms take multiplication to addition; however, log addition depends on base. The ...6 KB (951 words) - 23:15, 28 March 2023
- ...may be seen as a generalisation of [[Baker's theorem]] on linear forms in logarithms. [[Gisbert Wüstholz]] proved it in the 1980s.<ref>{{cite journal | last=Wüs ...cceeded to get the final expected form for lower bound for linear forms in logarithms. This was put into an effective form in a joint work of him with [[Alan Bak ...4 KB (485 words) - 01:39, 16 November 2022
- ...adleman">L. Adleman, M.D. Huang. "Function Field Sieve Method for Discrete Logarithms over Finite Fields". In: Inf. Comput. 151 (May 1999), pp. 5-16. DOI: 10.100 ...f D. Coppersmith <ref>D. Coppersmith. (1984), "Fast evaluation of discrete logarithms in fields of characteristic two". In: IEEE Trans. Inform. Theory IT-39 (198 ...13 KB (2,244 words) - 22:36, 7 April 2024
- ...theory, [[Transcendental number theory|transcendence]], [[linear forms in logarithms]], [[Effective results in number theory|effective methods]], [[Diophantine *{{Citation | last1=Baker | first1=Alan | title=Linear forms in the logarithms of algebraic numbers. I | doi=10.1112/S0025579300003971 | mr=0220680 | year ...9 KB (1,106 words) - 04:15, 25 November 2024
- ...hematics)|regulator]] defined using p-adic logarithms instead of the usual logarithms, introduced by {{harvs|txt|authorlink=Heinrich-Wolfgang Leopoldt|first=H.-W ...5 KB (645 words) - 07:48, 13 January 2024
- ...rtin|last2=Ruf|first2=Johannes|date=2019|title=Stochastic exponentials and logarithms on stochastic intervals — A survey|journal=Journal of Mathematical Analysis ...rtin|last2=Ruf|first2=Johannes|date=2019|title=Stochastic exponentials and logarithms on stochastic intervals — A survey|journal=Journal of Mathematical Analysis ...6 KB (953 words) - 08:38, 27 August 2024
- {{short description|On algebraic independence of logarithms}} To simplify notation, let <math>\mathbb{L}</math> be the set of logarithms to the base ''e'' of nonzero [[algebraic number]]s, that is ...21 KB (3,217 words) - 12:27, 5 January 2025
- ==Bootstrapping other logarithms== ...tabulate the logarithms of the [[prime number]]s and in the next layer the logarithms of the [[Composite number|composite]] numbers {{math|''c''}} based on their ...23 KB (2,523 words) - 17:21, 1 November 2024
- If [[binary logarithm|base 2 logarithms]] and powers of 2 are used instead, then the unit of information is the [[s ...9 KB (1,188 words) - 03:29, 16 October 2023
- ...(q) = e^{\sqrt{\ln q \times \ln\ln q}}</math> though after that individual logarithms can be calculated fairly quickly."</ref> It turns out that much Internet tr ...e data for a single 512-bit prime. Once that was done, however, individual logarithms could be solved in about a minute using two 18-core [[Intel Xeon]] CPUs.<re ...12 KB (1,625 words) - 17:17, 5 July 2024
- ...'dman|first=N I|date=1968|title=Improved Estimate For A Linear Form Of The Logarithms Of Algebraic Numbers|journal=Mathematics of the USSR-Sbornik|volume=6|issue ...7 KB (985 words) - 13:54, 2 April 2022
- ...ator]] and [[denominator]] are equal. Other ratios are compared to one by logarithms, often [[common logarithm]] using base 10. The ratio scale then segments by ...the [[additive identity]]), known as the [[probability semiring]]; taking logarithms (with a choice of base giving a [[logarithmic unit]]) gives an [[isomorphis ...9 KB (1,332 words) - 23:37, 8 July 2024
- ...a sequence of exponentiations of terms of an arithmetic sequence. Sums of logarithms correspond to products of exponentiated values. ...9 KB (1,344 words) - 19:39, 10 October 2024
- [[Category:Logarithms]] ...3 KB (492 words) - 04:19, 24 January 2025
- ...uary 2022|reason=it doesn't describe what the current records for discrete logarithms are.}} ...u/cgi-bin/wa.exe?A2=NMBRTHRY;fd743373.1912 “795-bit factoring and discrete logarithms,”] December 2, 2019.</ref><ref>F. Boudot et al, [https://eprint.iacr.org/20 ...32 KB (4,457 words) - 04:39, 20 January 2025
- ===Exponential and logarithms=== ...18 KB (2,870 words) - 23:00, 11 July 2024