⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 bugfixes and updates to calc.htm

📁 calc大数库
💻 HTM
📖 第 1 页 / 共 3 页
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0049)http://www.numbertheory.org/calc/calc_bugfix.html -->
<HTML><HEAD><TITLE>BUGFIXES AND UPDATES TO CALC</TITLE>
<META http-equiv=Content-Type content="text/html; charset=utf-8">
<STYLE type=text/css>BODY {
	FONT-FAMILY: Helvetia, sans-serif
}
A:visited {
	TEXT-DECORATION: none
}
A:link {
	TEXT-DECORATION: none
}
A:hover {
	TEXT-DECORATION: underline
}
</STYLE>

<META content="MSHTML 6.00.2900.2180" name=GENERATOR></HEAD>
<BODY bgColor=#ffffff>
<H2>Bug and updates to calc</H2>
<UL>
  <LI>28th September 2007. Added a windows XP version of calc, thanks to 
  Jean-Jacques Delgove. 
  <LI>26th February 2007. Fixed a counting error in <TT>cfracperiod()</TT> which 
  occurred only when the period-length ≥ 2<SUP>31</SUP>. 
  <LI>13th February 2007. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#cfracperiod">cfracperiod</A>. 

  <LI>12th February 2007. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#euclid1">euclid1</A>. 
  <LI>12th February 2007. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#powerd">powerd</A>. 
  <LI>6th February 2007. Noticed that <TT>lllhermite()</TT> was printing an 
  unwanted matrix when in verbose mode. 
  <LI>15th November 2006. Improved <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#reducepos"><TT>reducepos()</TT></A> 
  and added output file reducepos.out. Also construct an unimodular transforming 
  matrix converting the given form to a reduced form. This feature is available 
  in the <A href="http://www.numbertheory.org/php/reducepos.html">BCMATH 
  version</A>. 
  <LI>30th June 2006. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#repdefinite"><TT>repdefinite()</TT></A>. 

  <LI>16th May 2006. Changed <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#[54]"><TT>cycle()</TT></A> 
  so that the cycle generator is of minimal absolute value. 
  <LI>18th December 2004. Balbir Thomas pointed out that calc.tar.gz was 
  inaccessible. This was because I had switched over to storing only calc.tar! I 
  no longer gzip the file, as some people had trouble gunzipping it. 
  <LI>11th November 2004. <TT>help</TT> had omitted descriptions of 
  <TT>congr</TT> and <TT>inhomfp</TT>; also the description for <TT>slv</TT> was 
  that of <TT>inhomfp</TT>. 
  <LI>16th August 2004. It has been pointed out that <TT>p-adic.c</TT> was still 
  apparently omitted from the source files in calc.tar.gz. This has now been 
  fixed. 
  <LI>12th July 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#cycle_clarification">clarification</A> 
  to cycle program, both in krm_calc.html and readme.c. The latter has been 
  incorporated into calc.tar, but not in the dos executable so far. 
  <LI>1st June 2004. I noticed that <TT>p-adic.c</TT> was strangely omitted from 
  the source files in calc.tar.gz. 
  <LI>27th April 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#ramanujan"><TT>ramanujan</TT></A>. 

  <LI>15th April 2004. Fixed an error in <TT>CORNACCHIAX()</TT> in primes1.c, 
  where I had <TT>t &lt; 0</TT> instead of <TT>t &gt; 0</TT>. This had the 
  effect of preventing <TT>cornacchia()</TT> from being used! 
  <LI>4th April 2004. Fixed the omission of the &amp;a[] in the description of 
  <TT>twoadicsqrt(b,n,&amp;a[])</TT>; 
  <LI>4th April 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#padicsqrt"><TT>padicrsqrt</TT></A>. 

  <LI>3rd April 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#twoadicsqrt"><TT>twoadicrsqrt</TT></A>. 

  <LI>30th March 2004. Made <TT>buff</TT> and <TT>outfile</TT> global variables 
  in davison.c, so as to have but one <TT>fopen</TT> and one <TT>fclose</TT>. 
  Also changed maximum number of partial quotients from 10<SUP>5</SUP> to 
  10<SUP>6</SUP>. 
  <LI>30th March 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#raney"><TT>raney</TT></A>. 

  <LI>31st March 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#unimodular"><TT>unimodular</TT></A>. 

  <LI>30th March 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#raney"><TT>raney</TT></A>. 

  <LI>29th March 2004. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#davison"><TT>davison</TT></A>. 

  <LI>16th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#tablepos"><TT>tablepos</TT></A>. 

  <LI>15th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#tableneg"><TT>tableneg</TT></A>. 

  <LI>12th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#classnop0"><TT>classnop0</TT></A>. 

  <LI>12th May 2003. Regarding <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#classnop"><TT>classnop</TT></A> 
  - fixed a small error in <TT>PERIOD</TT> in the file reductio.c - was 
  returning <TT>global_count</TT>, instead of <TT>cycle_length</TT>. 
  <LI>9th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#reducepos"><TT>reducepos</TT></A>. 

  <LI>8th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#reduceneg"><TT>reduceneg</TT></A>. 

  <LI>7th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#nearint"><TT>nearint</TT></A>. 

  <LI>7th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#classnon"><TT>classnon</TT></A>. 

  <LI>6th May 2003. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#classnop"><TT>classnop</TT></A>. 

  <LI>26th September 2002. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#cyclotomic"><TT>cyclotomic</TT></A>. 

  <LI>23rd September 2002. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#sturmsequence"><TT>sturmsequence</TT></A>. 
  Also added some checking to <TT>lagrange</TT>, as well as now catering for the 
  case when the root is rational. 
  <LI>23rd September 2002. I no longer provide calc.exe.gz, only calc.exe, as 
  some people had trouble with the former. 
  <LI>4th September 2002. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#primes"><TT>primes</TT></A>. 

  <LI>20th August 2002. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#resultant"><TT>resultant(p,q)</TT></A>, 
  <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#discriminant"><TT>discriminant(p)</TT></A> 
  and <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#deriv"><TT>deriv(p)</TT></A>. 

  <LI>27th June 2002. Added <A 
  href="http://www.numbertheory.org/calc/krm_calc.html#testlog"><TT>testlog(a,b,d,m,n)</TT></A>. 

  <LI>25th June 2002. Tidied up <TT>log</TT>. It now seems to print only partial 
  quotients, though doubtless there is a counterexample. 
  <LI>23rd June 2002. I coded an improved algorithm for finding with high 
  certainty the continued fraction expansion of log<SUB>b</SUB>a, as expounded 
  in the latest version of <A 
  href="http://www.math.uwaterloo.ca/JIS/VOL5/Jackson/matthews3.html">paper</A>. 
  Typing <TT>log(3,2,10,100,&amp;a[],&amp;l)</TT> produces the first l = 102 
  partial quotients a[0],...,a[101] of log<SUB>2</SUB>3. I had to code the 
  ceiling function <TT>ceil(a,b)</TT>. This is the least integer not less than 
  a/b. 
  <LI>28th March 2002. Didn't quite get it right yesterday. I now think I have 
  fixed things. 
  <LI>27th March 2002. I noticed that <TT>patz(180,-1616)</TT> was missing some 
  fundamental solutions. Fixed the bug around line 85 of lagrange.c. 
  <LI>18th January 2001. Fixed an error in <TT>SQROOT</TT> in primes1.c at line 
  1569. Also improved the definition of SO at line 1589. The problem was only 
  noticeable if N divided D and was composed of at least 2 primes. (Arose from 
  typing <TT>binform(11,-35,5,18,1)</TT> and getting a bus error.) 
  <LI>6th January 2001. Added output to file <TT>binform.out</TT> for 
  <TT>binform(a,b,c,n,e)</TT>. 
  <LI>5th January 2001. Changed <TT>binform(a,b,c,n)</TT> to 
  <TT>binform(a,b,c,n,e)</TT>, where e=1 is verbose, e=0 is terse. 
  <LI>5th January 2001. In <TT>binform(a,b,c,n)</TT>, I now test to see if 
  d=gcd(a,b,c) divides n; if so, a,b,c,n are replaced by a/d,b/d,c/d,n/d. Also 
  test to see if n is nonzero. 
  <LI>4th January 2001. Somehow I had not made the change e to l at line 1625 in 
  the UNIX copy of CALC. I also deleted lines 884-893 of <TT>lagrange.c</TT>, as 
  they were not necessary and in fact resulted in an occasional extra equivalent 
  solution. Finally, I added a test to preclude b^2-4ac <IMG 
  src="BUGFIXES AND UPDATES TO CALC.files/leq.gif" align=middle> 0 or a perfect 
  square.<BR>(The foregoing was in response to some observations of Dario 
  Alejandro Alpern.) 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -