Talk:Power of two

message: Because data (specifically integers) and the addresses of data are stored using the same hardware, and the data is stored in one or more octets (), double exponentials of two are common. The first 24 of them are:
  	         	
0 	1        	2
1 	2        	4
2 	4        	16
3 	8        	256
4 	16       	65,536
5 	32       	4,294,967,296
6 	64       	(20 digits)
7 	128      	(39 digits)
8 	256      	(78 digits)
9 	512      	(155 digits)
10	1,024    	(309 digits)
11	2,048    	(617 digits)
12	4,096    	(1,234 digits)
13	8,192    	(2,467 digits)
14	16,384   	(4,933 digits)
15	32,768   	(9,865 digits)
16	65,536   	(19,729 digits)
17	131,072  	(39,457 digits)
18	262,144  	(78,914 digits)
19	524,288  	(157,827 digits)
20	1,048,576	(315,653 digits)
21	2,097,152	(631,306 digits)
22	4,194,304	(1,262,612 digits)
23	8,388,608	(2,525,223 digits)
Also see tetration and lower hyperoperations.
=== Last digits for powers of two whose exponents are powers of two ===
All of these numbers end in 6. Starting with 16 the last two digits are periodic with period 4, with the cycle 16–56–36–96–, and starting with 16 the last three digits are periodic with period 20. These patterns are generally true of any power, with respect to any base. The pattern continues where each pattern has starting point , and the period is the multiplicative order of 2 modulo , which is  (see Multiplicative group of integers modulo n).
=== Facts about powers of two whose exponents are powers of two ===
In a connection with nimbers, these numbers are often called Fermat 2-powers.
The numbers 2^{2^n} form an irrationality sequence: for every sequence x_i of positive integers, the series
:\sum_{i=0}^{\infty} \frac{1}{2^{2^i} x_i}  = \frac{1}{2x_0}+\frac{1}{4x_1}+\frac{1}{16x_2}+\cdots
converges to an irrational number. Despite the rapid growth of this sequence, it is the slowest-growing irrationality sequence known.
=== Powers of two whose exponents are powers of two in computer science ===
Several of these numbers represent the number of values representable using common computer data types. For example, a 32-bit word consisting of 4 bytes can represent  distinct values, which can either be regarded as mere bit-patterns, or are more commonly interpreted as the unsigned numbers from 0 to , or as the range of signed numbers between  and . For more about representing signed numbers see two's complement. Faster328 (talk) 07:09, 13 April 2023 (UTC)
replies: text: I improved the table, seperated sections, and added colour. Faster328 (talk) 07:12, 13 April 2023 (UTC)
replies: text: Trim the table. Numbers-Mathworld (talk) 07:17, 13 April 2023 (UTC)
replies: text: You can use multiply and calculator, not use table and have infinite integer.
124.122.238.117 (talk)  — Preceding undated comment added 13:54, 12 September 2023 (UTC)
thread_title:  Powers of two whose exponents are powers of two 

message: Several of these numbers represent the number of values representable using common computer data types. For example, a 32-bit word consisting of 4 bytes can represent  distinct values, which can either be regarded as mere bit-patterns, or are more commonly interpreted as the unsigned numbers from 0 to , or as the range of signed numbers between  and . For more about representing signed numbers see two's complement. Faster328 (talk) 07:09, 13 April 2023 (UTC)
replies: text: I improved the table, seperated sections, and added colour. Faster328 (talk) 07:12, 13 April 2023 (UTC)
replies: text: Trim the table. Numbers-Mathworld (talk) 07:17, 13 April 2023 (UTC)
replies: text: You can use multiply and calculator, not use table and have infinite integer.
124.122.238.117 (talk)  — Preceding undated comment added 13:54, 12 September 2023 (UTC)
thread_title:  Powers of two whose exponents are powers of two in computer science 

message: User:Faster328 has been repeatedly reverting David Eppstein's legitimate contribs on this article. Can you please ban the user for repeated sockpuppetry and nuke all the sockpuppets' contributions on this article and protect this article under extended confirmed protection? 2401:7400:4014:820D:1778:F79D:2719:75B1 (talk) 05:24, 9 August 2023 (UTC)
replies: text: Go to WP:ANI or WP:AN and ban this user. 2401:7400:4014:820D:1778:F79D:2719:75B1 (talk) 05:29, 9 August 2023 (UTC)

text: Uhhh, Faster328 was blocked about 4 months ago. DMacks (talk) 05:56, 9 August 2023 (UTC)
thread_title:  [[User:Faster328]] 

