maple java,讲解：MACM 401、Maple worksheet、Java，Python、Java，c++SQL|

讲解：MACM 401、Maple worksheet、Java，Python、Java，c++SQL|MACM 401/MATH 801Assignment 1, Spring 2019.Michael MonaganThis assignment is to be handed in by 4pm Monday January 21st.Hand in to Dropoff box 1A outside AQ 4100.Late penalty: 20% for up to 48 hours late. Zero after that.For problems involving Maple calculations and Maple programming, please submit a printout of aMaple worksheet.Question 1 (15 marks): Karatsuba’s AlgorithmReference: Algorithm 4.2 in the Geddes text.(a) By hand, calculate 5432 × 3829 using Karatsuba’s algorithm. You will need to do threemultiplications involving two digit integers. Do the first one, 54 × 38, using Karatsuba’salgorithm (recursively). Do the other two using any method.(b) Let T(n) be the time it takes to multiply two n digit integers using Karatsuba’s algorithm.We will assume (for simplicity) that n = 2kfor some k > 0. Then for n > 1, we haveT(n) ≤ 3T(n/2) + cn for some constant c > 0 and T(1) = d for some constant d > 0.First show that 3k = nlog2 3. Now solve the recurrence relation and show that T(n) =(2c + d)nlog2 3 2cn thus concluding that T(n) ∈ O(nlog2 3) = O(n1.585). Show your working.(c) Show that T(2n)/T(n) ～ 3, that is, if we double the length of the integers then the time forKaratsuba’s algorithm increases by a factor of 3 (asymptotically).Question 2 (15 marks): GCD Algorithms(a) Implement the binary GCD algorithm in Maple as the Maple procedure named BINGCD tocompute the GCD of two positive integers a and b. Use the Maple functions irem(a,b) andiquo(a,b) for dividing by 2.Your Maple code will have a main loop in it. Each time round the loop please print outcurrent values of (a, b) using the commandprintf(a=%d b=%d\n,a,b);so that you and I can see the algorithm working. Test your procedure on the integers a =16 × 3 × 101 and b = 8 × 3 × 203.(b) I think Maple’s command GCD(A,B) mod p; uses the Euclidean algorithm to compute theGCD of two polynomials A(x) and B(x) in the ring Zp[x]. [ We will show later that for twopolynomials A(x) and B(x) of degree d, the Euclidean algorithm does O(d2) arithmetic operationsin Zp. ] Let’s verify if this could true by timing Maple’s Gcd(A,B) mod p; commandand seeing if the times are quadratic in the degree d. Execute the following code in Mapleand test to see if the times you get are quadratic in d. Justify your answer. Hint: if T(d) isthe time and T(d) is quadratic in d, what should T(2d)/T(d) approach when d large?1d := 1000;p := prevprime(2^30);for i to 7 doA := Randpoly(d,x) mod p;B := Randpoly(d,x) mod p;st := time();G := Gcd(A,B) mod p;tt := time()-st;printf(deg=%d G=%a time=%7.3fsecs \n,d,G,tt);d := 2*d;od:Question 3 (20 marks): The Gaussian IntegersLet G be the subset of the complex numbers C defined by G = { x + y i : x, y ∈ Z, i =√1 }.G is called the set of Gaussian integers and is usually denoted by Z[i].(a) Why is G an integral domain?What are the units in G?Let a, b ∈ G. In order to define the remainder of a divided by b we need a measure v : G → N forthe size of a non-zero Gaussian integer. We cannot use v(x + iy) = |x + iy| =px2 + y2 the lengthof the complex代做MACM 401作业、代写Maple worksheet作业、代做Java，Python语言作业、代写Java，c+ number x + iy because it is not an integer valued function. We will instead use thenorm N(x + iy) = x2 + y2for v(x + iy).(b) Show that for a, b ∈ G, N(ab) = N(a)N(b).Show that for a, b ∈ G with b 6= 0, N(ab) ≥ N(a).(c) Let a, b ∈ G with b 6= 0. Find a definition for the quotient q and remainder r satisfyinga = b q + r with r = 0 or v(r) 2 + y2. Using yourdefinition calculate the quotient and remainder of a = 63 + 10i divided by b = 7 + 43i.Hint: consider the real and imaginary parts of the complex number a/b and consider howto choose the quotient of a divided b. Note, you must prove that your definition for theremainder r satisfies r = 0 or v(r) will help you. Now since part (b) implies v(ab) ≥ v(b) for non-zero a, b ∈ G, this establishesthat G is a Euclidean domain.(d) Finally write a Maple procedure REM such that REM(a,b) computes the remainder r of adivided b using your definition from part (c). Now compute the gcd of a = 63 + 10i andb = 7 + 43i using the Euclidean algorithm and your REM procedure. You should get 2 + 3i upto multiplication by a unit. Also, test your procedure on a = 330 and b = ?260.Note, in Maple I is the symbol used for the complex number i and you can use the Re andIm commands to pick off the real and imaginary parts of a complex number. Also, the roundfunction may be useful. For example> a := 2+5/3*I;a := 2 + 5/3 I> Re(a);22> Im(a);5/3> round(a);2 + 2 IQuestion 4 (10 marks): The Extended Euclidean AlgorithmReference: Algorithm 2.2 in the Geddes text.Given a, b ∈ Z, the extended Euclidean algorithm solves sa + tb = g for s, t ∈ Z and g = gcd(a, b).More generally, for i = 0, 1, ..., n, n+ 1 it computes integers (ri, si, ti) where r0 = a, r1 = b satisfyingsia + tib = ri for 0 ≤ i ≤ n + 1.(a) For m = 99, u = 28 execute the extended Euclidean algorithm with r0 = m and r1 = u byhand. Use the tabular method presented in class that shows the values for ri, si, ti, qi. Hencedetermine the inverse of u modulo m.(b) Repeat part (a) but this time use the symmetric remainder, that is, when dividing a by bchoose the quotient q and remainder r are integers satisfying a = bq+r and ?|b/2| ≤ r instead of 0 ≤ r Question 5 (10 marks): MATH 701 and MATH 801 students onlySuppose we call the extended Euclidean algorithm with integers a ≥ b > 0. Thus r0 = a, r1 = band rn = g where g = gcd(a, b). Prove the following properties about the integers t0, t1, ..., tn, tn+1that appear in the extended Euclidean algorithm (assuming the positive remainder is used).(i) |ti1| | for i = 3, ..., n + 1.(ii) ri ti1 ri1 ti = (?1)i a for i = 1, ..., n + 1.(iii) tn+1 = (1)na/g. Hint: put i = n + 1 into (ii).Since the ti are increasing in magnitude from (i), then (iii) implies |tn| extended Euclidean algorithm with input a = m and b = u to compute the inverse of u modulo m.If g = 1, then we have ?m if tn 转自：http://ass.3daixie.com/2019012368012056.html

