[sage-support] SAGE TA ?
Hello group, has anybody tried to implement something like Maple TA in sage? For example I would like to have students take placement exams with free form answers. In case you don't know what Maple TA is: ,[ http://www.maplesoft.com/products/mapleta/ ] | Maple T.A. is an easy-to-use web-based system for creating tests and | assignments, automatically assessing student responses and | performance. It supports complex, free-form entry of mathematical | equations and intelligent evaluation of responses, making it ideal | for mathematics, science, or any course that requires mathematics. ` BTW is this the right group for this kind of questions? Thanks, Nikos Apostolakis --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: SAGE TA ?
By strange coincidence, I am familiar with SAGE, MAPLE TA, and math validation and placement (I'm one of only two at my school who gets some summer pay for doing this)! I think this would be great, but significant work (obviously) to get set up. My recommendation, in case someone wants to do this, is to use SAGE in conjunction with OKUSON http://www.math.rwth-aachen.de/~OKUSON/ There is some discussion of using OKUSON here at my school but there are a number of technical (non-math and non-SAGE) related issues which have to be worked out. +++ On 3/26/07, Nikos Apostolakis [EMAIL PROTECTED] wrote: Hello group, has anybody tried to implement something like Maple TA in sage? For example I would like to have students take placement exams with free form answers. In case you don't know what Maple TA is: ,[ http://www.maplesoft.com/products/mapleta/ ] | Maple T.A. is an easy-to-use web-based system for creating tests and | assignments, automatically assessing student responses and | performance. It supports complex, free-form entry of mathematical | equations and intelligent evaluation of responses, making it ideal | for mathematics, science, or any course that requires mathematics. ` BTW is this the right group for this kind of questions? Thanks, Nikos Apostolakis --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: SAGE TA ?
On Monday 26 March 2007 07:44, Nikos Apostolakis wrote: Hello group, has anybody tried to implement something like Maple TA in sage? For example I would like to have students take placement exams with free form answers. In case you don't know what Maple TA is: I'm interested in such things and I have a question bank which I'm building (this very week) in this direction. For the moment, I'm trying to come up with something that could help me generate paper homework and paper review sheets very quickly (along with solutions). However, I'm developing my questions with an eye to electronic use. MapleTA is very complicated and I think that we could do much much better with something opensource. I've said as much to my University, but they seem quite set on MapleTA for the moment. It's a shame because I think the whole thing might flop precisely because they are set on that product. -- Joel --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Fwd: SAGE VMWare troubles
Hi Jack: Sorry for the problems. I'm forwarding your message to sage-support since I don't use windows or vmware. - David -- Forwarded message -- From: Jack Schmidt [EMAIL PROTECTED] Date: Mar 26, 2007 9:57 AM Subject: SAGE VMWare troubles To: David Joyner [EMAIL PROTECTED], [EMAIL PROTECTED] Regarding Cygwin, SAGE will continue to support Cygwin. However, with SAGE-2.4 I'm also going to release a VMware virtual machine with SAGE preinstalled. Performance of SAGE under this machine is in many cases better than with Cygwin, *especially* when using code that isn't native to SAGE -- e.g., when using GAP via SAGE the experience is vastly better via the VMware machine, since forks and pseudo tty's work vastly better under Linux than in Windows. Also, the VMware machine will come with exactly the right optimized numerical libraries preinstalled, etc. I tried the new VMWare download for sage 2.4 on Windows XP. I downloaded the VMWare player and the two zip files from http://modular.math.washington.edu/sage/SAGEbin/vmware/sage-2.4/ extracted both, copied SAGE0-1.vmdk into sage-vmware-appliance\sage-vmware-appliance and double clicked on sage.vmx I got the error message: One or more of the disks used by this virtual machine was created by an unsupported version of vmware player. To power on or upgrade the virtual machine, either remove the unsupported disk(s) or use a version of VMWare player that supports this version of disks. Below is a list of the disks and their reported versions. Version 6 SAGE0-1.vmdk Version 4 Ubuntu.vmdk Version 4 swap.vmdk Removing these disks of course only changes the error message to: File not found: SAGE0-1.vmdk This file is required to power on this virtual machine. Use VMWare Workstation to repair this virtual machine. The readme.txt file for VMWare player says to use the help menu inside the product. Opening VMWare player gives a modal dialog box forcing me to find a valid vmware configuration file. There not being any, I cannot open the help menu. --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] is_prime for polynomials over ZZ
I just want to tell the user of my factoring apps when the quadratic that they submit is prime. I've tried is_prime, and len(factor(x^2+B*x+C)) (thinking an answer of one would mean its prime, but it does not mean that). What is the best way in SAGE right now to test a polynomial over ZZ to tell if it is irreducible over ZZ? --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: is_prime for polynomials over ZZ
On Mar 26, 2007, at 3:57 PM, Timothy Clemans wrote: Apparently I was incorrectly defining x as an integer, however, I did not get an error the first I tried. incorrect way: x = PolynomialRing(ZZ) correct way: g.x = PolynomialRing(ZZ) The len method works now. Thanks. Be careful though: sage: R.x = PolynomialRing(ZZ) sage: f = 2*x^2 + 4*x + 8 sage: f.factor() 2 * (x^2 + 2*x + 4) sage: len(f.factor()) 2 David --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: is_prime for polynomials over ZZ
On Monday 26 March 2007 1:02 pm, David Harvey wrote: On Mar 26, 2007, at 3:57 PM, Timothy Clemans wrote: Apparently I was incorrectly defining x as an integer, however, I did not get an error the first I tried. incorrect way: x = PolynomialRing(ZZ) correct way: g.x = PolynomialRing(ZZ) The len method works now. Thanks. Be careful though: sage: R.x = PolynomialRing(ZZ) sage: f = 2*x^2 + 4*x + 8 sage: f.factor() 2 * (x^2 + 2*x + 4) sage: len(f.factor()) 2 Which might actually be what one wants, since indeed your poly f is not prime as an element of ZZ[x], since (2) is a prime ideal and (x^2+2*x+4) is divisible by other prime ideals. Note that there is an is_irreducible() method for polynomials, which correctly deals with the case of a multiple factor: sage: f = (x-1)^2 sage: f.is_irreducible() False sage: len(f.factor()) 1 -- william --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: is_prime for polynomials over ZZ
On Mar 26, 2007, at 13:02 , David Harvey wrote: On Mar 26, 2007, at 3:57 PM, Timothy Clemans wrote: Apparently I was incorrectly defining x as an integer, however, I did not get an error the first I tried. incorrect way: x = PolynomialRing(ZZ) correct way: g.x = PolynomialRing(ZZ) The len method works now. Thanks. Be careful though: sage: R.x = PolynomialRing(ZZ) sage: f = 2*x^2 + 4*x + 8 sage: f.factor() 2 * (x^2 + 2*x + 4) sage: len(f.factor()) 2 Just to make matters worse: sage: f=2*x^2+4*x+8 sage: F=factor(f) sage: len(F) 1 sage: len(f.factor()) 1 sage: F (2) * (x^2 + 2*x + 4) In my case, I did not predefined the polynomial ring. Hmmmthis probably means that in my case, the '2' is viewed as a unit, not a factor, and 'f' is a rational polynomial, not an integer one. In fact, type()' gives class 'sage.rings.polynomial_element_generic.Polynomial_integer_dense' in your case, and class 'sage.rings.polynomial_element_generic.Polynomial_rational_dense' in mine. Timothy, this illustrates an issue in developing software: you have to know what your inputs are. Here's a case where it's unlikely that the average student, with little sophistication in the use of CAS's, will know (he can create what appears to be f\in ZZ[x], but in fact, it's in QQ[x]; and the reason it's important is kind of subtle). Justin -- Justin C. Walker, Curmudgeon-At-Large Director Institute for the Enhancement of the Director's Income Weaseling out of things is what separates us from the animals. Well, except the weasel. - Homer J Simpson --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: is_prime for polynomials over ZZ
Apparently I was incorrectly defining x as an integer, however, I did not get an error the first I tried. incorrect way: x = PolynomialRing(ZZ) correct way: g.x = PolynomialRing(ZZ) The len method works now. Thanks. On 3/26/07, Justin C. Walker [EMAIL PROTECTED] wrote: On Mar 26, 2007, at 12:24 , Timothy Clemans wrote: I just want to tell the user of my factoring apps when the quadratic that they submit is prime. I've tried is_prime, and len(factor(x^2+B*x+C)) (thinking an answer of one would mean its prime, but it does not mean that). What is the best way in SAGE right now to test a polynomial over ZZ to tell if it is irreducible over ZZ? I think is_prime() is just for integers. You should be able to infer that a polynomial is irreducible if factor () returns a value with length 1. Why don't you think that will work? There may be a few kinks in the strategy, depending on the kind of polynomial the user hands you, though. You can always verify that a quadratic polynomial over ZZ is irreducible over ZZ by doing it the hard way: compute the roots; if they are both integers, the polynomial is reducible over ZZ; else not :-}. Justin -- Justin C. Walker, Curmudgeon at Large Institute for the Absorption of Federal Funds --- My wife 'n kids 'n dogs are gone, I can't get Jesus on the phone, But Ol' Milwaukee's Best is my best friend. --- --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
[sage-support] Re: Fwd: SAGE VMWare troubles
Hi David and Jack, I've posted a new SAGE-vmware image to http://www.sagemath.org/SAGEbin/vmware/ Please give it a try (at least 7 minutes after I send this email) and let me know what happens. Basically I got rid of SAGE0-1.vmdk, which has version 6, and left the version 4 disks, which should work fine (I got them from the vmware website). -- William On 3/26/07, David Joyner [EMAIL PROTECTED] wrote: Hi Jack: Sorry for the problems. I'm forwarding your message to sage-support since I don't use windows or vmware. - David -- Forwarded message -- From: Jack Schmidt [EMAIL PROTECTED] Date: Mar 26, 2007 9:57 AM Subject: SAGE VMWare troubles To: David Joyner [EMAIL PROTECTED], [EMAIL PROTECTED] Regarding Cygwin, SAGE will continue to support Cygwin. However, with SAGE-2.4 I'm also going to release a VMware virtual machine with SAGE preinstalled. Performance of SAGE under this machine is in many cases better than with Cygwin, *especially* when using code that isn't native to SAGE -- e.g., when using GAP via SAGE the experience is vastly better via the VMware machine, since forks and pseudo tty's work vastly better under Linux than in Windows. Also, the VMware machine will come with exactly the right optimized numerical libraries preinstalled, etc. I tried the new VMWare download for sage 2.4 on Windows XP. I downloaded the VMWare player and the two zip files from http://modular.math.washington.edu/sage/SAGEbin/vmware/sage-2.4/ extracted both, copied SAGE0-1.vmdk into sage-vmware-appliance\sage-vmware-appliance and double clicked on sage.vmx I got the error message: One or more of the disks used by this virtual machine was created by an unsupported version of vmware player. To power on or upgrade the virtual machine, either remove the unsupported disk(s) or use a version of VMWare player that supports this version of disks. Below is a list of the disks and their reported versions. Version 6 SAGE0-1.vmdk Version 4 Ubuntu.vmdk Version 4 swap.vmdk Removing these disks of course only changes the error message to: File not found: SAGE0-1.vmdk This file is required to power on this virtual machine. Use VMWare Workstation to repair this virtual machine. The readme.txt file for VMWare player says to use the help menu inside the product. Opening VMWare player gives a modal dialog box forcing me to find a valid vmware configuration file. There not being any, I cannot open the help menu. -- William Stein Associate Professor of Mathematics University of Washington http://www.williamstein.org --~--~-~--~~~---~--~~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~--~~~~--~~--~--~---
