-2
votes
2answers
96 views

Even or Odd for factorial

Moderator Note: This is a current contest question on codechef.com. Given $N$ and $M$ I need to tell whether $\left\lfloor \large\frac{N!}{M} \right\rfloor$ is even or odd.How to do this ...
0
votes
2answers
86 views

Trailing zeroes in factorials: are there any excluded values divisible by 5 other than $5$ and $30$?

I've discovered that when this algorithm for counting zeroes on the end of $n!$ is applied to some $n\in\Bbb{N}$: $$f(n)=\sum_{k=1}^{k:n/5^k\le1}\left\lfloor\frac{n}{5^k}\right\rfloor\notin\{5,30\}$$ ...
2
votes
1answer
45 views

Counting permutations, with additional restrictions

There are 10 slots and some marbles: 5 red, 3 blue, 2 green, how many ways can you fit those marbles into those slots? Those marbles fit in 10!/(5! 3! 2!) ways ...
2
votes
2answers
77 views

Inequality $C\lceil\log{n}\rceil! \geq n^k$

I've been struggling to prove there exist $C$ for $n, n_{0}, \forall k >0 \in \mathbb{R}$ such that $\forall n > n_{0}$: \begin{equation}C\lceil\log{n}\rceil! \geq n^k\end{equation} As you ...
3
votes
5answers
164 views

Can $\frac{n!}{(n-r)!r!}$ be simplified?

I'm trying to calculate in a program the number of possible unique subsets of a set of unique numbers, given the subset size, using the following formula: $\dfrac{n!}{(n-r)!r!}$ The trouble is, on ...
3
votes
2answers
414 views

What does it mean to “have a multiplicative inverse of modulo 10!”?

Here's the question: What's the smallest integer > 1 that has a multiplicative inverse modulo 10! (that is, 10 factorial)? What does that mean? I understand that: We say that x is the ...
0
votes
2answers
135 views

Prove that $n! ≥ (⌈n/2⌉)^{⌈n/2⌉}$

Prove that : $n! ≥ (⌈n/2⌉)^{⌈n/2⌉}$
3
votes
0answers
2k views

When does a Square Matrix have an LU Decomposition?

When can we split a square matrix (rows = columns) into it’s LU decomposition? The LUP (LU Decomposition with pivoting) always exists; however, a true LU decomposition does not always exist. How do ...
1
vote
0answers
129 views

Efficient factorion search in arbitrary base

A factorion in base $N$ is a natural number equal to the sum of the factorials of its digits in base $N$. So, the decimal factorions are: $1 = 1!$ $2 = 2!$ $145 = 1! + 4! + 5!$ $40585 = 4! + 0! + 5! ...
0
votes
1answer
630 views

Logarithm base 2 and factorials

I'm learning about $\log_2$ for an algorithms class and theres a problem in the book that is confusing me. It asks: Find a formula for $\log_2(n!)$ using Stirling's approximation for $n!$, for large ...