# Math Help - Using Recursion Equations

1. ## Using Recursion Equations

Can someone help me on this problem?

How many vectors (x1,x2......xk) are there for which each xi is a positive
integer such that 1<= xi<=n and x1<x2<.......<xk?

2. If $k=n$, the answer is 1: $(1,2,...,n)$
If $k>n$, the answer is 0.
If $k, we're actually looking at how many k-lengthed increasing sequences there are with entries in $\{1,2,...,n\}$
You should note that for any $k$ elements that we choose, there may only be one such sequence. Also, you can choose any $k$ elements and then simply set them in order. This gives us that there are $\binom{n}{k}$ options.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9872437715530396, "perplexity": 1785.3868826654564}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-23/segments/1405997883905.99/warc/CC-MAIN-20140722025803-00144-ip-10-33-131-23.ec2.internal.warc.gz"}