Wrigs8179 Wrigs8179
  • 18-02-2020
  • Mathematics
contestada

How many ways can we pick three distinct integers from {1, 2, ..., 15} such that their sum is divisible by 3?

Respuesta :

Mabeh Mabeh
  • 18-02-2020

Answer:

Clearly from 1 to 15 we can only have the sum 6,9,12 and 15 to be divisible by 3.

Now meaning we have 4! ( 4 factorial) which implies 4x3x2x1= 24 .

We have 24 ways to pick distinct integers that are divisible by 3.

Step-by-step explanation:

The first thing you need to do is to look for numbers that are divisible by 3. Then you take its factorial

Answer Link

Otras preguntas

what is answer to this question
When x = 3, y = 16 and when x = 6, y = 8. Which inverse variation equation can be used to model this function
The Declaration of Independence On July 4, 1776 the thirteen colonies of the United States signed the following document in order to establish a new relationshi
Which of these tend to force the price of an item downward??
What are the three types of mixtures?
which of the following is not a computer protocol? FTP, SMTP, ISP, or TCP
which word best describes the role of a historian
Describe three steps a bill must take before it becomes a law
between what two integers 111 lie
What happens when magma rises towards the surface?