# Math Help - prove that if n is divisible by 11 and n' is obtained from n by inserting two identic

1. ## prove that if n is divisible by 11 and n' is obtained from n by inserting two identic

prove that if n is divisible by 11 and n' is obtained from n by inserting two identical digits between consecutive digits of n, then n' is also divisible by 11. For example, since 407 is divisible by 11, the following are also divisible by 11: 22407, 43307, 40997 and 40722

Let $n=\sum_{i=0}^md_i10^i$. Use the fact that $10\equiv-1\,(\text{mod}\,\,11)$ and compute mod 11.
{"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": 2, "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.891189455986023, "perplexity": 235.21889107340363}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "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-2015-27/segments/1435375096738.25/warc/CC-MAIN-20150627031816-00265-ip-10-179-60-89.ec2.internal.warc.gz"}