Understanding C(n,1) in Discrete Math: Solving the Mystery of C(n,1) = 1

  • Context: High School 
  • Thread starter Thread starter abbey gamble
  • Start date Start date
  • Tags Tags
    Discrete Discrete math
Click For Summary
SUMMARY

The discussion clarifies the calculation of C(n,1) in discrete mathematics, confirming that C(n,1) represents "n choose 1." The formula for combinations, C(n,k) = n! / (k!(n-k)!), is applied to derive that C(n,1) equals n. This is established by substituting k with 1, leading to the conclusion that C(n,1) = n. The discussion emphasizes the straightforward nature of this calculation.

PREREQUISITES
  • Understanding of factorial notation (n!)
  • Familiarity with combinations and the binomial coefficient
  • Basic knowledge of discrete mathematics concepts
  • Ability to manipulate algebraic expressions
NEXT STEPS
  • Study the properties of combinations and permutations in discrete mathematics
  • Learn about the binomial theorem and its applications
  • Explore advanced topics in combinatorial mathematics
  • Practice solving problems involving C(n,k) for various values of n and k
USEFUL FOR

Students of discrete mathematics, educators teaching combinatorial concepts, and anyone looking to strengthen their understanding of combinations and factorials.

abbey gamble
Messages
1
Reaction score
0
C(n,1) ...

I know that C(n,0) =1

But have no clue how to figure out C(n,1) :cry:
 
Mathematics news on Phys.org
By C(n,1) you mean n choose 1?

Do you know the definition of C(n,k)?
 
[tex]C(n,k) = \frac{n!}{k!\left(n-k\right)!}[/tex]
just use this to calculate C(n,1)
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K