>>> def pascal(n): … line = [1] … for k in range(n): … line.append(line[k] * (n-k) / (k+1)) … return line … >>> pascal(9) [1, 9, 36, 84, 126, 126, 84, 36, 9, 1] This uses the following identity: C(n,k+1) = C(n,k) * (n-k) / (k+1) So you can start with C(n,0) = 1 and … Read more
OK code review: import math # pascals_tri_formula = [] # don’t collect in a global variable. def combination(n, r): # correct calculation of combinations, n choose k return int((math.factorial(n)) / ((math.factorial(r)) * math.factorial(n – r))) def for_test(x, y): # don’t see where this is being used… for y in range(x): return combination(x, y) def pascals_triangle(rows): … Read more
Here I had modified your code, it prints wonderfully for ROW size till 13, because of the limitation of my console window: import java.util.*; public class Pascal { public static final int ROW = 12; private static int max = 0; public static void main(String[] args) { int[][] pascal = new int[ROW + 1][]; pascal[1] … Read more
Factorials get really big really fast (scroll down a little to see the list). Even a 64-bit number is only good up to 20!. So you have to do a little preprocessing before you start multiplying. The general idea is to factor the numerator and the denominator, and remove all of the common factors. Since … Read more