1*b1cdbd2cSJim Jagielski<?xml version="1.0" encoding="UTF-8"?> 2*b1cdbd2cSJim Jagielski<helpdocument version="1.0"> 3*b1cdbd2cSJim Jagielski 4*b1cdbd2cSJim Jagielski<!--*********************************************************** 5*b1cdbd2cSJim Jagielski * 6*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one 7*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file 8*b1cdbd2cSJim Jagielski * distributed with this work for additional information 9*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file 10*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the 11*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance 12*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at 13*b1cdbd2cSJim Jagielski * 14*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0 15*b1cdbd2cSJim Jagielski * 16*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing, 17*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an 18*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 19*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the 20*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations 21*b1cdbd2cSJim Jagielski * under the License. 22*b1cdbd2cSJim Jagielski * 23*b1cdbd2cSJim Jagielski ***********************************************************--> 24*b1cdbd2cSJim Jagielski 25*b1cdbd2cSJim Jagielski 26*b1cdbd2cSJim Jagielski 27*b1cdbd2cSJim Jagielski 28*b1cdbd2cSJim Jagielski<meta> 29*b1cdbd2cSJim Jagielski<topic id="textscalc0104060115xml" indexer="include"> 30*b1cdbd2cSJim Jagielski<title id="tit" xml-lang="en-US">Add-in Functions, List of Analysis Functions Part One</title> 31*b1cdbd2cSJim Jagielski<filename>/text/scalc/01/04060115.xhp</filename> 32*b1cdbd2cSJim Jagielski</topic> 33*b1cdbd2cSJim Jagielski</meta> 34*b1cdbd2cSJim Jagielski<body> 35*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3152871"><bookmark_value>add-ins; analysis functions</bookmark_value> 36*b1cdbd2cSJim Jagielski<bookmark_value>analysis functions</bookmark_value> 37*b1cdbd2cSJim Jagielski</bookmark> 38*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3152871" xml-lang="en-US" level="1" l10n="U" oldref="1">Add-in Functions, List of Analysis Functions Part One</paragraph> 39*b1cdbd2cSJim Jagielski<section id="howtoget"> 40*b1cdbd2cSJim Jagielski<embed href="text/scalc/00/00000404.xhp#addinana"/> 41*b1cdbd2cSJim Jagielski</section> 42*b1cdbd2cSJim Jagielski<section id="relatedtopics"> 43*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149873" xml-lang="en-US" l10n="U" oldref="102"><link href="text/scalc/01/04060110.xhp" name="General conversion function BASIS">General conversion function BASIS</link></paragraph> 44*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3145324" xml-lang="en-US" l10n="U" oldref="5"><link href="text/scalc/01/04060116.xhp" name="Analysis functions Part Two">Analysis functions Part Two</link></paragraph> 45*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3155751" xml-lang="en-US" l10n="U" oldref="156"><link href="text/scalc/01/04060111.xhp" name="Back to the Overview">Back to the Overview</link></paragraph> 46*b1cdbd2cSJim Jagielski</section> 47*b1cdbd2cSJim Jagielski<sort> 48*b1cdbd2cSJim Jagielski<section id="besseli"> 49*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3153074"><bookmark_value>Bessel functions</bookmark_value> 50*b1cdbd2cSJim Jagielski</bookmark> 51*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BESSELI" id="bm_id3150435" localize="false"/> 52*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153334" xml-lang="en-US" level="2" oldref="111">BESSELI</paragraph> 53*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153960" xml-lang="en-US" l10n="U" oldref="112"><ahelp hid="HID_AAI_FUNC_BESSELI">Calculates the modified Bessel function.</ahelp></paragraph> 54*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150392" xml-lang="en-US" level="3" l10n="U" oldref="113">Syntax</paragraph> 55*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3147295" xml-lang="en-US" l10n="U" oldref="114">BESSELI(X; N)</paragraph> 56*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3151338" xml-lang="en-US" l10n="U" oldref="115"> 57*b1cdbd2cSJim Jagielski<emph>X</emph> is the value on which the function will be calculated.</paragraph> 58*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3151392" xml-lang="en-US" l10n="U" oldref="116"> 59*b1cdbd2cSJim Jagielski<emph>N</emph> is the order of the Bessel function</paragraph> 60*b1cdbd2cSJim Jagielski</section> 61*b1cdbd2cSJim Jagielski<section id="besselj"> 62*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BESSELJ" id="bm_id3150539" localize="false"/> 63*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153027" xml-lang="en-US" level="2" oldref="103">BESSELJ</paragraph> 64*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153015" xml-lang="en-US" l10n="U" oldref="104"><ahelp hid="HID_AAI_FUNC_BESSELJ">Calculates the Bessel function (cylinder function).</ahelp></paragraph> 65*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3146884" xml-lang="en-US" level="3" l10n="U" oldref="105">Syntax</paragraph> 66*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3150032" xml-lang="en-US" l10n="U" oldref="106">BESSELJ(X; N)</paragraph> 67*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150378" xml-lang="en-US" l10n="U" oldref="107"> 68*b1cdbd2cSJim Jagielski<emph>X</emph> is the value on which the function will be calculated.</paragraph> 69*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3145638" xml-lang="en-US" l10n="U" oldref="108"> 70*b1cdbd2cSJim Jagielski<emph>N</emph> is the order of the Bessel function</paragraph> 71*b1cdbd2cSJim Jagielski</section> 72*b1cdbd2cSJim Jagielski<section id="besselk"> 73*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BESSELK" id="bm_id3147616" localize="false"/> 74*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3149946" xml-lang="en-US" level="2" oldref="117">BESSELK</paragraph> 75*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3159122" xml-lang="en-US" l10n="U" oldref="118"><ahelp hid="HID_AAI_FUNC_BESSELK">Calculates the modified Bessel function.</ahelp></paragraph> 76*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150650" xml-lang="en-US" level="3" l10n="U" oldref="119">Syntax</paragraph> 77*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3149354" xml-lang="en-US" l10n="U" oldref="120">BESSELK(X; N)</paragraph> 78*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150481" xml-lang="en-US" l10n="U" oldref="121"> 79*b1cdbd2cSJim Jagielski<emph>X</emph> is the value on which the function will be calculated.</paragraph> 80*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150024" xml-lang="en-US" l10n="U" oldref="122"> 81*b1cdbd2cSJim Jagielski<emph>N</emph> is the order of the Bessel function</paragraph> 82*b1cdbd2cSJim Jagielski</section> 83*b1cdbd2cSJim Jagielski<section id="bessely"> 84*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BESSELY" id="bm_id3150461" localize="false"/> 85*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3145828" xml-lang="en-US" level="2" oldref="123">BESSELY</paragraph> 86*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3146877" xml-lang="en-US" l10n="CHG" oldref="124"><ahelp hid="HID_AAI_FUNC_BESSELY">Calculates the modified Bessel function.</ahelp></paragraph> 87*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3146941" xml-lang="en-US" level="3" l10n="U" oldref="125">Syntax</paragraph> 88*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3148884" xml-lang="en-US" l10n="U" oldref="126">BESSELY(X; N)</paragraph> 89*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3147475" xml-lang="en-US" l10n="U" oldref="127"> 90*b1cdbd2cSJim Jagielski<emph>X</emph> is the value on which the function will be calculated.</paragraph> 91*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3147421" xml-lang="en-US" l10n="U" oldref="128"> 92*b1cdbd2cSJim Jagielski<emph>N</emph> is the order of the Bessel function</paragraph> 93*b1cdbd2cSJim Jagielski</section> 94*b1cdbd2cSJim Jagielski<section id="bin2dec"> 95*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3153034"><bookmark_value>BIN2DEC function</bookmark_value> 96*b1cdbd2cSJim Jagielski<bookmark_value>converting;binary numbers, into decimal numbers</bookmark_value> 97*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 98*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BIN2DEC" id="bm_id3151230" localize="false"/> 99*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153034" xml-lang="en-US" level="2" oldref="17">BIN2DEC</paragraph> 100*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3144744" xml-lang="en-US" l10n="U" oldref="18"><ahelp hid="HID_AAI_FUNC_BIN2DEC">The result is the decimal number for the binary number entered.</ahelp></paragraph> 101*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3145593" xml-lang="en-US" level="3" l10n="U" oldref="19">Syntax</paragraph> 102*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3149726" xml-lang="en-US" l10n="U" oldref="20">BIN2DEC(Number)</paragraph> 103*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150142" xml-lang="en-US" l10n="U" oldref="21"> 104*b1cdbd2cSJim Jagielski<emph>Number</emph> is a binary number. The number can have a maximum of 10 places (bits). The most significant bit is the sign bit. Negative numbers are entered as two's complement.</paragraph> 105*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3149250" xml-lang="en-US" level="3" l10n="U" oldref="22">Example</paragraph> 106*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3145138" xml-lang="en-US" l10n="U" oldref="23"> 107*b1cdbd2cSJim Jagielski<item type="input">=BIN2DEC(1100100)</item> returns 100.</paragraph> 108*b1cdbd2cSJim Jagielski</section> 109*b1cdbd2cSJim Jagielski<section id="bin2hex"> 110*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3149954"><bookmark_value>BIN2HEX function</bookmark_value> 111*b1cdbd2cSJim Jagielski<bookmark_value>converting;binary numbers, into hexadecimal numbers</bookmark_value> 112*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 113*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BIN2HEX" id="bm_id3149548" localize="false"/> 114*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3149954" xml-lang="en-US" level="2" oldref="24">BIN2HEX</paragraph> 115*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3148585" xml-lang="en-US" l10n="U" oldref="25"><ahelp hid="HID_AAI_FUNC_BIN2HEX">The result is the hexadecimal number for the binary number entered.</ahelp></paragraph> 116*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153936" xml-lang="en-US" level="3" l10n="U" oldref="26">Syntax</paragraph> 117*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3148753" xml-lang="en-US" l10n="U" oldref="27">BIN2HEX(Number; Places)</paragraph> 118*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3155255" xml-lang="en-US" l10n="U" oldref="28"> 119*b1cdbd2cSJim Jagielski<emph>Number</emph> is a binary number. The number can have a maximum of 10 places (bits). The most significant bit is the sign bit. Negative numbers are entered as two's complement.</paragraph> 120*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150860" xml-lang="en-US" l10n="U" oldref="29">Places means the number of places to be output.</paragraph> 121*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3155829" xml-lang="en-US" level="3" l10n="U" oldref="30">Example</paragraph> 122*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149686" xml-lang="en-US" l10n="U" oldref="31"> 123*b1cdbd2cSJim Jagielski<item type="input">=BIN2HEX(1100100;6)</item> returns 000064.</paragraph> 124*b1cdbd2cSJim Jagielski</section> 125*b1cdbd2cSJim Jagielski<section id="bin2oct"> 126*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3153332"><bookmark_value>BIN2OCT function</bookmark_value> 127*b1cdbd2cSJim Jagielski<bookmark_value>converting;binary numbers, into octal numbers</bookmark_value> 128*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 129*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_BIN2OCT" id="bm_id3146848" localize="false"/> 130*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153332" xml-lang="en-US" level="2" oldref="9">BIN2OCT</paragraph> 131*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3155951" xml-lang="en-US" l10n="U" oldref="10"><ahelp hid="HID_AAI_FUNC_BIN2OCT"> The result is the octal number for the binary number entered.</ahelp></paragraph> 132*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153001" xml-lang="en-US" level="3" l10n="U" oldref="11">Syntax</paragraph> 133*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3154508" xml-lang="en-US" l10n="U" oldref="12">BIN2OCT(Number; Places)</paragraph> 134*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153567" xml-lang="en-US" l10n="U" oldref="13"> 135*b1cdbd2cSJim Jagielski<emph>Number</emph> is a binary number. The number can have a maximum of 10 places (bits). The most significant bit is the sign bit. Negative numbers are entered as two's complement.</paragraph> 136*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3155929" xml-lang="en-US" l10n="U" oldref="14"> 137*b1cdbd2cSJim Jagielski<emph>Places</emph> means the number of places to be output.</paragraph> 138*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150128" xml-lang="en-US" level="3" l10n="U" oldref="15">Example</paragraph> 139*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153733" xml-lang="en-US" l10n="U" oldref="16"> 140*b1cdbd2cSJim Jagielski<item type="input">=BIN2OCT(1100100;4)</item> returns 0144.</paragraph> 141*b1cdbd2cSJim Jagielski</section> 142*b1cdbd2cSJim Jagielski<section id="delta"> 143*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3150014"><bookmark_value>DELTA function</bookmark_value> 144*b1cdbd2cSJim Jagielski<bookmark_value>recognizing;equal numbers</bookmark_value> 145*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 146*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_DELTA" id="bm_id3149880" localize="false"/> 147*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150014" xml-lang="en-US" level="2" oldref="129">DELTA</paragraph> 148*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3148760" xml-lang="en-US" l10n="U" oldref="130"><ahelp hid="HID_AAI_FUNC_DELTA">The result is TRUE (1) if both numbers, which are delivered as an argument, are equal, otherwise it is FALSE (0).</ahelp></paragraph> 149*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3155435" xml-lang="en-US" level="3" l10n="U" oldref="131">Syntax</paragraph> 150*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3145247" xml-lang="en-US" l10n="U" oldref="132">DELTA(Number1; Number2)</paragraph> 151*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3149002" xml-lang="en-US" level="3" l10n="U" oldref="133">Example</paragraph> 152*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3151020" xml-lang="en-US" l10n="U" oldref="134"> 153*b1cdbd2cSJim Jagielski<item type="input">=DELTA(1;2)</item> returns 0.</paragraph> 154*b1cdbd2cSJim Jagielski</section> 155*b1cdbd2cSJim Jagielski<section id="dec2bin"> 156*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3157971"><bookmark_value>DEC2BIN function</bookmark_value> 157*b1cdbd2cSJim Jagielski<bookmark_value>converting;decimal numbers, into binary numbers</bookmark_value> 158*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 159*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_DEC2BIN" id="bm_id3148389" localize="false"/> 160*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3157971" xml-lang="en-US" level="2" oldref="55">DEC2BIN</paragraph> 161*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153043" xml-lang="en-US" l10n="U" oldref="56"><ahelp hid="HID_AAI_FUNC_DEC2BIN"> The result is the binary number for the decimal number entered between -512 and 511.</ahelp></paragraph> 162*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3145349" xml-lang="en-US" level="3" l10n="U" oldref="57">Syntax</paragraph> 163*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3150569" xml-lang="en-US" l10n="U" oldref="58">DEC2BIN(Number; Places)</paragraph> 164*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3148768" xml-lang="en-US" l10n="U" oldref="59"> 165*b1cdbd2cSJim Jagielski<emph>Number</emph> is a decimal number. If Number is negative, the function returns a binary number with 10 characters. The most significant bit is the sign bit, the other 9 bits return the value.</paragraph> 166*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149537" xml-lang="en-US" l10n="U" oldref="60"> 167*b1cdbd2cSJim Jagielski<emph>Places</emph> means the number of places to be output.</paragraph> 168*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150265" xml-lang="en-US" level="3" l10n="U" oldref="61">Example</paragraph> 169*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150662" xml-lang="en-US" l10n="U" oldref="62"> 170*b1cdbd2cSJim Jagielski<item type="input">=DEC2BIN(100;8)</item> returns 01100100.</paragraph> 171*b1cdbd2cSJim Jagielski</section> 172*b1cdbd2cSJim Jagielski<section id="dec2hex"> 173*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3149388"><bookmark_value>DEC2HEX function</bookmark_value> 174*b1cdbd2cSJim Jagielski<bookmark_value>converting;decimal numbers, into hexadecimal numbers</bookmark_value> 175*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entr</comment> 176*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_DEC2HEX" id="bm_id3155513" localize="false"/> 177*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3149388" xml-lang="en-US" level="2" oldref="71">DEC2HEX</paragraph> 178*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149030" xml-lang="en-US" l10n="U" oldref="72"><ahelp hid="HID_AAI_FUNC_DEC2HEX">The result is the hexadecimal number for the decimal number entered.</ahelp></paragraph> 179*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150691" xml-lang="en-US" level="3" l10n="U" oldref="73">Syntax</paragraph> 180*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3147535" xml-lang="en-US" l10n="U" oldref="74">DEC2HEX(Number; Places)</paragraph> 181*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3152820" xml-lang="en-US" l10n="U" oldref="75"> 182*b1cdbd2cSJim Jagielski<emph>Number</emph> is a decimal number. If Number is negative, the function returns a hexadecimal number with 10 characters (40 bits). The most significant bit is the sign bit, the other 39 bits return the value.</paragraph> 183*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153221" xml-lang="en-US" l10n="U" oldref="76"> 184*b1cdbd2cSJim Jagielski<emph>Places</emph> means the number of places to be output.</paragraph> 185*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3154869" xml-lang="en-US" level="3" l10n="U" oldref="77">Example</paragraph> 186*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150476" xml-lang="en-US" l10n="U" oldref="78"> 187*b1cdbd2cSJim Jagielski<item type="input">=DEC2HEX(100;4)</item> returns 0064.</paragraph> 188*b1cdbd2cSJim Jagielski</section> 189*b1cdbd2cSJim Jagielski<section id="dec2oct"> 190*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3154948"><bookmark_value>DEC2OCT function</bookmark_value> 191*b1cdbd2cSJim Jagielski<bookmark_value>converting;decimal numbers, into octal numbers</bookmark_value> 192*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entr</comment> 193*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_DEC2OCT" id="bm_id3156260" localize="false"/> 194*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3154948" xml-lang="en-US" level="2" oldref="63">DEC2OCT</paragraph> 195*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153920" xml-lang="en-US" l10n="U" oldref="64"><ahelp hid="HID_AAI_FUNC_DEC2OCT">The result is the octal number for the decimal number entered.</ahelp></paragraph> 196*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153178" xml-lang="en-US" level="3" l10n="U" oldref="65">Syntax</paragraph> 197*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3148427" xml-lang="en-US" l10n="U" oldref="66">DEC2OCT(Number; Places)</paragraph> 198*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3155991" xml-lang="en-US" l10n="U" oldref="67"> 199*b1cdbd2cSJim Jagielski<emph>Number</emph> is a decimal number. If Number is negative, the function returns an octal number with 10 characters (30 bits). The most significant bit is the sign bit, the other 29 bits return the value.</paragraph> 200*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3152587" xml-lang="en-US" l10n="U" oldref="68"> 201*b1cdbd2cSJim Jagielski<emph>Places</emph> means the number of places to be output.</paragraph> 202*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3147482" xml-lang="en-US" level="3" l10n="U" oldref="69">Example</paragraph> 203*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3154317" xml-lang="en-US" l10n="U" oldref="70"> 204*b1cdbd2cSJim Jagielski<item type="input">=DEC2OCT(100;4)</item> returns 0144.</paragraph> 205*b1cdbd2cSJim Jagielski</section> 206*b1cdbd2cSJim Jagielski<section id="erf"> 207*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3083446"><bookmark_value>ERF function</bookmark_value> 208*b1cdbd2cSJim Jagielski<bookmark_value>Gaussian error integral</bookmark_value> 209*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entr</comment> 210*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_ERF" id="bm_id3149823" localize="false"/> 211*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3083446" xml-lang="en-US" level="2" oldref="135">ERF</paragraph> 212*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150381" xml-lang="en-US" l10n="U" oldref="136"><ahelp hid="HID_AAI_FUNC_ERF">Returns values of the Gaussian error integral.</ahelp></paragraph> 213*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3152475" xml-lang="en-US" level="3" l10n="U" oldref="137">Syntax</paragraph> 214*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3163824" xml-lang="en-US" l10n="U" oldref="138">ERF(LowerLimit; UpperLimit)</paragraph> 215*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149715" xml-lang="en-US" l10n="U" oldref="139"> 216*b1cdbd2cSJim Jagielski<emph>LowerLimit</emph> is the lower limit of the integral.</paragraph> 217*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3156294" xml-lang="en-US" l10n="U" oldref="140"> 218*b1cdbd2cSJim Jagielski<emph>UpperLimit</emph> is optional. It is the upper limit of the integral. If this value is missing, the calculation takes places between 0 and the lower limit.</paragraph> 219*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3154819" xml-lang="en-US" level="3" l10n="U" oldref="141">Example</paragraph> 220*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3152974" xml-lang="en-US" l10n="U" oldref="142"> 221*b1cdbd2cSJim Jagielski<item type="input">=ERF(0;1)</item> returns 0.842701.</paragraph> 222*b1cdbd2cSJim Jagielski</section> 223*b1cdbd2cSJim Jagielski<section id="erfc"> 224*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3145082"><bookmark_value>ERFC function</bookmark_value> 225*b1cdbd2cSJim Jagielski</bookmark> 226*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_ERFC" id="bm_id3156307" localize="false"/> 227*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3145082" xml-lang="en-US" level="2" oldref="143">ERFC</paragraph> 228*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149453" xml-lang="en-US" l10n="U" oldref="144"><ahelp hid="HID_AAI_FUNC_ERFC">Returns complementary values of the Gaussian error integral between x and infinity.</ahelp></paragraph> 229*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3155839" xml-lang="en-US" level="3" l10n="U" oldref="145">Syntax</paragraph> 230*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3153220" xml-lang="en-US" l10n="U" oldref="146">ERFC(LowerLimit)</paragraph> 231*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3147620" xml-lang="en-US" l10n="U" oldref="147"> 232*b1cdbd2cSJim Jagielski<emph>LowerLimit</emph> is the lower limit of the integral</paragraph> 233*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3146861" xml-lang="en-US" level="3" l10n="U" oldref="148">Example</paragraph> 234*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3156102" xml-lang="en-US" l10n="U" oldref="149"> 235*b1cdbd2cSJim Jagielski<item type="input">=ERFC(1)</item> returns 0.157299.</paragraph> 236*b1cdbd2cSJim Jagielski</section> 237*b1cdbd2cSJim Jagielski<section id="gestep"> 238*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3152927"><bookmark_value>GESTEP function</bookmark_value> 239*b1cdbd2cSJim Jagielski<bookmark_value>numbers;greater than or equal to</bookmark_value> 240*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 241*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_GESTEP" id="bm_id3151182" localize="false"/> 242*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3152927" xml-lang="en-US" level="2" l10n="E" oldref="150">GESTEP</paragraph> 243*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150763" xml-lang="en-US" l10n="U" oldref="151"><ahelp hid="HID_AAI_FUNC_GESTEP">The result is 1 if <item type="literal">Number</item> is greater than or equal to <item type="literal">Step</item>.</ahelp></paragraph> 244*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3150879" xml-lang="en-US" level="3" l10n="U" oldref="152">Syntax</paragraph> 245*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3145212" xml-lang="en-US" l10n="U" oldref="153">GESTEP(Number; Step)</paragraph> 246*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153275" xml-lang="en-US" level="3" l10n="U" oldref="154">Example</paragraph> 247*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3156132" xml-lang="en-US" l10n="U" oldref="155"> 248*b1cdbd2cSJim Jagielski<item type="input">=GESTEP(5;1)</item> returns 1.</paragraph> 249*b1cdbd2cSJim Jagielski</section> 250*b1cdbd2cSJim Jagielski<section id="hex2bin"> 251*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3147276"><bookmark_value>HEX2BIN function</bookmark_value> 252*b1cdbd2cSJim Jagielski<bookmark_value>converting;hexadecimal numbers, into binary numbers</bookmark_value> 253*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 254*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_HEX2BIN" id="bm_id3145659" localize="false"/> 255*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3147276" xml-lang="en-US" level="2" oldref="79">HEX2BIN</paragraph> 256*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3150258" xml-lang="en-US" l10n="U" oldref="80"><ahelp hid="HID_AAI_FUNC_HEX2BIN">The result is the binary number for the hexadecimal number entered.</ahelp></paragraph> 257*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3156117" xml-lang="en-US" level="3" l10n="U" oldref="81">Syntax</paragraph> 258*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3155847" xml-lang="en-US" l10n="U" oldref="82">HEX2BIN(Number; Places)</paragraph> 259*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3152810" xml-lang="en-US" l10n="U" oldref="83"> 260*b1cdbd2cSJim Jagielski<emph>Number</emph> is a hexadecimal number. The number can have a maximum of 10 places. The most significant bit is the sign bit, the following bits return the value. Negative numbers are entered as two's complement.</paragraph> 261*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153758" xml-lang="en-US" l10n="U" oldref="84"> 262*b1cdbd2cSJim Jagielski<emph>Places</emph> is the number of places to be output.</paragraph> 263*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3154052" xml-lang="en-US" level="3" l10n="U" oldref="85">Example</paragraph> 264*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3156002" xml-lang="en-US" l10n="U" oldref="86"> 265*b1cdbd2cSJim Jagielski<item type="input">=HEX2BIN(64;8)</item> returns 01100100.</paragraph> 266*b1cdbd2cSJim Jagielski</section> 267*b1cdbd2cSJim Jagielski<section id="hex2dec"> 268*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3154742"><bookmark_value>HEX2DEC function</bookmark_value> 269*b1cdbd2cSJim Jagielski<bookmark_value>converting;hexadecimal numbers, into decimal numbers</bookmark_value> 270*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 271*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_HEX2DEC" id="bm_id3149978" localize="false"/> 272*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3154742" xml-lang="en-US" level="2" oldref="87">HEX2DEC</paragraph> 273*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153626" xml-lang="en-US" l10n="U" oldref="88"><ahelp hid="HID_AAI_FUNC_HEX2DEC">The result is the decimal number for the hexadecimal number entered.</ahelp></paragraph> 274*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3143233" xml-lang="en-US" level="3" l10n="U" oldref="89">Syntax</paragraph> 275*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3149293" xml-lang="en-US" l10n="U" oldref="90">HEX2DEC(Number)</paragraph> 276*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3159176" xml-lang="en-US" l10n="U" oldref="91"> 277*b1cdbd2cSJim Jagielski<emph>Number</emph> is a hexadecimal number. The number can have a maximum of 10 places. The most significant bit is the sign bit, the following bits return the value. Negative numbers are entered as two's complement.</paragraph> 278*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3154304" xml-lang="en-US" level="3" l10n="U" oldref="92">Example</paragraph> 279*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3146093" xml-lang="en-US" l10n="U" oldref="93"> 280*b1cdbd2cSJim Jagielski<item type="input">=HEX2DEC(64)</item> returns 100.</paragraph> 281*b1cdbd2cSJim Jagielski</section> 282*b1cdbd2cSJim Jagielski<section id="hex2oct"> 283*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="index" id="bm_id3149750"><bookmark_value>HEX2OCT function</bookmark_value> 284*b1cdbd2cSJim Jagielski<bookmark_value>converting;hexadecimal numbers, into octal numbers</bookmark_value> 285*b1cdbd2cSJim Jagielski</bookmark><comment>mw added one entry</comment> 286*b1cdbd2cSJim Jagielski<bookmark xml-lang="en-US" branch="hid/SC_HID_AAI_FUNC_HEX2OCT" id="bm_id3147487" localize="false"/> 287*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3149750" xml-lang="en-US" level="2" oldref="94">HEX2OCT</paragraph> 288*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3153983" xml-lang="en-US" l10n="U" oldref="95"><ahelp hid="HID_AAI_FUNC_HEX2OCT">The result is the octal number for the hexadecimal number entered.</ahelp></paragraph> 289*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3145660" xml-lang="en-US" level="3" l10n="U" oldref="96">Syntax</paragraph> 290*b1cdbd2cSJim Jagielski<paragraph role="code" id="par_id3151170" xml-lang="en-US" l10n="U" oldref="97">HEX2OCT(Number; Places)</paragraph> 291*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3152795" xml-lang="en-US" l10n="U" oldref="98"> 292*b1cdbd2cSJim Jagielski<emph>Number</emph> is a hexadecimal number. The number can have a maximum of 10 places. The most significant bit is the sign bit, the following bits return the value. Negative numbers are entered as two's complement.</paragraph> 293*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3149204" xml-lang="en-US" l10n="U" oldref="99"> 294*b1cdbd2cSJim Jagielski<emph>Places</emph> is the number of places to be output.</paragraph> 295*b1cdbd2cSJim Jagielski<paragraph role="heading" id="hd_id3153901" xml-lang="en-US" level="3" l10n="U" oldref="100">Example</paragraph> 296*b1cdbd2cSJim Jagielski<paragraph role="paragraph" id="par_id3159341" xml-lang="en-US" l10n="U" oldref="101"> 297*b1cdbd2cSJim Jagielski<item type="input">=HEX2OCT(64;4)</item> returns 0144.</paragraph> 298*b1cdbd2cSJim Jagielski</section> 299*b1cdbd2cSJim Jagielski</sort> 300*b1cdbd2cSJim Jagielski<section id="Section1"> 301*b1cdbd2cSJim Jagielski<embed href="text/scalc/01/04060100.xhp#drking"/> 302*b1cdbd2cSJim Jagielski</section> 303*b1cdbd2cSJim Jagielski</body> 304*b1cdbd2cSJim Jagielski</helpdocument> 305