math.answers.com/math-and-arithmetic/An_example_of_a_proof

Preview meta tags from the math.answers.com website.

Linked Hostnames

8

Thumbnail

Search Engine Appearance

Google

https://math.answers.com/math-and-arithmetic/An_example_of_a_proof

An example of a proof? - Answers

Are there infinitely many multiples of 11 with an odd digit sum?Yes.One proof [I'm not sure that this is the simplest proof for this, but it is a proof]:--------------------------Note that 209 is divisible by 11 and has an odd digit sum (11). Now consider the number 11000*10i+209. Because 11000 is divisible by 11 and 209 is divisible by 11,11000*10i+209 is divisible by 11 for all whole number values of i (of which there are infinitely many).Further, the digit sum for 11000*10i+209 is odd for all whole number values of i because the hundreds, tens and ones places will always be 2, 0, and 9 respectively, and the other digits will be either all zeros (for i=0) or two ones followed by zeros, down to and including the thousands places. Thus, the digit sum of 11000*10i+209 is 11 for i=0 and 13 for all other whole numbers i.Thus, we have have the following set of numbers (of which there are infinitely many) which are multiples of 11 and which have an odd digit sum:20911209110209110020911000209110000209...----------------[Note there are other multiples of 11 that have an odd digit sum (e.g., 319, 11319, 110319, ...).]___________________________________________________________Late addition:Here is the simplest proof:Prove that x+2=3 implies that x=1.proof:FIRST, assume the hypothesis, that x+2=3. What we try to do is reach the conclusion (x=1) using any means possible. I have some algebra skills, so I'll subtract 2 from both sides, which leads me to x = 1.QED.



Bing

An example of a proof? - Answers

https://math.answers.com/math-and-arithmetic/An_example_of_a_proof

Are there infinitely many multiples of 11 with an odd digit sum?Yes.One proof [I'm not sure that this is the simplest proof for this, but it is a proof]:--------------------------Note that 209 is divisible by 11 and has an odd digit sum (11). Now consider the number 11000*10i+209. Because 11000 is divisible by 11 and 209 is divisible by 11,11000*10i+209 is divisible by 11 for all whole number values of i (of which there are infinitely many).Further, the digit sum for 11000*10i+209 is odd for all whole number values of i because the hundreds, tens and ones places will always be 2, 0, and 9 respectively, and the other digits will be either all zeros (for i=0) or two ones followed by zeros, down to and including the thousands places. Thus, the digit sum of 11000*10i+209 is 11 for i=0 and 13 for all other whole numbers i.Thus, we have have the following set of numbers (of which there are infinitely many) which are multiples of 11 and which have an odd digit sum:20911209110209110020911000209110000209...----------------[Note there are other multiples of 11 that have an odd digit sum (e.g., 319, 11319, 110319, ...).]___________________________________________________________Late addition:Here is the simplest proof:Prove that x+2=3 implies that x=1.proof:FIRST, assume the hypothesis, that x+2=3. What we try to do is reach the conclusion (x=1) using any means possible. I have some algebra skills, so I'll subtract 2 from both sides, which leads me to x = 1.QED.



DuckDuckGo

https://math.answers.com/math-and-arithmetic/An_example_of_a_proof

An example of a proof? - Answers

Are there infinitely many multiples of 11 with an odd digit sum?Yes.One proof [I'm not sure that this is the simplest proof for this, but it is a proof]:--------------------------Note that 209 is divisible by 11 and has an odd digit sum (11). Now consider the number 11000*10i+209. Because 11000 is divisible by 11 and 209 is divisible by 11,11000*10i+209 is divisible by 11 for all whole number values of i (of which there are infinitely many).Further, the digit sum for 11000*10i+209 is odd for all whole number values of i because the hundreds, tens and ones places will always be 2, 0, and 9 respectively, and the other digits will be either all zeros (for i=0) or two ones followed by zeros, down to and including the thousands places. Thus, the digit sum of 11000*10i+209 is 11 for i=0 and 13 for all other whole numbers i.Thus, we have have the following set of numbers (of which there are infinitely many) which are multiples of 11 and which have an odd digit sum:20911209110209110020911000209110000209...----------------[Note there are other multiples of 11 that have an odd digit sum (e.g., 319, 11319, 110319, ...).]___________________________________________________________Late addition:Here is the simplest proof:Prove that x+2=3 implies that x=1.proof:FIRST, assume the hypothesis, that x+2=3. What we try to do is reach the conclusion (x=1) using any means possible. I have some algebra skills, so I'll subtract 2 from both sides, which leads me to x = 1.QED.

  • General Meta Tags

    22
    • title
      An example of a proof? - Answers
    • charset
      utf-8
    • Content-Type
      text/html; charset=utf-8
    • viewport
      minimum-scale=1, initial-scale=1, width=device-width, shrink-to-fit=no
    • X-UA-Compatible
      IE=edge,chrome=1
  • Open Graph Meta Tags

    7
    • og:image
      https://st.answers.com/html_test_assets/Answers_Blue.jpeg
    • og:image:width
      900
    • og:image:height
      900
    • og:site_name
      Answers
    • og:description
      Are there infinitely many multiples of 11 with an odd digit sum?Yes.One proof [I'm not sure that this is the simplest proof for this, but it is a proof]:--------------------------Note that 209 is divisible by 11 and has an odd digit sum (11). Now consider the number 11000*10i+209. Because 11000 is divisible by 11 and 209 is divisible by 11,11000*10i+209 is divisible by 11 for all whole number values of i (of which there are infinitely many).Further, the digit sum for 11000*10i+209 is odd for all whole number values of i because the hundreds, tens and ones places will always be 2, 0, and 9 respectively, and the other digits will be either all zeros (for i=0) or two ones followed by zeros, down to and including the thousands places. Thus, the digit sum of 11000*10i+209 is 11 for i=0 and 13 for all other whole numbers i.Thus, we have have the following set of numbers (of which there are infinitely many) which are multiples of 11 and which have an odd digit sum:20911209110209110020911000209110000209...----------------[Note there are other multiples of 11 that have an odd digit sum (e.g., 319, 11319, 110319, ...).]___________________________________________________________Late addition:Here is the simplest proof:Prove that x+2=3 implies that x=1.proof:FIRST, assume the hypothesis, that x+2=3. What we try to do is reach the conclusion (x=1) using any means possible. I have some algebra skills, so I'll subtract 2 from both sides, which leads me to x = 1.QED.
  • Twitter Meta Tags

    1
    • twitter:card
      summary_large_image
  • Link Tags

    16
    • alternate
      https://www.answers.com/feed.rss
    • apple-touch-icon
      /icons/180x180.png
    • canonical
      https://math.answers.com/math-and-arithmetic/An_example_of_a_proof
    • icon
      /favicon.svg
    • icon
      /icons/16x16.png

Links

58