Number of functions from one set to another

  • Thread starter Thread starter parelem
  • Start date Start date
  • Tags Tags
    Functions Set
Click For Summary
SUMMARY

The number of functions from the set {1,...,n} to the set {0,1} is definitively 2n. Each element k in the set {1,...,n} can be mapped to either 0 or 1, resulting in two choices per element. Since there are n elements, the total number of functions is calculated as 2n. This conclusion can be formally proven using combinatorial principles.

PREREQUISITES
  • Understanding of basic set theory
  • Familiarity with functions and mappings
  • Knowledge of combinatorial principles
  • Ability to construct formal mathematical proofs
NEXT STEPS
  • Study combinatorial proofs in mathematics
  • Learn about functions and their properties in set theory
  • Explore the concept of binary functions and their applications
  • Investigate advanced topics in discrete mathematics
USEFUL FOR

Students in mathematics, educators teaching set theory, and anyone interested in combinatorial mathematics and function analysis.

parelem
Messages
1
Reaction score
0

Homework Statement


How many functions are there from {1,...,n} to {0,1}? and prove.


The Attempt at a Solution


For any k in {1,...,n} we can map k to either 0 or 1. So for any k there are two possible images. Since there are n kinds of k (from 1 to n) then there are 2^n possible functions


I'm not sure how to formally prove this, or what kind of proof to use at least.
 
Physics news on Phys.org
I would call that a proof. How formal do you want to be?
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
Replies
1
Views
2K
Replies
2
Views
1K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
1K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
17
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K