(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Prove by induction that if set S = {x1,x2...,xn} is a set of n elements non of which are in a set A, then AuS is denumerable

2. Relevant equations

im not sure what to put here

3. The attempt at a solution

what does this mean

denumerable? and how do i start this

I know that i can say AuX when x is an element not in A

but what do i do beyond this

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Denumerable sets

**Physics Forums | Science Articles, Homework Help, Discussion**