Waste less time on Facebook — follow Brilliant.
×

Help me to find the number of ways

I found a problem while solving this -

Three friends will eat sweets. One can eat only one sweet of one type, or no sweet at all. They are allowed to choose from three different types. In how many different ways can they eat sweets?

My question is - If all of them deny to eat sweets, how many ways will be there? 0 (i.e. No way to eat sweets) or 1 (i.e. all of them deny to eat)?

Note by Raiyun Razeen
1 year, 11 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

\[ 0! = 1 \]

Pi Han Goh - 1 year, 11 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...