1. Still incorrect.
1 bit: 2 ways.
2 bits: 4 ways.
3 bits: 8 ways.
4 bits: 16 ways.

What is this pattern?

2. heheh
it look like a Geometric Progression
let me try Sum for S10..hope i will get the ans

3. Yes... but the codes of the shop consist of 10 bits only, no less.

4. Originally Posted by Ackbeet
Still incorrect.
1 bit: 2 ways.
2 bits: 4 ways.
3 bits: 8 ways.
4 bits: 16 ways.

What is this pattern?
let a =2 ways r=4/2=2

So, S10= 2[2^10 - 1] per 2-1 = 2046

huwa still not same

5. Closer, but still no cigar. What am I doing to each number in this sequence: 2, 4, 8, 16, 32, ... to get the next number? Furthermore, which number in that sequence do you need?

6. Originally Posted by nikk
let a =2 ways r=4/2=2

So, S10= 2[2^10 - 1] per 2-1 = 2046

huwa still not same
Ok, I'll say it another way.

You are finding for:
1 bit
2 bits
3 bits
etc

but how many ways are there for 10 bits?

7. Originally Posted by Ackbeet
Closer, but still no cigar. What am I doing to each number in this sequence: 2, 4, 8, 16, 32, ... to get the next number? Furthermore, which number in that sequence do you need?
the sequense is when n=10. i'm i right prof? hehehe

8. Yes, you're interested in the 10th term of that sequence. What is that number?

9. Originally Posted by Ackbeet
Yes, you're interested in the 10th term of that sequence. What is that number?
ehheh i get it now...it is T10 = 1024..hahahha
i get it.

why not we use Sn, it consider as Sn to get the sum of T1 to T10. it more logic??? it my thinking..heheh

10. Because if I have 2 ways of doing one thing, and 3 ways of doing another, I don't have 5 ways of doing them both, I have 6. Think of it this way: for each way of doing the first thing, I have 3 ways of doing the second. Therefore, there must be 6 ways to do them both.

11. Originally Posted by nikk
ehheh i get it now...it is T10 = 1024..hahahha
i get it.

why not we use Sn, it consider as Sn to get the sum of T1 to T10. it more logic??? it my thinking..heheh
Because the code of the shop consists of 10 digits. Let's look at it another way.

_ _ _ _ _ _ _ _ _ _

Ok, I put 10 blanks. In each blank, you can put 2 digits, that is either 0 or 1.

In the first blank, you have two choices, in the second, again two choices, in the third, again two choices, etc.

This gives: $2\times2\times2\times2\times2\times2\times2\times2 \times2\times2 = 2^{10} = 1024$

12. Originally Posted by Unknown008
Because the code of the shop consists of 10 digits. Let's look at it another way.

_ _ _ _ _ _ _ _ _ _

Ok, I put 10 blanks. In each blank, you can put 2 digits, that is either 0 or 1.

In the first blank, you have two choices, in the second, again two choices, in the third, again two choices, etc.

This gives: $2\times2\times2\times2\times2\times2\times2\times2 \times2\times2 = 2^{10} = 1024$
it mean this is a simple permutation. using a box method.but i also like to use Ackbeet method also. it new and relate to another chapter i.e progression. thank for both of you man

Page 2 of 2 First 12