We derive a general technique for solving full rank linear recursive sequences. Formally, a k^{th} linear recursive sequence is defined as

Close Menu Navigation

- Leonard tells me that there is no such thing as bad press
- Subscribe
- Follow on Twitter
- Add on Facebook
- My Resume

Open Categories Menu

13 August

Posted in
Article, Math Problems

0

We derive a general technique for solving full rank linear recursive sequences. Formally, a k^{th} linear recursive sequence is defined as

12 August

Posted in
Article, Math Problems

Let a be an odd integer. Prove that and are relatively prime for all distinct positive integers n and m.

Let’s consider the *Interval Scheduling Problem*, in which we have a set of n requests ; the request corresponds to an interval of time starting at and finishing at , or request spans interval . Suppose that a subset of the requests is *compatible* if no two of them overlap in time; find the largest compatible subset of any set of requests in a reasonable number of steps.

11 August

Posted in
Article, Math Problems

Show that there are infinitely many primes of the form `4k - 1`

.

10 August

Posted in
Article, Math Problems

Suppose we define the function as the sum of the divisors of n

Express in terms of ‘s prime factorization

9 August

Posted in
Article, Math Problems

Determine the product of distinct positive integer divisors of .

9 August

Posted in
Article, Math Problems

Determine the number of **ordered pairs** of positive integers such that their least common multiple

9 August

Posted in
Article, Math Problems

Compute the probability that a randomly chosen positive divisor of is an integer multiple of