Create the page "Greatest" on this wiki! See also the search results found.

Page title matches

• Greatest common divisor
  The '''greatest common divisor''' ('''GCD''', or '''GCF''' ('''greatest common factor''')) of two or more [[integer]]s is the largest integer that The GCD is sometimes called the '''greatest common factor''' ('''GCF''').
  2 KB (288 words) - 21:40, 26 January 2021
• Greatest common factor
  #REDIRECT[[greatest common divisor]]
  36 bytes (4 words) - 21:15, 18 June 2006
• Greatest integer function
  28 bytes (3 words) - 11:28, 29 June 2006
• Greatest lower bound
  ...ath>S</math> in some larger [[partially ordered set]] <math>R</math>, a '''greatest lower bound''' or '''infimum''' for <math>S</math> is an [[element]] <math> If the greatest lower bound <math>m</math> of <math>S</math> is an element of <math>S</math
  597 bytes (109 words) - 12:55, 5 March 2022
• Greatest integer
  28 bytes (3 words) - 16:50, 24 November 2007
• What is the greatest number of points of intersection that can occur when $2$ different circles and $2$ different straight lines are drawn on the same piece of paper?
  What is the greatest number of points of intersection that can occur when <math>2</math> differe
  1 KB (188 words) - 16:11, 7 August 2020

Page text matches

• 2016 AMC 10A Problems/Problem 4
  ...h>where <math>\left \lfloor \tfrac{x}{y} \right \rfloor</math> denotes the greatest integer less than or equal to <math>\tfrac{x}{y}</math>. What is the value
  2 KB (257 words) - 09:57, 16 June 2023
• Relatively prime
  ...e no [[common divisor | common divisors]] greater than 1. That is, their [[greatest common divisor]] is <math>\gcd(m, n) = 1</math>. Equivalently, <math>m</ma * [[Greatest common divisor]]
  2 KB (245 words) - 17:45, 14 October 2024
• Algebra/Intermediate
  ** [[Greatest integer function]]
  2 KB (198 words) - 16:47, 3 November 2021
• Greatest common divisor
  The '''greatest common divisor''' ('''GCD''', or '''GCF''' ('''greatest common factor''')) of two or more [[integer]]s is the largest integer that The GCD is sometimes called the '''greatest common factor''' ('''GCF''').
  2 KB (288 words) - 21:40, 26 January 2021
• Greatest common factor
  #REDIRECT[[greatest common divisor]]
  36 bytes (4 words) - 21:15, 18 June 2006
• Euclidean algorithm
  ...algorithm''' or '''Euclid's algorithm''') is an algorithm that finds the [[greatest common divisor]] (GCD) of two elements of a [[Euclidean domain]], the most ...> and <math>r</math>, it should divide <math>{a}</math> as well. Thus, the greatest common divisors of <math>{a}</math> and <math>b</math> and of <math>b</math
  6 KB (923 words) - 16:39, 30 September 2024
• GCD
  #REDIRECT [[Greatest common divisor]]
  37 bytes (4 words) - 21:48, 19 June 2006
• GCF
  #REDIRECT[[greatest common divisor]]
  36 bytes (4 words) - 22:29, 19 June 2006
• Least common multiple
  The LCM of two numbers can be found more easily by first finding their [[greatest common divisor]] (GCD). Once the GCD is known, the LCM is calculated by the
  2 KB (383 words) - 09:49, 4 September 2022
• Pi
  ...of the most beautiful results in mathematics since it involves five of the greatest [[constant]]s: [[e]], pi, [[i]], [[unity | 1]], and [[zero (constant)| 0]].
  8 KB (1,469 words) - 20:11, 16 September 2022
• Law of Cosines
  ...\rfloor. </math> (The notation <math> \lfloor x\rfloor </math> denotes the greatest integer that is less than or equal to <math> x. </math>)
  6 KB (1,003 words) - 23:02, 19 May 2024
• Common divisor
  ...ll those integers. For any [[set]] of [[positive integer]]s, there is a [[greatest common divisor]]. * Find the greatest common divisor of 12, 99, and 111.
  553 bytes (76 words) - 19:01, 17 March 2023
• Law of Sines
  ...[[divisibility | divisible]] by the [[square]] of any [[prime]]. Find the greatest [[integer]] less than or equal to <math>m + \sqrt{n}</math>.
  4 KB (658 words) - 15:19, 28 April 2024
• Diophantine equation
  ...l integers <math>k</math>. If they are not, we simply divide them by their greatest common divisor.
  9 KB (1,434 words) - 00:15, 4 July 2024
• Floor function
  ...eatest integer function, also known as the '''floor function''', gives the greatest integer less than or equal to its argument. The floor of <math>x</math> is ...+\left[\frac{n}{10!}\right]=1999</math>. Here <math>[x]</math> denotes the greatest integer less than or equal to <math>x</math>.
  3 KB (508 words) - 20:05, 26 February 2024
• Mathematicial notation
  ...</math> or <math>(m,n)</math> is their '''greatest common divisor''', the greatest <math>d \in \mathbb{Z}</math> with <math>d|m</math> and <math>d|n</math> (<
  8 KB (1,401 words) - 12:11, 17 June 2008
• Limit
  ...ot exist at that point. For example, if we consider the step function (the greatest integer function) <math>f(x) = \lfloor x \rfloor</math>, we have <math>\lim
  7 KB (1,327 words) - 17:39, 28 September 2024
• 2006 AIME I Problems
  ...here <math> a, b, </math> and <math> c </math> are positive integers whose greatest common divisor is 1. Find <math> a^2+b^2+c^2. </math> ...ath> n, </math> let <math> S_n=\sum_{k=1}^{2^{n-1}}g(2k). </math> Find the greatest integer <math> n </math> less than 1000 such that <math> S_n </math> is a p
  7 KB (1,173 words) - 02:31, 4 January 2023
• 2006 AIME I Problems/Problem 14
  ...\rfloor. </math> (The notation <math> \lfloor x\rfloor </math> denotes the greatest integer that is less than or equal to <math> x. </math>)
  6 KB (980 words) - 20:45, 31 March 2020
• 2006 AIME I Problems/Problem 13
  ...ath> n, </math> let <math> S_n=\sum_{k=1}^{2^{n-1}}g(2k). </math> Find the greatest integer <math> n </math> less than 1000 such that <math> S_n </math> is a [ ...th>1000</math> such that <math>(n+1)</math> is an even perfect square. The greatest even square less than <math>1000</math> is <math>30^2=900</math> so <math>n
  10 KB (1,702 words) - 21:23, 25 July 2024

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)