Nuprl Definition : is-qrep

is-qrep(p) ==  let a,b in eval better-gcd(a;b) in (g =z 1) ∨b(g =z -1)



Definitions occuring in Statement :  bor: p ∨bq better-gcd: better-gcd(a;b) callbyvalue: callbyvalue eq_int: (i =z j) spread: spread def minus: -n natural_number: $n
Definitions occuring in definition :  spread: spread def callbyvalue: callbyvalue better-gcd: better-gcd(a;b) bor: p ∨bq eq_int: (i =z j) minus: -n natural_number: $n
FDL editor aliases :  is-qrep

Latex:
is-qrep(p)  ==    let  a,b  =  p  in  eval  g  =  better-gcd(a;b)  in  (g  =\msubz{}  1)  \mvee{}\msubb{}(g  =\msubz{}  -1)



Date html generated: 2016_05_15-PM-10_40_02
Last ObjectModification: 2015_09_23-AM-08_27_01

Theory : rationals


Home Index