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

Page title matches

• Proper divisor
  ...divisor <math>1</math>, and all other positive integers have at least two proper divisors.
  436 bytes (63 words) - 16:27, 10 May 2021
• Proper fraction
  A '''proper fraction''' is a fraction such that the absolute value is less than 1.
  245 bytes (32 words) - 16:17, 26 March 2020

Page text matches

• Mu Alpha Theta
  #10 The set S is {#, !, @, *, $, %}. How many different proper subsets are possible?
  4 KB (632 words) - 17:09, 11 October 2020
• Improper fraction
  ...h> is an improper fraction. Fractions which are not improper are called [[proper fraction]]s.
  473 bytes (65 words) - 22:13, 17 September 2007
• Infinite
  * A set is infinite if it can be put into [[bijection]] with one of its proper [[subset]]s.
  1 KB (186 words) - 23:19, 16 August 2013
• Subset
  ...an <math>B</math> itself. In the latter case, <math>A</math> is called a ''proper subset''.
  1 KB (217 words) - 09:32, 13 August 2011
• Set
  ...et can be defined as a set that has the same [[cardinality]] as one of its proper subsets. Alternatively, infinite sets are those which cannot be put into [
  11 KB (2,021 words) - 00:00, 17 July 2011
• 2005 AIME I Problems
  How many positive integers have exactly three proper divisors (positive integral divisors excluding itself), each of which is le
  6 KB (983 words) - 05:06, 20 February 2019
• 2005 AIME I Problems/Problem 3
  How many [[positive integer]]s have exactly three [[proper divisor]]s (positive integral [[divisor]]s excluding itself), each of which ...n</math> is such an [[integer]]. Because <math>n</math> has <math>3</math> proper divisors, it must have <math>4</math> divisors,, so <math>n</math> must be
  2 KB (249 words) - 09:37, 23 January 2024
• 1986 AIME Problems
  ...math>S</math> be the sum of the base <math>10</math> logarithms of all the proper divisors of <math>1000000</math>. What is the integer nearest to <math>S</m
  5 KB (847 words) - 15:48, 21 August 2023
• 1987 AIME Problems
  ...than 1 will be called "nice" if it is equal to the product of its distinct proper divisors. What is the sum of the first ten nice numbers?
  6 KB (869 words) - 15:34, 22 August 2023
• 1998 AIME Problems
  ...s whose coordinates are no larger than 40. Find the length of the longest proper sequence of dominos that can be formed using the dominos of <math>D_{40}.</
  7 KB (1,084 words) - 02:01, 28 November 2023
• 1986 AIME Problems/Problem 8
  ...</math> be the sum of the base <math>10</math> [[logarithm]]s of all the [[proper divisor]]s (all [[divisor]]s of a number excluding itself) of <math>1000000 ...re <math>(6 + 1)(6 + 1) = 49</math> divisors, of which <math>48</math> are proper. The sum of multiple logarithms of the same base is equal to the logarithm
  3 KB (487 words) - 20:52, 16 September 2020
• 1987 AIME Problems/Problem 3
  ...an 1 will be called ''nice'' if it is equal to the product of its distinct proper divisors. What is the sum of the first ten nice numbers? Let <math>p(n)</math> denote the product of the distinct proper divisors of <math>n</math>. A number <math>n</math> is ''nice'' in one of t
  3 KB (511 words) - 09:29, 9 January 2023
• 1998 AIME Problems/Problem 15
  ...s whose coordinates are no larger than 40. Find the length of the longest proper sequence of dominos that can be formed using the dominos of <math>D_{40}.</ ...ected segment from one vertex of the <math>n</math> -gon to another, and a proper sequence is represented as a path that retraces no segment. Each time that
  9 KB (1,671 words) - 22:10, 15 March 2024
• Ring
  However, there is no multiplicative identity, so this is not a proper ring.
  6 KB (994 words) - 06:16, 8 April 2015
• Dedekind domain
  '''Lemma 2:''' For any proper integral ideal <math>J</math>, there is some <math>\gamma\in K\setminus R</ ...ath>R\not\subseteq (a)</math>, <math>n\ge 1</math>. As <math>J</math> is a proper ideal, it must be contained in some maximal ideal, <math>P</math>. Since ma
  9 KB (1,648 words) - 16:36, 14 October 2017
• Perfect number
  ...<math>n</math> is called a '''perfect number''' if it is the sum of its [[proper divisor]]s.
  1 KB (193 words) - 19:09, 3 March 2022
• Argument
  Unfortunately, this means that <math>\arg</math> is not a proper [[function]] but is instead a "multi-valued function": for example, any [[p
  1 KB (188 words) - 20:59, 31 July 2020
• Proper divisor
  ...divisor <math>1</math>, and all other positive integers have at least two proper divisors.
  436 bytes (63 words) - 16:27, 10 May 2021
• Proper fraction
  A '''proper fraction''' is a fraction such that the absolute value is less than 1.
  245 bytes (32 words) - 16:17, 26 March 2020
• 2007 iTest Problems
  An abundant number is a natural number that's proper divisors sum is greater than the number. Which one of the following natural
  30 KB (4,794 words) - 23:00, 8 May 2024

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