Search results
Create the page "Size" on this wiki! See also the search results found.
- size(6cm);2 KB (337 words) - 14:56, 25 June 2023
- size(6cm); size(6cm);8 KB (1,016 words) - 00:17, 31 December 2023
- ...w states don't need to host chapter competitions due to a small population size.10 KB (1,497 words) - 11:42, 10 March 2024
- Due to the size and population of the state of [[California]], '''California MathCounts'''644 bytes (87 words) - 02:05, 25 March 2015
- Consider the <math>n</math> intervals from <math>[0, 1)</math> of size <math>\frac{1}{n}</math>. We have <math>n+1</math> total <math>b_0, b_1, \l11 KB (1,985 words) - 21:03, 5 August 2023
- size(150);2 KB (282 words) - 22:04, 11 July 2008
- ...the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible [[intersection]]s among the sets. ...ze of their intersection, <math>|A_1\cap A_2|</math>. We wish to find the size of their union, <math>|A_1\cup A_2|</math>.9 KB (1,703 words) - 07:25, 24 March 2024
- ...the number of combinations of size <math>r</math> from an original set of size <math>n</math>4 KB (615 words) - 11:43, 21 May 2021
- ...al proof, this splits the non-main diagonal unit hypercubes into groups of size <math>p</math>, from which it follows that <math>a^p \equiv a \pmod{p}</mat ...a single orbit which we can denote as <math>\mathcal{O}</math> (since the size of the orbit is a factor of <math>p</math>). Hence, if <math>g\ne e</math>16 KB (2,658 words) - 16:02, 8 May 2024
- size(300); size(300);3 KB (551 words) - 16:22, 13 September 2023
- size(400);7 KB (1,296 words) - 14:22, 22 October 2023
- ...l outcomes and the number of total outcomes. Instead, we have to find the size of each set. This is where we turn to '''geometric probability'''. We can1 KB (175 words) - 23:50, 18 November 2023
- ...math> is the number of ways to choose <math>m</math> objects from a set of size <math>n</math>, or <math>\binom{n}{m}</math>. Extending this to all possib5 KB (935 words) - 13:11, 20 February 2024
- ...ly used in [[combinatorics]] in order to count the elements of a set whose size is unknown. Bijections are also very important in [[set theory]] when deal2 KB (289 words) - 17:17, 13 February 2009
- ...ly used in [[combinatorics]] in order to count the elements of a set whose size is unknown. Bijections are also very important in [[set theory]] when deal1,016 bytes (141 words) - 03:39, 29 November 2021
- We can form a committee of size <math>k+1</math> from a group of <math>n+1</math> people in <math>{{n+1}\ch12 KB (1,993 words) - 23:49, 19 April 2024
- ...gned <math>32</math>-bit integers). Integers in Python can be of arbitrary size, theoretically limited only by computer memory.2 KB (296 words) - 15:04, 5 August 2022
- size(200); size(200);5 KB (892 words) - 21:52, 1 May 2021
- ...ts, the cardinality of is the number of [[element]]s in that set, i.e. the size of the set. The cardinality of <math>\{3, 4\}</math> is 2, the cardinality For [[infinite]] sets, cardinality also measures (in some sense) the "size" of the set, but an explicit formulation is more complicated: the cardinali2 KB (263 words) - 00:54, 17 November 2019
- size(150);7 KB (1,265 words) - 13:22, 14 July 2021
- size(100);6 KB (1,003 words) - 09:11, 7 June 2023
- # Despite this, the set of rational numbers is [[countable]], i.e. the same size as the set of integers.1 KB (207 words) - 15:51, 25 August 2022
- size(300);3 KB (575 words) - 15:27, 19 March 2023
- ...to the size of the region that a two-[[dimension]]al figure occupies. The size of a region in higher dimensions is referred to as [[volume]].6 KB (1,181 words) - 22:37, 22 January 2023
- <asy>size(250);5 KB (912 words) - 20:06, 14 March 2023
- ...r </math>, no two of which are disjoint. Prove that there exists a set of size <math> \displaystyle r-1 </math> that meets each set in <math> \displaystyl ...ll stop before <math> \displaystyle |A| = r </math>, for clearly no set of size <math> \displaystyle r </math> can be a subset of every set of <math> \disp4 KB (681 words) - 20:10, 19 April 2007
- size(200);782 bytes (108 words) - 13:36, 6 March 2022
- size(6cm); size(8cm);7 KB (1,173 words) - 03:31, 4 January 2023
- size(200); size(200);6 KB (980 words) - 21:45, 31 March 2020
- the parentheses don't come out the right size: ==Multi-Size Symbols==16 KB (2,324 words) - 16:50, 19 February 2024
- ...ze <math>m</math>. Thus, there are 3 times as many towers using blocks of size <math>1, 2, \ldots, m, m + 1</math> as there are towers using only <math>1, ...th>: when <math>m = 1</math>, there are only 2 places to insert a block of size <math>m + 1 = 2</math>, at the beginning or at the end, rather than the 3 p3 KB (436 words) - 05:40, 4 November 2022
- size(150);defaultpen(linewidth(0.7)); size(150);defaultpen(linewidth(0.7));4 KB (731 words) - 17:59, 4 January 2022
- size(8cm); size(8cm);5 KB (730 words) - 15:05, 15 January 2024
- size(5cm);13 KB (2,058 words) - 12:36, 4 July 2023
- <asy>size(7cm); pointpen = black; pathpen = linewidth(0.7); size(150);15 KB (2,223 words) - 13:43, 28 December 2020
- size(150); size(100);13 KB (1,953 words) - 00:31, 26 January 2023
- ...an eight-ounce cup and four ounces of cream into a second cup of the same size. She then pours half the coffee from the first cup to the second and, after size(200);12 KB (1,792 words) - 13:06, 19 February 2020
- size(200); size(200);13 KB (1,987 words) - 18:53, 10 December 2022
- size(120);13 KB (2,049 words) - 13:03, 19 February 2020
- ...>8</math>-foot by <math>10</math>-foot floor is tiled with square tiles of size <math>1</math> foot by <math>1</math> foot. Each tile has a pattern consis12 KB (1,781 words) - 12:38, 14 July 2022
- If the second size has length x, then the first side has length 3x, and we have the third side977 bytes (156 words) - 13:57, 19 January 2021
- size(7cm);2 KB (339 words) - 13:15, 12 July 2015
- size(5cm); size(5cm);7 KB (1,169 words) - 14:04, 10 June 2022
- size(5cm); size(5cm);3 KB (563 words) - 22:45, 24 October 2021
- size(50);5 KB (908 words) - 19:23, 22 September 2022
- ...condition. No elements less than <math>s</math> can be put in a subset of size <math>s</math>, therefore the "lowest" element that can go into the subset8 KB (1,405 words) - 11:52, 27 September 2022
- ...y solutions as possible, until it becomes intuitive that there are no more size of triangles left. size(200);4 KB (498 words) - 00:46, 4 August 2023
- ...-foot by <math>10</math>-foot bathroom floor is tiled with square tiles of size <math>1</math> foot by <math>1</math> foot. Each tile has a pattern consis2 KB (223 words) - 14:30, 15 December 2021
- size(30);10 KB (1,840 words) - 21:35, 7 September 2023
- size(150); pathpen = linewidth(0.6); defaultpen(fontsize(10)); size(7cm); pathpen = linewidth(0.7);13 KB (2,028 words) - 16:32, 22 March 2022
- size(150); pathpen = linewidth(0.6); defaultpen(fontsize(10)); size(150); pathpen = linewidth(0.7); defaultpen(linewidth(0.7)+fontsize(10));3 KB (424 words) - 10:14, 17 December 2021
- size(7cm); pathpen = linewidth(0.7);2 KB (292 words) - 11:56, 17 December 2021
- size(200); pathpen = linewidth(0.7); pointpen = black; size(200); pathpen = linewidth(0.7); pointpen = black; pointfontpen = fontsize(15 KB (732 words) - 23:19, 19 September 2023
- size(7cm); pathpen = linewidth(0.7); pointpen = black; pointfontpen = fontsize(1 size(7cm); pathpen = linewidth(0.7); pointpen = black; pointfontpen = fontsize(16 KB (1,066 words) - 00:21, 2 February 2023
- size(400);2 KB (292 words) - 10:19, 19 December 2021
- ...[[finite]] set of size <math>n</math> then <math>\mathcal{P}(A)</math> has size <math>2^n</math>. ...y]] of a set <math>A</math>, denoted <math>|A|</math>, is (informally) the size of the set. For a finite set, the cardinality is simply the number of elem11 KB (2,021 words) - 00:00, 17 July 2011
- size(200);6 KB (1,034 words) - 07:55, 12 August 2019
- ...ive integers that has sum greater than <math>N </math> but every subset of size <math>k</math> has sum at most <math>N/2</math>.3 KB (520 words) - 09:24, 14 May 2021
- ...ath>3</math> cm is cut into <math>N</math> smaller cubes, not all the same size. If the edge of each of the smaller cubes is a whole number of centimeters17 KB (2,246 words) - 13:37, 19 February 2020
- size(200);4 KB (693 words) - 13:03, 28 December 2021
- size(200); size(200);13 KB (2,080 words) - 21:20, 11 December 2022
- size(170);5 KB (852 words) - 21:23, 4 October 2023
- ...ce it is tangent to two adjacent sides of the square, we will maximize its size when it touches both other sides of the square. This can happen only when4 KB (707 words) - 11:11, 16 September 2021
- defaultpen(fontsize(8)+0.8+heavyblue); size(250);5 KB (897 words) - 00:21, 29 July 2022
- size(300); pointpen=black;pathpen=black+linewidth(0.65); pen s = fontsize(10);5 KB (906 words) - 23:15, 6 January 2024
- size(220); pointpen = black; pen d = linewidth(0.7); pathpen = d; size(220);12 KB (2,000 words) - 13:17, 28 December 2020
- import olympiad; import cse5; import geometry; size(150); import olympiad; import cse5; import geometry; size(300);13 KB (2,129 words) - 18:56, 1 January 2024
- currentprojection = perspective(-2,-50,15); size(200);4 KB (729 words) - 01:00, 27 November 2022
- size(100); size(100);3 KB (532 words) - 09:22, 11 July 2023
- ...,4,-5,6,-7,8,-9,10,-11,12,-13,14,-15]</math>. Denote by <math>S</math> all size 2 subsets of this set. Replace each element of <math>S</math> by the produc5 KB (833 words) - 19:43, 1 October 2023
- size(200);9 KB (1,501 words) - 05:34, 30 October 2023
- size(200);9 KB (1,410 words) - 05:05, 20 February 2019
- size(150); size(170);7 KB (1,104 words) - 12:53, 6 July 2022
- size(200);6 KB (933 words) - 01:15, 19 June 2022
- size(250);real x=sqrt(3); size(250);8 KB (1,374 words) - 21:09, 27 July 2023
- size(150); size(150); defaultpen(linewidth(0.6)+fontsize(11));11 KB (1,741 words) - 22:40, 23 November 2023
- size(180); size(180);5 KB (865 words) - 21:11, 6 February 2023
- <asy>size(160); defaultpen(linewidth(.8pt)+fontsize(11pt)); dotfactor=3; pair O1=(0,0 size(0,5cm);13 KB (2,149 words) - 18:44, 5 February 2024
- <asy>size(100); size(170);19 KB (3,221 words) - 01:05, 7 February 2023
- size(200);4 KB (726 words) - 13:39, 13 August 2023
- size(200);5 KB (932 words) - 17:00, 1 September 2020
- size(200); size(200);5 KB (763 words) - 16:20, 28 September 2019
- size(170); size(150);11 KB (1,722 words) - 09:49, 13 September 2023
- size(200); size(200);11 KB (1,850 words) - 18:07, 11 October 2023
- size(200); size(200);5 KB (838 words) - 18:05, 19 February 2022
- size(170); size(170);13 KB (2,091 words) - 00:20, 26 October 2023
- defaultpen(fontsize(10)+0.8); size(175);2 KB (376 words) - 13:49, 1 August 2022
- size(170); size(170);8 KB (1,401 words) - 21:41, 20 January 2024
- size(20cm); size(10cm);8 KB (1,146 words) - 04:15, 20 November 2023
- size(300); draw((0,0)--(100,0)--(80,139)--cycle);5 KB (864 words) - 19:55, 2 July 2023
- size(280);7 KB (1,086 words) - 08:16, 29 July 2023
- size(90); defaultpen(linewidth(0.7));1 KB (181 words) - 13:45, 26 January 2022
- defaultpen(linewidth(0.8)); size(100);1 KB (176 words) - 13:49, 26 January 2022
- <asy> defaultpen(linewidth(0.7)+fontsize(10)); size(120);3 KB (445 words) - 22:01, 20 August 2022
- real r = 0.35; size(220);4 KB (595 words) - 12:51, 17 June 2021
- ...ve n people and you want to know how many ways you can make a group of any size you could do this <math>2</math> ways. You could count everyone is binary i2 KB (336 words) - 05:18, 4 November 2022
- <asy>size(200);defaultpen(linewidth(0.8));4 KB (558 words) - 14:38, 6 April 2024
- size(8cm); defaultpen(linewidth(0.7)); size(8cm); defaultpen(linewidth(0.7));8 KB (1,231 words) - 20:06, 26 November 2023
- pathpen = linewidth(1); size(250); pen dots = linetype("2 3") + linewidth(0.7), dashes = linetype("8 6")4 KB (717 words) - 22:20, 3 June 2021
- pathpen = linewidth(0.7); size(250);2 KB (303 words) - 00:03, 28 December 2017