## Search found 2 matches

- Tue May 05, 2015 12:08 pm
- Forum: Number Theory
- Topic: Brocard's problem has finite solution(?)
- Replies:
**1** - Views:
**7941**

### Brocard's problem has finite solution(?)

Brocard's problem is a problem in mathematics that asks to find integer values of n for which $$x^{2}-1=n!$$ http://en.wikipedia.org/wiki/Brocard%27s_problem. According to Brocard's problem $$x^{2}-1=n!=5!*(5+1)(5+2)...(5+s)$$ here,$(5+1)(5+2)...(5+s)=\mathcal{O}(5^{r}),5!=k$. So, $$x^{2}-1=k *\math...

- Tue May 05, 2015 12:04 pm
- Forum: Combinatorics
- Topic: Counting problem of combinations of matrix.
- Replies:
**0** - Views:
**8192**

### Counting problem of combinations of matrix.

Given, a symmetric $n*n$ matrix $G$ with 0,1 entries. Each row of has same number of 1. $G$ is arranged in a certain order using a rule. The rule is described below- $G$ is partitioned in to two sub matrices based on the adjacency of $n$ th column/row(column=row since it is a symmetric matrix). e.g....