maple java,讲解：MACM 401、Maple worksheet、Java，Python、Java，c++SQL|相关推荐

python比java简单好学-21、PHP和python/JAVA比，哪个更好学？
PHP是公认比较容易学习的编程语言. 一般学习半个月左右就可以开发简单网站,一般学习四五天就可以用PHP进行网站的二次开发. 想要学习一种技能,先要知道这个技能是什么,有什么用, 尤其对于零基础又想学 ...
java http url 401 unauthorized_java - 为什么我在Maven中收到“401 Unauthorized”错误？
为什么我在Maven中收到"401 Unauthorized"错误? 这是我在调用mvn deploy -e(底部的完整日志)时遇到的错误: mvn deploy -e mvn d ...
Java入门1.2.3—一个老鸟的Java学习心得
Java入门1.2.3-一个老鸟的Java学习心得基本信息作者: 臧萌出版社:清华大学出版社 ISBN:9787302217831 上架时间:2010-3-30 出版日期:2010 年3月 ...
Java改知能机_Java 面试突击之 Java 并发知识基础进阶考点全解析
版权说明:本文内容根据 github 开源项目整理所得项目地址:https://github.com/Snailclimb/JavaGuidegithub.com 一.基础什么是线程和进程? 何 ...
深入java虚拟机第四版_深入理解Java虚拟机-常用vm参数分析
Java虚拟机深入理解系列全部文章更新中... https://blog.ouyangsihai.cn/shen-ru-li-jie-java-xu-ni-ji-java-nei-cun-qu-yu- ...
java -version cmd_java如何运行步骤cmd？Java执行cmd命令方法有哪些？
写好一个java程序之后,我们的最终目的就是可以正确的运行程序,如果程序运行正确了,那么代码也就没有什么问题了,可是java如何运行步骤cmd?接下来,我们就来给大家讲解一下这方面的内容. 1.首先用 ...
Java架构师笔记-你必须掌握学习Java需要掌握哪些技能
闲来无事,师长一向不(没)喜(有)欢(钱)凑热闹,倒不如趁着这时候复盘复盘.而写这篇文章的目的是想总结一下自己这么多年来使用java的一些心得体会,希望可以给大家一些经验,能让大家更好学习和使用Jav ...
梯度下降原理及线性回归代码实现（python/java/c++）
"梯度下降"顾名思义通过一步一步迭代逼近理想结果,当达到一定的精度或者超过迭代次数才退出,所以所获得的结果是一个近似值.在其他博客上面基本都有一个通俗的比喻:从山顶一步步下山.下面 ...
java语言中声明布尔型_【Java初探02】——Java语言基础
本篇博文就Java语言的一些基本元素进行一些记录和阐述,主要讲解一下Java语言的一些基本构成元素和Java的主类结构. Java语言基础的大致组成 java主类结构基本的数据类型变量与常量运算 ...

maple java,讲解：MACM 401、Maple worksheet、Java，Python、Java，c++SQL|

maple java,讲解：MACM 401、Maple worksheet、Java，Python、Java，c++SQL|相关推荐

最新文章

热门文章