Eine aufbereitete Darstellung der Quelle

 
     
 
 
Anforderungen  |   Konzepte  |   Entwurf  |   Entwicklung  |   Qualitätssicherung  |   Lebenszyklus  |   Steuerung
 
 
 
 

Benutzer

Impressum chap2_mj.html   Sprache: HTML

 

 products/Sources/formale Sprachen/GAP/pkg/factint/doc/chap2_mj.html


<?xml version="1.0" encoding="UTF-8"?>span ="APprompt>ap&t<span><pan "APinput"s : ()<spanjava.lang.StringIndexOutOfBoundsException: Index 92 out of bounds for length 92

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/<span class="GAPprompt">gap></span>class"">(ps)</span>
<head>
<script type="text/javascriptfalse
  src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-java.lang.StringIndexOutOfBoundsException: Range [1, 99) out of bounds for length 1
</script>
<title>GAP (
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
< name="generator =GAPDoc2HTML >
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0


<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#an style='color: green'>8227; IsEllipticQuadric</code>( <var class="Arg">ps</var> )</td><td class="tdright">( property )</td></tr></table></div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap1_mj.html">[Previous Chapter]</a>    <a href="chap3_mj.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chap2.html">[MathJax off]</a></p>
<p><a id="X7B1A84BB788FC526" name="X7B1A84BB788FC526"></a></p>
<div class="ChapSects"><a href="chap2_mj.html#X7B1A84BB788FC526">2 <span class="Heading">The General Factorization Routine</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap2_mj.html#X83BF2CD28017ABC5">2.1 <span class="Heading">The method for <code class="code">Factors</code></span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap2_mj.html#X833B087D7A83BC7A">2.1-1 Factors</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap2_mj.html#X866CD23D78460060">2.1-2 FactInt</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap2_mj.html#X80EB87DD80462F80">2.2 <span class="Heading">Getting information about the factoring process</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap2_mj.html#X8093BB787C2E764B">2.2-1 InfoFactInt</a></span>
</div></div>
</div>

<h3>2 <span class="Heading">The General Factorization Routine</span></h3>

<p><a id="X83BF2CD28017ABC5" name="X83BF2CD28017ABC5"></a></p>

<h4>2.1 <span class="Heading">The method for <code class="code">Factors</code></span></h4>

<p>The <strong class="pkg">FactInt</strong> package provides a better method for the operation <code class="code">Factors</code> for integer arguments, which supersedes the one included in the <strong class="pkg">GAP</strong> Library:</p>

<p><a id="X833B087D7A83BC7A" name="X833B087D7A83BC7A"></a></p>

<h5>2.1-1 Factors</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#an style='color: green'>8227; Factors</code>( <var class="Arg">n</var> )</td><td class="tdright">( method )</td></tr></table></div>
<p>Returns: a sorted list of the prime factors of <var class="Arg">n</var>.</p>

<p>The returned factors pass the built-in probabilistic primality test of <strong class="pkg">GAP</strong> (<code class="code">IsProbablyPrimeInt</code>, Baillie-PSW Primality Test; see the <strong class="pkg">GAP</strong> Reference Manual). If the method fails to compute the prime factorization of <var class="Arg">n</var>, an error is signalled. The same holds for all other factorization routines provided by this package. It follows a rough description how the factorization method works:</p>

<p>First of all, the method checks whether <span class="SimpleMath">\(n = b^k \pm 1\)</span> for some <span class="SimpleMath">\(b\)</span>, <span class="SimpleMath">\(k\)</span> and looks for factors corresponding to polynomial factors of <span class="SimpleMath">\(x^k \pm 1\)</span>. Provided that <span class="SimpleMath">\(b\)</span> and <span class="SimpleMath">\(k\)</span> are not too large, the factors that do not correspond to polynomial factors are taken from Richard P. Brent's java.lang.StringIndexOutOfBoundsException: Index 496 out of bounds for length 29

<p>Then the method uses trial division and a number of cheap<div class="><pre>

<p>If there is still an unfactored part remaining afterinput>mat:IdentityMat(6,GF());/java.lang.StringIndexOutOfBoundsException: Range [97, 98) out of bounds for length 97

<p>The following options are interpreted:</p>


<dl>
<dt><strong class="Mark"><var class="Arg">TDHints</var></strong></dt>
<dd><p>A list of span class="GAPpromptgap>/span>< =GAPinput">form := BilinearFormByMatrix(mat,GF(5));</span>

</dd>
<dt><strong class="Mark"><var class="Arg">RhoSteps</var></strong></dt>&t;bilinear form gt;
<dd><p>The number of steps for Pollard's Rho.</pspan=GAPprompt>&t<span s class=GAPinput>s = PolarSpaceform);<s>

</dd>
<dt><strong class="Mark"><var class="Arg">java.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 35
<dd><,GF(5) ^x_2^2x3^+2x_5+_^= gt;

</dd>
<dt><strong class="Mark"><var class="Arg">Pminus1Limit1</var> / <var class<span ="APprompt">gapgt<>spanclass="APinput"IsEllipticQuadricps);/pan>
<dd><p>The first- / second stage limitjava.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5

