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.
| 2015-07-23 02:33:33 +0200 | answered a question | Find median of [2, 5, 2, 6, 7, 3, 7, 5, 7, 0, 6, 10] How do you guys read the answer? I don't understand this. I am new to this website. |
| 2015-07-23 02:32:00 +0200 | asked a question | The number $N$ is a multiple of 7. The base 2 representation of $N$ is \[10110101010101ABC110.\] Compute the ordered triple of digits $(A,B,C)$. The number $N$ is a multiple of 7. The base 2 representation of $N$ is [10110101010101ABC110.] Compute the ordered triple of digits $(A,B,C)$. |
| 2015-07-23 02:31:06 +0200 | asked a question | The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n + 2} = F_{n + 1} + F_n$. Find the remainder when $F_{1999}$ is divided by 5. The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n + 2} = F_{n + 1} + F_n$. Find the remainder when $F_{1999}$ is divided by 5. |
| 2015-07-23 02:30:25 +0200 | asked a question | a) Show that $n(2n + 1)(7n + 1)$ is divisible by 6 for all integers $n$. b) Find all integers $n$ such that $n(2n + 1)(7n + 1)$ is divisible by 12. a) Show that $n(2n + 1)(7n + 1)$ is divisible by 6 for all integers $n$. b) Find all integers $n$ such that $n(2n + 1)(7n + 1)$ is divisible by 12. |
| 2015-07-23 02:27:31 +0200 | received badge | ● Editor (source) |
| 2015-07-23 02:25:42 +0200 | asked a question | Find the inverse of 7 modulo 13 (expressed as a residue between 0 and the modulus) or answer 0 if the inverse does not exist. (a) Find the inverse of 7 modulo 13 (expressed as a residue between 0 and the modulus) or answer 0 if the inverse does not exist. (b) Find the inverse of 8 modulo 35 (expressed as a residue between 0 and the modulus) or answer 0 if the inverse does not exist. (C) Find the inverse of 3 modulo 100 (expressed as a residue between 0 and the modulus) or answer 0 if the inverse does not exist. (D) Find the inverse of 15 modulo 18 (expressed as a residue between 0 and the modulus) or answer 0 if the inverse does not exist. (E) Find the inverse of 42 modulo 43 (expressed as a residue between 0 and the modulus) or answer 0 if the inverse does not exist. |
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.