1999 Mathcounts National Sprint Round Solutions(1999年Mathcounts国家Sprint圆的解决方案).pdfVIP

  • 40
  • 0
  • 约2.38万字
  • 约 10页
  • 2017-08-11 发布于浙江
  • 举报

1999 Mathcounts National Sprint Round Solutions(1999年Mathcounts国家Sprint圆的解决方案).pdf

1999 Mathcounts National Sprint Round Solutions(1999年Mathcounts国家Sprint圆的解决方案)

1999 Mathcounts National Sprint Round Solutions 5 1. Solution: . 12 A 3-digit number is divisible by 3 if the sum of its digits is divisible by 3. The first digit cannot be 0, so we have the following four groups of 3 such that the three different numbers sum to a multiple of 3: 2, 4, 0; 8, 4, 0; 6, 4, 2; 8, 6, 4. These four cases produce 4, 4, 6, and 6 numbers respectively. There are 4 + 4 + 6 + 6 = 20 such number

文档评论(0)

1亿VIP精品文档

相关文档