First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
Mellie's profile - overview
overview
network
karma
followed questions
activity
1
karma
follow
New User
member since
2015-07-23 02:25:41 +0200
last seen
2015-07-23 02:34:31 +0200
todays unused votes
30
votes left
4
Questions
17
views
no
answers
no
votes
2015-07-23 02:31:06 +0200
Mellie
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. [closed]
21
views
no
answers
no
votes
2015-07-23 02:32:00 +0200
Mellie
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)$. [closed]
15
views
no
answers
no
votes
2015-07-23 02:30:25 +0200
Mellie
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. [closed]
14
views
no
answers
no
votes
2015-07-23 02:27:31 +0200
Mellie
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. [closed]
modulo
1
Answer
0
Find median of [2, 5, 2, 6, 7, 3, 7, 5, 7, 0, 6, 10]
0
Votes
0
0
2
Tags
modulo
× 1
median
× 1
1
Badge
●
Editor
×
1
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.
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.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how