message: The section #Powers of 1024 has the following:
: It takes approximately 17 powers of 1024 to reach 50% deviation and approximately 29 powers of 1024 to reach 100% deviation of the same powers of 1000.
Does this really need a citation? The calculation is very easily done:
: \log_{1024/1000} 1.5 \approx 17.1 
: \log_{1024/1000} 2 \approx 29.2 
Kuulopuhe (talk) 01:24, 17 December 2023 (UTC)
replies: text: I added this calculation in a footnote and took out the cn template. –jacobolus (t) 01:40, 17 December 2023 (UTC)
replies: text: Thank you! Kuulopuhe (talk) 00:43, 18 December 2023 (UTC)
thread_title:  Powers of 1024 

message: I recently added a note to 2^1024 that it was the range of possible states in one kibibit (kilobit), as well as a similar note for 2^8192 and one kibibyte (kilobyte). Those edits were reverted by user:David Eppstein with the following edit summary:
“gibidigibidigibidi. Nobody uses fixed-precision arithmetic with this many bits, and if they did the max value would be half what you state it is, minus one”
My edit was not talking about the max value, it said “range of possible values”. Even if it were to be misunderstood as talking about max value, there is no reason to assume that it is referring to a signed integer. I assert that it is in fact correct that one kibibit can have 2^1024 possible unique values, and one kibibyte can have 2^8192.
Regarding the comment that “Nobody uses fixed-precision arithmetic with this many bits”, it is certainly true that there are more efficient ways to store numbers. However, needless to say numbers aren't the only type of data that can be represented with binary data. Having a sense of scale for how many different states are possible at a common data size is useful.
As for the “gibidigibidigibidi”, this seems to be referring to the user's dislike of the aesthetics of the standard names for binary prefixes, which is not relevant. Pinball larry (talk) 22:32, 2 March 2024 (UTC)
replies: text: The range of possible values is an interval, not a number. Perhaps you mean "the number of distinct values"? Also, I dispute that "these are the standard names". A standards body has declared them to be the names, but very few others actually use them. —David Eppstein (talk) 22:56, 2 March 2024 (UTC)
thread_title:  Number of unique states in one unit of data 

message: Is there anything in sources about negative exponents, it numbers 1/2, 1/4, 1/8...? Or shal the lede speak about nonnegative integer exponents? Is there a ref for the def? (I mean, to establish that usually nonnegative exp is meant (that is my impression, but  for either way :-). - Altenmann >talk 20:41, 29 March 2024 (UTC)
replies: text: Sure, there are plenty of sources using the phrase "negative power of two". I think it would be fine to add a section about this if you feel motivated. You could start by looking at binary logarithm.  –jacobolus (t) 21:34, 29 March 2024 (UTC)
replies: text: If I said simply that a number is a power of two, I think I would likely mean a non-negative exponent unless otherwise qualified. If I meant a negative-integer power I would probably say something like "inverse power of two" or "negative power of two". I definitely would not count 2^{\log_2 3} as a power of two. But as you say, adding clarifications about this requires sourcing. —David Eppstein (talk) 21:44, 29 March 2024 (UTC)
replies: text: Sure, the numbers 1, 2, 4, 8, ... are clearly the primary focus of this article. But if we wanted to add a section called "Negative powers of two" about 1/2, 1/4, 1/8, ..., and briefly mention it in the lead section, I think it would be plausibly in scope, not particularly distracting, and potentially helpful to readers. I certainly agree with you that the number 3 doesn't seem like a "power of two". –jacobolus (t) 22:13, 29 March 2024 (UTC)

text:  -- fooled by google. Only a handgful unique hits. Anyway, I found one nontrivial.- Altenmann >talk 21:50, 29 March 2024 (UTC)
replies: text: P.S. thre is also something to write about computer representations, like  exact representation of decimal fractions such as 1/625, but I dont "feel motivated" enough (Must be bad weather :-). - Altenmann >talk 22:02, 29 March 2024 (UTC)

text: I did a search in google scholar, which found nearly 400 examples of "negative power of two". –jacobolus (t) 22:10, 29 March 2024 (UTC)
replies: text: The part about exact computer representation really belongs under related article dyadic rational, where it is already mentioned in section "In computing". —David Eppstein (talk) 23:47, 29 March 2024 (UTC)
replies: text: The current section  is poorly placed/organized in my opinion, and should not be an independent section. I think this article should (near the bottom) have short sections about (a) negative powers of two; (b) fractional powers of two (possibly linking to binary logarithm), which can talk about ISO 216 paper sizes, f-numbers, equally tempered semitones, etc.; (c) dyadic rationals, including music time signatures. These sections can each briefly explain their relationship to powers of two. –jacobolus (t) 03:21, 30 March 2024 (UTC)
thread_title:  Negative integer exponents