User:RandomUndergrad

Lacklustre Bio
No longer a final year Math student at CUHK.

Thousand Separators
The program I attempted to use to finish Pandigital Numbers Divisible by All Integers up to 18, but alas it is off by a factor of $19$.

Since I am not putting $>600 \times 3$ lines of verification in the page, here is the program whose skeleton can be extracted for similar programs in the future.


 * 1) include 

int main {   long int i,j; int count = 0; for (i=6; i<43; i++) {       j=232792560; j*=i; if (i%5!=0) {           count++; printf("\n", j%1000); }   }    printf("%d",count); }

Its predecessor has been used to find the largest and smallest pandigital squares.

Primes Expressible as $x^2+ny^2$
I'll put this here for (my) future reference:

int main{int n,x,y;for(n=1;n<11;n++)for(x=1;x<33;x++)for(y=1;y<33;y++)if(x*x+y*y*n==1009)printf("1009=%d^2+%dx%d^2\n",x,n,y);}
 * 1) include 

also


 * 1129=20^2+1x27^2
 * 1129=27^2+1x20^2
 * 1129=29^2+2x12^2
 * 1129=19^2+3x16^2
 * 1129=27^2+4x10^2
 * 1129=2^2+5x15^2
 * 1129=23^2+6x10^2
 * 1129=11^2+7x12^2
 * 1129=29^2+8x6^2
 * 1129=20^2+9x9^2
 * 1129=33^2+10x2^2

Sum of Product of $k$ Consecutive Integers
In particular, when $m = 1$, the theorem takes a nice form:

For $l = 0$, $\ds \sum_{i \mathop = 1} ^ n i = \dfrac {n (n + 1)} 2$ which is Closed Form for Triangular Numbers

For $l = 1$, $\ds \sum_{i \mathop = 1} ^ n i (i + 1) = \dfrac {n (n + 1) (n + 2)} 3$ which is Sum of Sequence of Products of Consecutive Integers

Credit: The relationship between binomial coefficients and products of consecutive integers was noticed by my friend Oscar, whose observation allowed for a intuitive view to the validity of the equation.

My original proof for the cases $m = 0$ was an induction on $n$ with a fixed $l$.

For $n = 1$, $RHS = \dfrac {1 (2) \cdots (1 + l + 1)} {l + 2} = (l + 1) ! = LHS$

For the induction step, assume $\ds \sum_{i \mathop = 1} ^ m i (i + 1) \cdots (i + l) = \dfrac {m (m + 1) \cdots (m + l + 1)} {l + 2}$.

Then

The general theorem results from subtraction.

Solution to Problem $1290$, mmmaa
See


 * For positive integers $n$ and $r$, find a closed form expression for $\ds \sum_{r \mathop = 1}^k r \binom {n + r - 1} r$.

One may, of course, avoid the use of this theorem by proceeding from the third step as follows:

In their notation $\ds \sequence {n \atop r}:= \binom {n + r - 1} r$, we will have:
 * $\ds \sum_{r \mathop = 1}^k r \sequence {n \atop r} = n \sequence {k \atop {n + 1} }$

I wish to generalize this result to arithmetic progressions at some point.

Potential Corollary and its Generalisation
We have:

Can't find related result - a visual proof was given by RBN in PWW.