Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2022-04-23 13:35:30 +0200 | received badge | ● Popular Question (source) |
| 2022-04-23 13:35:30 +0200 | received badge | ● Notable Question (source) |
| 2017-03-07 23:40:20 +0200 | received badge | ● Famous Question (source) |
| 2015-12-22 00:23:43 +0200 | received badge | ● Taxonomist |
| 2013-09-11 12:41:14 +0200 | received badge | ● Famous Question (source) |
| 2012-11-06 15:56:15 +0200 | received badge | ● Notable Question (source) |
| 2012-09-03 23:25:43 +0200 | received badge | ● Notable Question (source) |
| 2012-02-15 00:07:32 +0200 | received badge | ● Popular Question (source) |
| 2012-01-03 11:22:14 +0200 | received badge | ● Popular Question (source) |
| 2011-09-04 05:56:41 +0200 | asked a question | 4-Digit Rounding Arithmetic:System of Equations I am given this system of equations: 1.130x - 6.990y = 14.20 1.013x - 6.099y = 14.22 In sage I input sage: y = var("y") sage: solve ([1.130x + 6.990y == 14.20, ... etc ], x,y ) it spits out 4264/63, 1684/189 for x,y I now input sage: round((4264.0/63.0), 4) --> for x and same thing for y, using 1684.0 / 189.0. Giving me 8.9101, yet this answer seems to be wrong. My question is where can I found out how to do 4 digit rounding arithmetic using sage? or Am I doing something wrong with the code. |
| 2010-12-10 01:22:12 +0200 | received badge | ● Nice Question (source) |
| 2010-12-09 20:07:36 +0200 | commented answer | Abstract Algebra Question coming in clutch kcrisman! Ty man. I think I figured it out now! |
| 2010-12-08 01:01:39 +0200 | asked a question | Abstract Algrebra My teacher gave us an extra credit problem using sage, I am having soo much trouble just trying to get started and was hoping for any sort of help possible. Heres the question: An element a in Z mod n is a square if there is some b element of Z mod n such that a^2 = b. Find the number of squares in Z mod p^(n). Would the code look something like this: print modulo(Integer(Z): .... This is my first time ever using a computer program. Sage seems very powerful and I expect to use it more during my school break, but if anyone can help me now, I would greatly appreciate it!!!!! |
| 2010-12-08 01:00:40 +0200 | asked a question | Abstract Algebra Question My teacher gave us an extra credit problem using sage, I am having soo much trouble just trying to get started and was hoping for any sort of help possible. Heres the question: An element a in Z mod n is a square if there is some b element of Z mod n such that a^2 = b. Find the number of squares in Z mod p^(n). Would the code look something like this: print modulo(Integer(Z): .... This is my first time ever using a computer program. Sage seems very powerful and I expect to use it more during my school break, but if anyone can help me now, I would greatly appreciate it!!!!! ` |
| 2010-11-22 02:23:07 +0200 | received badge | ● Supporter |
| 2010-11-16 13:33:11 +0200 | commented answer | Modular Arithmetic Question using Sage I think I am going down the right path. Any input would be nice. |
| 2010-11-16 13:26:38 +0200 | commented answer | Modular Arithmetic Question using Sage Jason and Kcrisman, thank you for your reply, help and suggestions. Here is what I have been doing: sage: for n in [1..100]: ....: print mod(factorial(n-1), n) ....: 0 1 2 2 4 0 6 0 0 0 10 0 12 0 0 0 16 0 18 0 0 0 22 0 0 0 0 0 28 0 30 0 0 0 0 0 36 0 0 0 40 0 42 0 0 0 46 0 0 0 0 0 52 0 0 0 0 0 58 0 60 0 0 0 0 0 66 0 0 0 70 0 72 0 0 0 0 0 78 0 0 0 82 0 0 0 0 0 88 0 0 0 0 0 0 0 96 0 0 0 |
| 2010-11-10 17:54:11 +0200 | received badge | ● Student (source) |
| 2010-11-09 22:24:56 +0200 | received badge | ● Editor (source) |
| 2010-11-09 15:58:58 +0200 | asked a question | Modular Arithmetic Question using Sage Hey forumgoers, just have a question using Sage. I am having trouble with a few questions asked to me, heres the questions, how do can you compute (n-1)! mod n for n < 100. Find a formula relating the number of idempotents in Zsubn with the number of distinct prime factors that n has. An element a in Z(subn) is a square if there is some b element of Z(subn) such that a^2=b. Find the number of squares in Z(sub p^n). |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.