|
|
| (10 intermediate revisions by 7 users not shown) |
| Line 1: |
Line 1: |
| <h2>IMPORTED REVISION FROM WIKISPACES</h2> | | {{Wikipedia}} |
| This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
| | The '''binary logarithm''', also called '''dual logarithm''' or '''logarithm base two''' (symbols: '''log<sub>2</sub>''', '''lb''', or '''ld''') of a value ''n'' is the power to which 2 is raised to obtain ''n''. The binary logarithm of a [[frequency ratio]] measures its size in [[2/1|octave]]s. [[Interval size measure]]s proportional to the octave, such as the [[cent]], can be found by multiplying the size in octaves by a constant. |
| : This revision was by author [[User:xenwolf|xenwolf]] and made on <tt>2012-03-23 04:19:38 UTC</tt>.<br>
| |
| : The original revision id was <tt>313880170</tt>.<br>
| |
| : The revision comment was: <tt>direct link</tt><br>
| |
| The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
| |
| <h4>Original Wikitext content:</h4>
| |
| <div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">The symbol **log2** is often used for the **[[http://en.wikipedia.org/wiki/Binary_logarithm|binary logarithm]]**, also called //dual logarithm//.
| |
|
| |
|
| ==Log2 of the first [[prime numbers|primes]]==
| | You can calculate the binary logarithm of ''n'' using the identity: |
| ||~ prime ||~ log2 prime ||
| |
| || 2 || 1 ||
| |
| || 3 || 1.584962501 ||
| |
| || 5 || 2.321928095 ||
| |
| || 7 || 2.807354922 ||
| |
| || 11 || 3.459431619 ||
| |
| || 13 || 3.700439718 ||
| |
| || 17 || 4.087462841 ||
| |
| || 19 || 4.247927513 ||
| |
| || 23 || 4.523561956 ||
| |
| || 29 || 4.857980995 ||
| |
|
| |
|
| You can calculate the binary logarithm of n like this
| | $$ \log_2(n) = \ln(n) / \ln(2) $$ |
|
| |
|
| log2(n) = ln(n)/ln(2)</pre></div>
| | == Binary logarithms of the first primes == |
| <h4>Original HTML content:</h4>
| | {| class="wikitable center-all" |
| <div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html"><html><head><title>log2</title></head><body>The symbol <strong>log2</strong> is often used for the <strong><a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Binary_logarithm" rel="nofollow">binary logarithm</a></strong>, also called <em>dual logarithm</em>.<br />
| | |- |
| <br />
| | ! ''p'' |
| <!-- ws:start:WikiTextHeadingRule:0:&lt;h2&gt; --><h2 id="toc0"><a name="x-Log2 of the first primes"></a><!-- ws:end:WikiTextHeadingRule:0 -->Log2 of the first <a class="wiki_link" href="/prime%20numbers">primes</a></h2>
| | ! log<sub>2</sub>''p'' |
|
| | |- |
| | | 2 |
| | | 1.000000000 |
| | |- |
| | | 3 |
| | | 1.584962501 |
| | |- |
| | | 5 |
| | | 2.321928095 |
| | |- |
| | | 7 |
| | | 2.807354922 |
| | |- |
| | | 11 |
| | | 3.459431619 |
| | |- |
| | | 13 |
| | | 3.700439718 |
| | |- |
| | | 17 |
| | | 4.087462841 |
| | |- |
| | | 19 |
| | | 4.247927513 |
| | |- |
| | | 23 |
| | | 4.523561956 |
| | |- |
| | | 29 |
| | | 4.857980995 |
| | |} |
|
| |
|
| <table class="wiki_table">
| | [[Category:Elementary math]] |
| <tr>
| | [[Category:Terms]] |
| <th>prime<br />
| |
| </th>
| |
| <th>log2 prime<br />
| |
| </th>
| |
| </tr>
| |
| <tr>
| |
| <td>2<br />
| |
| </td>
| |
| <td>1<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>3<br />
| |
| </td>
| |
| <td>1.584962501<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>5<br />
| |
| </td>
| |
| <td>2.321928095<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>7<br />
| |
| </td>
| |
| <td>2.807354922<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>11<br />
| |
| </td>
| |
| <td>3.459431619<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>13<br />
| |
| </td>
| |
| <td>3.700439718<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>17<br />
| |
| </td>
| |
| <td>4.087462841<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>19<br />
| |
| </td>
| |
| <td>4.247927513<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>23<br />
| |
| </td>
| |
| <td>4.523561956<br />
| |
| </td>
| |
| </tr>
| |
| <tr>
| |
| <td>29<br />
| |
| </td>
| |
| <td>4.857980995<br />
| |
| </td>
| |
| </tr>
| |
| </table>
| |
| | |
| <br />
| |
| You can calculate the binary logarithm of n like this<br />
| |
| <br />
| |
| log2(n) = ln(n)/ln(2)</body></html></pre></div>
| |