Search results

Page title matches

• Integer Sequences
  #REDIRECT [[Integer sequence]]
  30 bytes (3 words) - 04:24, 25 May 2007
• Integer sequence
  ...esearch.att.com/~njas/sequences/Seis.html Sloane's On-Line Encyclopedia of Integer Sequences]]]
  254 bytes (32 words) - 19:58, 25 May 2007

Page text matches

• Integer Sequences
  #REDIRECT [[Integer sequence]]
  30 bytes (3 words) - 04:24, 25 May 2007
• Integer sequence
  ...esearch.att.com/~njas/sequences/Seis.html Sloane's On-Line Encyclopedia of Integer Sequences]]]
  254 bytes (32 words) - 19:58, 25 May 2007
• Grounded relation
  ...;… × ''X''_''k'' , for some positive integer ''k''.
  1 KB (177 words) - 02:20, 16 February 2008
• User:Jon Awbrey/SVG
  | width="15%" | '''Integer''' | width="15%" | '''Integer'''
  11 KB (1,648 words) - 16:15, 4 March 2010
• User:Jon Awbrey/SEQUENCES
  | <math>\text{Integer}\!</math> | <math>\text{Integer}\!</math>
  103 KB (10,321 words) - 18:48, 31 January 2010
• User:Jon Awbrey/GRAPHICS
  | width="15%" | '''Integer''' | width="15%" | '''Integer'''
  114 KB (10,904 words) - 18:52, 7 January 2011
• Directory:Jon Awbrey/Papers/Riffs and Rotes
  ...{p}_i\!</math> be the <math>i^\text{th}\!</math> prime, where the positive integer <math>i\!</math> is called the ''index'' of the prime <math>\text{p}_i\!</ The prime factorization of a positive integer <math>n\!</math> can be written in the following form:
  68 KB (11,043 words) - 22:00, 30 January 2016
• Directory:Derek Elder/Programs/CheckingAccount5
  tCode = Integer.parseInt(stringTCode); fileYea = Integer.parseInt(selection);
  27 KB (2,112 words) - 23:17, 2 November 2009
• Directory:Derek Elder/Programs/CheckingAccount4
  tCode = Integer.parseInt(stringTCode); fileYea = Integer.parseInt(selection);
  21 KB (1,675 words) - 00:12, 9 February 2009
• Directory:Derek Elder/Programs/CheckingAccount1
  tCode = Integer.parseInt(stringTCode);
  9 KB (619 words) - 00:23, 4 October 2008
• Boolean function
  .../math> is a [[boolean domain]] and where <math>k\!</math> is a nonnegative integer. In the case where <math>k = 0,\!</math> the function is simply a constant
  5 KB (589 words) - 20:24, 5 November 2015
