⚡ Build the skills to land top-paying quant jobs. Offer ends in 25d 09h 52m 30s25 days 9 hours 52 minutes 30 seconds.
Problems
Resources
Jobs
New!
Games
Community
Newsletter
YouTube
Pricing
00:00:00
Let X0,X1,…,X10X_0, X_1, \dots, X_{10}X0,X1,…,X10 be integers with X0=0X_0 = 0X0=0 and X10=4X_{10} = 4X10=4, such that ∣Xi+1−Xi∣=1|X_{i+1} - X_i| = 1∣Xi+1−Xi∣=1 for every i=0,…,9i = 0, \dots, 9i=0,…,9.
How many different sequences (X0,…,X10)(X_0, \dots, X_{10})(X0,…,X10) are there?
Enter an integer or an expression that evaluates to one.
Related Problems