1
vote
0answers
119 views

Question about ratios and combinatorics

In this question that I posted yesterday (11/15): I am solving a programming puzzle that consists of finding all the possible ways to build a brick wall of $48$" $\times$ $10$" (width $\times$ height ...
4
votes
2answers
112 views

How many ways to reach $1$ from $n$ by doing $/13$ or $-7$?

How many ways to reach $1$ from $n$ by doing $/13$ or $-7$ ? (i.e., where $n$ is the starting value (positive integer) and $/13$ means division by $13$ and $-7$ means subtracting 7)? Let the number ...
0
votes
2answers
86 views

Counting $2010^2$-tuples

Here's a problem i invented myself, but i'm not sure about my solution. I'll show it later, so people can enjoy trying to find one: Consider the function $f:\mathbb{R}^2\to\{1,2,...,2012\}$ that ...
0
votes
1answer
109 views

Bijective functions $f(n)=f(f(n-1))=f^n(1)$

How can I find a function (or more) which satisfy $f(n)=f(f(n-1))=f^n(1)$, defined for positive integers n, such that it is a bijection between the positive integers? And which satisfy i) For every ...
4
votes
1answer
255 views

Solving (and proving) a combinatorial functional recursive equation

I have a sequence of functions $f_k(n)$ defined as follows: $f_1(n)=n^{n-2}$ $f_k(n)=\sum_{i=1}^{n-1}f_{k-1}(i)\cdot(n-i)^{n-i-2}\cdot{n-k \choose n-i-1}$ My goal is to find and prove a closed-form ...