• Truth table
  ...athbb{A}^k \to \mathbb{A},</math> where <math>k\!</math> is a non-negative integer and <math>\mathbb{A}</math> is the domain of logical values <math>\{ \opera ...athbb{B}^k \to \mathbb{B},</math> where <math>k\!</math> is a non-negative integer and <math>\mathbb{B}</math> is the [[boolean domain]] <math>\{ 0, 1 \}.\!</
  16 KB (2,190 words) - 03:25, 30 October 2015
• Directory:Derek Elder/Programs/CheckingAccount6
  tCode = Integer.parseInt(stringTCode); selection = Integer.parseInt(choice);
  33 KB (2,529 words) - 00:08, 9 February 2009
• Directory:Jon Awbrey
  [[Integer sequence]] [[Category:Integer Sequences]]
  15 KB (1,907 words) - 14:08, 9 October 2017
• User:Jon Awbrey
  [[Integer sequence]] [[Category:Integer Sequences]]
  16 KB (2,092 words) - 14:20, 14 January 2021
• Directory:Derek Elder/Programs/CheckingAccount2
  tCode = Integer.parseInt(stringTCode);
  16 KB (1,229 words) - 23:48, 14 October 2008
• Directory:Derek Elder/Programs/CheckingAccount3
  tCode = Integer.parseInt(stringTCode);
  17 KB (1,251 words) - 00:47, 11 December 2008
• Relation theory
  ...''<math>k\!</math>-place relation'', where <math>k\!</math> is a positive integer. ...>k\!</math>-adic'' and ''<math>k\!</math>-ary'', all of which leads to the integer <math>k\!</math> being called the ''dimension'', ''adicity'', or ''arity''
  25 KB (3,665 words) - 21:04, 16 November 2015
• Ordinal number
  ...em. Ordinals are an extension of the [[natural number]]s different from [[integer]]s and from cardinals.
  29 KB (4,819 words) - 16:23, 9 January 2007
• Coordinated Universal Time
  ...2-01-01T00:00:10 TAI exactly, making the difference between UTC and TAI an integer number of seconds. At the same time the tick rate of UTC was changed to ex
  20 KB (3,170 words) - 16:36, 6 December 2006
• Minimal negation operator
  ...<math>\lnot_j : \mathbb{B}^k \to \mathbb{B}~\!</math> be defined for each integer <math>j~\!</math> in the interval <math>[1, k]~\!</math> by the following e
  23 KB (3,337 words) - 13:54, 3 September 2017
• Directory:Jon Awbrey/Papers/Qualitative Analysis of Sequential Interaction Data
  The component x_6 is a non-negative integer code that records the elapsed time in seconds at which the episode ends. | x_6 is a non-negative integer giving the elapsed time in seconds
  183 KB (13,361 words) - 22:06, 9 December 2015
• User:Jon Awbrey/Exploratory Qualitative Analysis of Sequential Observation Data
  The component x_6 is a non-negative integer code that records the elapsed time in seconds at which the episode ends. | x_6 is a non-negative integer giving the elapsed time in seconds
  185 KB (13,539 words) - 17:08, 14 November 2020
• Directory:Jon Awbrey/Papers/Theme One Program : Exposition
  3. A 'code' of type numb, that is, an integer in [0, max integer].
  94 KB (8,938 words) - 22:12, 9 December 2015
• Boolean algebras canonically defined
  ...egers has among its ultrafilters the set of all subsets containing a given integer; there are countably many of these "standard" ultrafilters, which may be id
  46 KB (7,114 words) - 18:24, 2 October 2007
• Directory:Jon Awbrey/Papers/Futures Of Logical Graphs
  ...'' negation operator of order 1, and adding another such operator for each integer parameter greater than 1. In sum, these operators are symbolized by bracke Each of our proofs is a finite sequence of signs, and thus, for a finite integer n, takes the form:
  168 KB (21,027 words) - 12:41, 6 August 2017
• User:Jon Awbrey/Mathematical Notes
  | an integer d (the image of 1); this integer is the usual In summary, f gives the parity of an integer, 0 for Even, 1 for Odd,
  567 KB (86,909 words) - 21:00, 6 December 2016
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  Each of our proofs is a finite sequence of signs, and thus, for a finite integer <math>n,\!</math> takes the form:
  157 KB (17,761 words) - 03:44, 10 November 2016
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6
  ...x\!</math> is notated as <math>x^n\!</math> and defined for every positive integer <math>n\!</math> in the following manner. Proceeding recursively, let <mat : In a monoid, <math>x^n\!</math> is defined for every non-negative integer <math>n\!</math> by letting <math>x^0 = 1\!</math> and proceeding the same
  725 KB (109,715 words) - 18:09, 28 August 2014
• User:Badmachine/wikipedia-en-2012-08-12
  ...lous algorithm like "first initial + first 4 letters of last name + random integer" 19:28 < Apheori> Stupid integer.
  211 KB (30,290 words) - 00:10, 24 January 2015
• Directory:Jon Awbrey/Papers/Cactus Language
  | PC 4. || For each positive integer <math>k,\!</math>
  211 KB (31,551 words) - 20:44, 2 August 2017
• User:Badmachine/wikipedia-en-2011-11-22
  ...began the study of these numbers in the early 17th century), is a positive integer that is one less than a power of two: $M_p=2^p-1.\,$
  193 KB (25,713 words) - 04:47, 24 January 2015
• User:Badmachine/wikipedia-en-2012-08-05
  05:31 < wctaiwan> are you looking at "q must be an integer such that 1-emax <= q+p-1 <= emax (e.g., if p=7 and emax=96 then q is -101
  212 KB (29,779 words) - 00:03, 24 January 2015
• Directory:Logic Museum/Cicero on Divination Book I
  84 bytes (10 words) - 19:50, 19 October 2010
• User:Jon Awbrey/IDS
  PC 4. For each positive integer k,
  665 KB (109,541 words) - 02:46, 13 September 2010
• User:Badmachine/wikipedia-en-2012-07-12 through 2012-10-07
  ...lous algorithm like "first initial + first 4 letters of last name + random integer" [19:31] <Apheori> Stupid integer.
  1.63 MB (214,268 words) - 16:57, 8 February 2015
• User:Badmachine/wikipedia-en-2013-01-17 through 2013-03-08
  [00:48] <Dcoetzee> You can specify as a single 32 bit integer?
  1.71 MB (227,625 words) - 19:00, 8 February 2015