Its too easy

Number Theory Level 1

Let A be the the set of numbers that are not divisible by any integer. then n(A)=?


The answer is 0.

View wiki
Sudoku Subbu by sudoku subbu , 19, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Sudoku Subbu
Jan 22, 2015

a number does not exists such that it not divisible by any integer hmm.. too simple

2 Helpful 0 Interesting 0 Brilliant 1 Confused

More rigidly, for every integer at least one integer divides it, that is itself. Hence, the set A = ϕ \phi ⇒ \Rightarrow n(A) = 0.

Venkata Karthik Bandaru - 6 years, 3 months ago
Devin Ky
Apr 30, 2015

All numbers are divisible by 1, which is an integer. Hence there are no numbers which 1 does not divide, hence n(A)=0

0 Helpful 0 Interesting 0 Brilliant 1 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...