</dd>
<dt><strong class="Mark"><var class="Arg">Pplus1Residues</var></java.lang.StringIndexOutOfBoundsException: Range [64, 70) out of bounds for length 50
<dd><p>The number of residues to be tried by Williamsspan class"APprompt>apgt;/> span "APinput"form:=BilinearFormByMatrix(,7)<span>

</dd>
<dt><strong class= t java.lang.StringIndexOutOfBoundsException: Range [18, 13) out of bounds for length 23
dp secondjava.lang.StringIndexOutOfBoundsException: Range [33, 32) out of bounds for length 226

</dd>
<dt><strong class="Mark"><var class="Arg">ECMCurves</var></strong></dt>
<dd><p>The number of elliptic curves to be java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 35

<dd>
<dt><strong class="Mark"><var class="Arg">ECMLimit1</var> / <var class="Arg">ECMLimit2</var></strong></dt>
<dd><p>The initial

</dd>
<dt><strong class="Mark"><var class="Arg">ECMDelta</var></<pre</java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
<dd><p>The increment per curve for the first stage <p><a id="X87ADB8B5790776C7" name="X87ADB8B5790776C7"><

</dd>
<dt><strong class="Mark
<dd><p>If true, ECM chooses its curves deterministically, i.e. repeatable (see <7.38IsParabolicQuadric</h5java.lang.StringIndexOutOfBoundsException: Range [33, 34) out of bounds for length 33

</dd>
<dt><strongfunc"<able "" =100%>tr><class="dleft"><code =f"&8227 IsParabolicQuadric/odevar class=">s<var )/td>td "tdright">( property )</td></tr></table></div>
<dd><p>Specifies which of the factor base methods should be used to do the "hard work". Currently pReturns: true  or <p>

</dd>
</dl>
<p>For the use of the <strong class="pkg">GAP</p>returns if only if v ""><var> is a parabolic quadric./>

<p>Setting <var class="Arg">RhoSteps</var>, <var class="Arg">Pminus1Limit1</var>, <var class="Arg">Pplus1Residues</var>


<div class="java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 0

<span class="GAPprompt">gap></span> <span class="GAPinput">Factors( Factorial(44)span "GAPprompt>ap&;/> <class="GAPinput"mat : (,GF(9)<span>
[ 694763, 9245226412016162109253, 413852053257739876455072359 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">Factors( 2^997 - 1 );  (^0,0*Z(),0*() 0Z3 *()] 
[ 167560816514084819488737767976263150405095191554732902607, 
  java.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
3002563860297371289151859287894468775962208410650878341385577817736702\
2158878920741413700868182301410439178049533828082651513160945607018874\
30040978453228378816647358334681553 ]

</pre></div>

<p>The above method for <code class="code">Factors</code> calls the following function, which is the actual "working horse" of this package:</p>

<p><a id="X866CD23D78460060" name="X866CD23D78460060"></a></p>

<h5>2.1-2 FactInt</h5>

<div class="func"><table class="func" width="100%"><tr><td class="[0*() 0*(3, 0*(33,0Z(3) (3)0]]
<p>Returns: a list of two lists, where the first list contains the determined prime factors of <var class="Arg">n</var&;/pan> sjava.lang.StringIndexOutOfBoundsException: Range [45, 44) out of bounds for length 109

<p>java.lang.StringIndexOutOfBoundsException: Range [70, 4) out of bounds for length 70

<p><code class="code">Factors(<var class="Arg">n</var>)</code> is equivalent to <code class="code">FactInt(<var class="Arg">n</var>:<var class="Arg">cheap</var>:=false, <var class="Arg">FactIntPartial</var>:=false)[1]</code>.</p>


<div class="example"><pre>

<span class="GAPprompt">gap></span> <span class="GAPinput">FactInt( Factorial(300) + 1 : cheap );</span>
[ [ 461, 259856122109, 995121825812791, 3909669044842609, 
      4220826953750952739, 14841043839896940772689086214475144339 ], 
  [ 104831288231765723173983836560438594053336296629073932563520618687\
9287645058010688827246061541065631119345674081834085960064144597037243\
9235869682208979384309498719255615067943353399357029226058930732298505\
5816977495398426741656633461747046623641451042655247093315505417820370\
9451745871701742000546384614472756584182478531880962594857275869690727\
9733563594352516014206081210368516157890709802912711149521530885498556\
1244667790208245620301404499928532222524585946881528337257061789593197\
99211283640357942345263781351 ] ]

</pre></div>

<p><a id="X80EB87DD80462F80" name="X80EB87DD80462F80"></a></p>

<h4>2.2 <span class="Heading">Getting information about the factoring process</span></h4>

<p>Optionally, the <strong class="pkg">FactInt</strong> package prints information on the progress of the factorization process:</p>

<p><a id="X8093BB787C2E764B" name="X8093BB787C2E764B"></a></p>

<h5>2.2-1 InfoFactInt</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#an style='color: green'>8227; InfoFactInt</code></td><td class="tdright">( info class )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class<span class=GAPprompt>g<s> <pan class=""v: [,1,]Z()0<span>
<p>This Info class allows to monitor what happens during the factoring process.</p>

<p>If <code class="code">InfoLevel(InfoFactInt) [ Z()^0, 0Z(2) Z2^,0Z2 java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 34

<p>Enter <code class="code">FactIntInfo(<var class="Arg">level</var>)</code> to set the <code class="code">InfoLevel</code> of <code class="code">InfoFactInt</code> to the java.lang.StringIndexOutOfBoundsException: Index 179 out of bounds for length 106

<pError lt;> notgenerate an element of <geom> called from


<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap1_mj.html">[Previous Chapter]</a>    <a href="chap3_mj.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><acalled fromeval at line12 f *stdinjava.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49

<hr />
<p class="foot">generated by <a href="http://www.you can 'eturn;  
</body>
</html>

Messung V0.5 in Prozent
C=100 H=95 G=97

¤ Dauer der Verarbeitung: 0.134 Sekunden  ¤

*© Formatika GbR, Deutschland






Wurzel

Suchen

PVS Prover

Isabelle Prover


Cephes Mathematical Library

Vienna Development Method

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.






                                                                                                                                                                                                                                                                                                                                                                                                     


Neuigkeiten

     Aktuelles
     Motto des Tages

Open Source Software

     Quellcodebibliothek
     Eigene Quellcodes
     Fremde Quellcodes
     Suchen

Jenseits des Üblichen ....
    

Besucherstatistik

Besucherstatistik

Statistik
#Sources=7919
#Domains=4692