[algogeeks] Re: brain teaser

[Don]

We know that n+m+s+carry < 10. So n<7. We also know that either n+n+n
or o+o+o > 9 because there must be a carry to make those two columns
add to a different value.
We can start eliminating values for n.
If n is 1, o would have to be 7 to make the second row work out. But
then u and e would both be 3.
If n is 3, o must be 1, so u would also be 3.
If n is 4, o must be 1 and u must be 3, which makes n+m+s > 9.
If n=5, then e would be 5, so n can't be 5.
If n is larger than 5, there is no combination which makes n+m+s<10.
That leaves n=2.
It follows that e=6, o=4, and u=3.
m and s are interchangeable: 1 and 5.
And j is 9.

2442+1442+5442=9326

Don

On Aug 17, 1:23 pm, priya ramesh 
wrote:
>    noon
> + moon
> + soon
> = june
>
> find the values of the alphabets to satisfy this equation

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] Find next number in series 10 june

[rohit]

@nicks
42 47...
all the terms are either divisible by 7 or contain 7

On Jun 10, 3:29 pm, nicks  wrote:
> @ankur..how did you get that...explain..plz
>
> On Fri, Jun 10, 2011 at 3:11 AM, ankur aggarwal 
> wrote:
>
>
>
>
>
>
>
> > 42, 49
>
> > 2011/6/10 • » νιρυℓ « • 
>
> >> 42, 47
> >> just guessing according to the pattern.
>
> >> On Fri, Jun 10, 2011 at 1:37 PM, Lavesh Rawat 
> >> wrote:
>
> >>> *Find next number in series
> >>> * * ***
> >>> *
> >>> *
> >>> **
> >>> *What are the next two numbers in this sequence?
>
> >>> 7, 14, 17, 21, 27, 28, 35, 37, ?, ?
> >>> * *
> >>> *
>
> >>> *Update Your Answers at* : Click 
> >>> Here
>
> >>>  Solution:
> >>> Will be updated after 1 day
>
> >>> --
>
> >>>                     "Never explain yourself. Your friends don’t need it
> >>> and your enemies won’t believe it" .
>
> >>> --
> >>> You received this message because you are subscribed to the Google Groups
> >>> "Algorithm Geeks" group.
> >>> To post to this group, send email to algogeeks@googlegroups.com.
> >>> To unsubscribe from this group, send email to
> >>> algogeeks+unsubscr...@googlegroups.com.
> >>> For more options, visit this group at
> >>>http://groups.google.com/group/algogeeks?hl=en.
>
> >> --
> >> Regards,
> >> Vipul
>
> >>  --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> > :)
>
> >  --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: [brain teaser ] Find next number in series 10 june

[Kiran Kumar]

42, 47

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/NxVWAf-16GQJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: [brain teaser ] Find next number in series 10 june

[snehi jain]

42, 47

On Fri, Jun 10, 2011 at 9:57 PM, shashankreddy509 <
shashankreddy...@gmail.com> wrote:

> 42,47
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/mi5D7Az5nssJ.
>
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: [brain teaser ] Find next number in series 10 june

[shashankreddy509]

42,47

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/mi5D7Az5nssJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: [brain teaser ] Find next number in series 10 june

[Anika Jain]

42,47

On Fri, Jun 10, 2011 at 4:50 PM, abhishekriyer
wrote:

> 42,50 
>
> On Jun 10, 3:29 pm, nicks  wrote:
> > @ankur..how did you get that...explain..plz
> >
> > On Fri, Jun 10, 2011 at 3:11 AM, ankur aggarwal  >wrote:
> >
> >
> >
> >
> >
> >
> >
> > > 42, 49
> >
> > > 2011/6/10 • » νιρυℓ « • 
> >
> > >> 42, 47
> > >> just guessing according to the pattern.
> >
> > >> On Fri, Jun 10, 2011 at 1:37 PM, Lavesh Rawat  >wrote:
> >
> > >>> *Find next number in series
> > >>> * * ***
> > >>> *
> > >>> *
> > >>> **
> > >>> *What are the next two numbers in this sequence?
> >
> > >>> 7, 14, 17, 21, 27, 28, 35, 37, ?, ?
> > >>> * *
> > >>> *
> >
> > >>> *Update Your Answers at* : Click Here<
> http://dailybrainteaser.blogspot.com/2011/06/find-next-number-in-seri...>
> >
> > >>>  Solution:
> > >>> Will be updated after 1 day
> >
> > >>> --
> >
> > >>> "Never explain yourself. Your friends don’t need
> it
> > >>> and your enemies won’t believe it" .
> >
> > >>> --
> > >>> You received this message because you are subscribed to the Google
> Groups
> > >>> "Algorithm Geeks" group.
> > >>> To post to this group, send email to algogeeks@googlegroups.com.
> > >>> To unsubscribe from this group, send email to
> > >>> algogeeks+unsubscr...@googlegroups.com.
> > >>> For more options, visit this group at
> > >>>http://groups.google.com/group/algogeeks?hl=en.
> >
> > >> --
> > >> Regards,
> > >> Vipul
> >
> > >>  --
> > >> You received this message because you are subscribed to the Google
> Groups
> > >> "Algorithm Geeks" group.
> > >> To post to this group, send email to algogeeks@googlegroups.com.
> > >> To unsubscribe from this group, send email to
> > >> algogeeks+unsubscr...@googlegroups.com.
> > >> For more options, visit this group at
> > >>http://groups.google.com/group/algogeeks?hl=en.
> >
> > > --
> > > :)
> >
> > >  --
> > > You received this message because you are subscribed to the Google
> Groups
> > > "Algorithm Geeks" group.
> > > To post to this group, send email to algogeeks@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com.
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] Find next number in series 10 june

[abhishekriyer]

42,50 

On Jun 10, 3:29 pm, nicks  wrote:
> @ankur..how did you get that...explain..plz
>
> On Fri, Jun 10, 2011 at 3:11 AM, ankur aggarwal 
> wrote:
>
>
>
>
>
>
>
> > 42, 49
>
> > 2011/6/10 • » νιρυℓ « • 
>
> >> 42, 47
> >> just guessing according to the pattern.
>
> >> On Fri, Jun 10, 2011 at 1:37 PM, Lavesh Rawat 
> >> wrote:
>
> >>> *Find next number in series
> >>> * * ***
> >>> *
> >>> *
> >>> **
> >>> *What are the next two numbers in this sequence?
>
> >>> 7, 14, 17, 21, 27, 28, 35, 37, ?, ?
> >>> * *
> >>> *
>
> >>> *Update Your Answers at* : Click 
> >>> Here
>
> >>>  Solution:
> >>> Will be updated after 1 day
>
> >>> --
>
> >>>                     "Never explain yourself. Your friends don’t need it
> >>> and your enemies won’t believe it" .
>
> >>> --
> >>> You received this message because you are subscribed to the Google Groups
> >>> "Algorithm Geeks" group.
> >>> To post to this group, send email to algogeeks@googlegroups.com.
> >>> To unsubscribe from this group, send email to
> >>> algogeeks+unsubscr...@googlegroups.com.
> >>> For more options, visit this group at
> >>>http://groups.google.com/group/algogeeks?hl=en.
>
> >> --
> >> Regards,
> >> Vipul
>
> >>  --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> > :)
>
> >  --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] Mystery Puzzle Servant Wish 25 may

[Dumanshu]

assume master is someone with supernatural powers... because nothing
is specified :)
actually this puzzle dates back to some age of gods and goddesses...
Indian Mythology.

On May 25, 12:50 pm, ArPiT BhAtNaGaR 
wrote:
> master can give only monet so obviously money
>
> On Wed, May 25, 2011 at 12:48 PM, Lavesh Rawat wrote:
>
>
>
>
>
>
>
>
>
> > *Mystery Puzzle Servant Wish
> >  *
> > *
> > *
> > **
> > *Once upon a time, in the West Lake village, a servant lived with his
> > master. After service of about 30 years, his master became ill and was going
> > to die. One day, the master called his servant and asked him for a wish. It
> > could be any wish but just one. The master gave him one day to think about
> > it. The servant became very happy and went to his mother for discussion
> > about the wish. His mother was blind and she asked her son for making a wish
> > for her eye-sight to come back. Then the servant went to his wife. She
> > became very excited and asked for a son as they were childless for many
> > years. After that, the servant went to his father who wanted to be rich and
> > so he asked his son to wish for a lot of money. The next day he went to his
> > master and made one wish through which all the three (mother, father, wife)
> > got what they wanted. You have to tell what the servant asked the master
> > * *
> > *
>
> > *Update Your Answers at* : Click 
> > Here
>
> >  Solution:
> > Will be updated after 1 day
>
> > --
>
> >                     "Never explain yourself. Your friends don’t need it and
> > your enemies won’t believe it" .
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> Thanks & Regards
>
> Arpit Bhatnagar
> (Computer Engineering)
> (MNIT JAIPUR)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] Mystery Puzzle Servant Wish 25 may

[Dumanshu]

hmm... u r right.
"my mother should see my child in a very big swing made of gold and
studded with diamonds" :D

On May 25, 12:56 pm, vaibhav shukla  wrote:
> he should wish that "my mother could see his grand child playing with his
> very rich grand-father"
>
> On Wed, May 25, 2011 at 1:20 PM, ArPiT BhAtNaGaR <
>
>
>
>
>
>
>
>
>
> arpitbhatnagarm...@gmail.com> wrote:
> > master can give only monet so obviously money
>
> > On Wed, May 25, 2011 at 12:48 PM, Lavesh Rawat 
> > wrote:
>
> >> *Mystery Puzzle Servant Wish
> >> * * ***
> >> *
> >> *
> >> **
> >> *Once upon a time, in the West Lake village, a servant lived with his
> >> master. After service of about 30 years, his master became ill and was 
> >> going
> >> to die. One day, the master called his servant and asked him for a wish. It
> >> could be any wish but just one. The master gave him one day to think about
> >> it. The servant became very happy and went to his mother for discussion
> >> about the wish. His mother was blind and she asked her son for making a 
> >> wish
> >> for her eye-sight to come back. Then the servant went to his wife. She
> >> became very excited and asked for a son as they were childless for many
> >> years. After that, the servant went to his father who wanted to be rich and
> >> so he asked his son to wish for a lot of money. The next day he went to his
> >> master and made one wish through which all the three (mother, father, wife)
> >> got what they wanted. You have to tell what the servant asked the master
> >> * *
> >> *
>
> >> *Update Your Answers at* : Click 
> >> Here
>
> >>  Solution:
> >> Will be updated after 1 day
>
> >> --
>
> >>                     "Never explain yourself. Your friends don’t need it
> >> and your enemies won’t believe it" .
>
> >> --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> > Thanks & Regards
>
> > Arpit Bhatnagar
> > (Computer Engineering)
> > (MNIT JAIPUR)
>
> >  --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
>   best wishes!!
> Vaibhav Shukla
>     DU-MCA

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: BRAIN TEASER MATH SYMBOL 5 may

[Saravanan T]

using + symbol

888+88+8+8+8 = 1000
Seems to be a simple puzzle :-)

~ Saran

On Thu, May 5, 2011 at 2:19 PM, abhishekriyer wrote:

> (88) + (888) + 8 + 8 + 8 = 1000
>
> On May 5, 12:33 pm, Lavesh Rawat  wrote:
> >  *BRAIN TEASER MATH SYMBOL
> >  *
> > *
> > *
> > **
> > *Make 1000 using eight 8's. You can only use one mathamatical symbol
> > *
> >
> > *Update Your Answers at* : Click
> > Here<
> http://dailybrainteaser.blogspot.com/2011/05/brain-teaser-math-symbol...>
> >
> > Solution:
> > Will be updated after 1 day
> >
> > --
> >
> > "Never explain yourself. Your friends don’t need it
> and
> > your enemies won’t believe it" .
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: BRAIN TEASER MATH SYMBOL 5 may

[abhishekriyer]

(88) + (888) + 8 + 8 + 8 = 1000

On May 5, 12:33 pm, Lavesh Rawat  wrote:
>  *BRAIN TEASER MATH SYMBOL
>  *
> *
> *
> **
> *Make 1000 using eight 8's. You can only use one mathamatical symbol
> *
>
> *Update Your Answers at* : Click
> Here
>
> Solution:
> Will be updated after 1 day
>
> --
>
>                     "Never explain yourself. Your friends don’t need it and
> your enemies won’t believe it" .

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] TRICK BRAIN TEASER 2 May

[RAghu]

silly but nice one

On May 2, 10:22 pm, neha lawaria  wrote:
> F
>
> On Mon, May 2, 2011 at 1:17 PM, Lavesh Rawat  wrote:
> > * TRICK BRAIN TEASER
>
> >  S E Q U E N C _
> > What letter can you place on the line, other than E, to complete this
> > sequence?
>
> > *
> > *Update Your Answers at* : Click 
> > Here
>
> > Solution:
> > Will be updated after 1 day
>
> > --
>
> >                     "Never explain yourself. Your friends don’t need it and
> > your enemies won’t believe it" .
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser] Sequence Puzzle 13april

[KK]

Dont worry got it!!!

On Apr 13, 2:57 pm, vaibhav shukla  wrote:
> On Wed, Apr 13, 2011 at 1:02 PM, Lavesh Rawat wrote:
>
> > * Sequence Puzzle *
> > *
> > *
> > *The below is a number puzzle. It should be read left to right, top to
> > bottom.
> > Question 1 What is the next two rows of numbers.
> > Question 2 How was this reached.
> > 1 1
> > 2 1
> > 1 2 1 1
> > 1 1 1 2 2 1*
>
> next two rows:
>     *3 1 2 2 1 1
>     1 3 1 1 2 2 2 1
>
> *
>
>
>
>
>
>
>
>
>
> > 
> > *Update Your Answers at* : Click 
> > Here
>
> > Solution:
> > Will be updated after 1 day
>
> > --
>
> >                     "Never explain yourself. Your friends don’t need it and
> > your enemies won’t believe it" .
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
>   best wishes!!
> Vaibhav Shukla
>     DU-MCA

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser] Sequence Puzzle 13april

[KK]

@vaibhav shukla:
3 1 2 2 1 1 is ok
but how 1 3 1 1 2 2 2 1 came
Thanks

On Apr 13, 2:57 pm, vaibhav shukla  wrote:
> On Wed, Apr 13, 2011 at 1:02 PM, Lavesh Rawat wrote:
>
> > * Sequence Puzzle *
> > *
> > *
> > *The below is a number puzzle. It should be read left to right, top to
> > bottom.
> > Question 1 What is the next two rows of numbers.
> > Question 2 How was this reached.
> > 1 1
> > 2 1
> > 1 2 1 1
> > 1 1 1 2 2 1*
>
> next two rows:
>     *3 1 2 2 1 1
>     1 3 1 1 2 2 2 1
>
> *
>
>
>
>
>
>
>
>
>
> > 
> > *Update Your Answers at* : Click 
> > Here
>
> > Solution:
> > Will be updated after 1 day
>
> > --
>
> >                     "Never explain yourself. Your friends don’t need it and
> > your enemies won’t believe it" .
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
>   best wishes!!
> Vaibhav Shukla
>     DU-MCA

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] Math Prime number puzzle 15april

[xeron!x]

Any prime number greater than 3 is congruent to 1 or 5 mod 6.
a is a prime number => a % 6 == 1 or a % 6 == 5

a*a + 26 != prime for a = 2,3

for a > 3:
 if a % 6 == 1:
  (a*a)%6 == 1 and 26 % 6 = 2 => ( a*a + 26 ) % 6 = 3 => not prime
 if a % 6 == 5:
  (a*a)%6 == (a%6)*(a%6)%6 => (5*5)%6 = 1 => ( a*a + 26 ) % 6 = ( 1 +
2 ) % 6 = 3 => not prime

On Apr 15, 3:01 pm, LALIT SHARMA  wrote:
> 9+26 = 53  lolzz...
>
>
>
> On Fri, Apr 15, 2011 at 3:20 PM, hary rathor  wrote:
> >  it true because 2*2+26 =30 which is not prime number
> > 3*3+26=53 which is prime number
>
> > these both statement contradicting that given expression is not suitable
> > for all prime number
>
> > so not true
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.> To post to this group, send email 
> > toalgoge...@googlegroups.com.
> > To unsubscribe from this group, send email 
> > to>algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> Lalit Kishore Sharma,
>
> IIIT Allahabad (Amethi Capmus),
> 6th Sem.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: [brain teaser] Sequence Puzzle 13april

[sravanreddy001]

*1 1
2 1
1 2 1 1
1 1 1 2 2 1

1 1 2 1 2 2 1 1 1 1
1 1 1 2 1 2 1 1 2 1 2 1 1 2 1 1

--> is this sequence correct? 
*

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: [brain teaser] Sequence Puzzle 13april

[Akash Agrawal]

@AKS: sure!
See, first row is
1 1
We can clearly see that there are 2 ones in this row, so we read it
aloud like TWO ONE. which id our next row: 2 1

Now we read this row as: ONE TWO ONE ONE (1 2 1 1) and so on...

On 4/13/11, AKS  wrote:
> @Akash : how , can u explain a bit more clearly ??
>
> On Apr 13, 3:27 pm, Akash Agrawal  wrote:
>> next row:
>> 3 1 2 2 1 1
>>
>> just read the previous row: THREE 1 TWO 2 ONE 1
>>
>> Regards,
>> Akash Agrawalhttp://tech-queries.blogspot.com/
>>
>> On Wed, Apr 13, 2011 at 3:27 PM, vaibhav shukla
>> wrote:
>>
>>
>>
>>
>>
>>
>>
>>
>>
>> > On Wed, Apr 13, 2011 at 1:02 PM, Lavesh Rawat
>> > wrote:
>>
>> >> * Sequence Puzzle  *
>> >> *
>> >> *
>> >> *The below is a number puzzle. It should be read left to right, top to
>> >> bottom.
>> >> Question 1 What is the next two rows of numbers.
>> >> Question 2 How was this reached.
>> >> 1 1
>> >> 2 1
>> >> 1 2 1 1
>> >> 1 1 1 2 2 1*
>>
>> > next two rows:
>> >     *3 1 2 2 1 1
>> >     1 3 1 1 2 2 2 1
>>
>> > *
>>
>> >>  
>> >> *Update Your Answers at* : Click
>> >> Here
>>
>> >> Solution:
>> >> Will be updated after 1 day
>>
>> >> --
>>
>> >>                     "Never explain yourself. Your friends don’t need it
>> >> and your enemies won’t believe it" .
>>
>> >> --
>> >> You received this message because you are subscribed to the Google
>> >> Groups
>> >> "Algorithm Geeks" group.
>> >> To post to this group, send email to algogeeks@googlegroups.com.
>> >> To unsubscribe from this group, send email to
>> >> algogeeks+unsubscr...@googlegroups.com.
>> >> For more options, visit this group at
>> >>http://groups.google.com/group/algogeeks?hl=en.
>>
>> > --
>> >   best wishes!!
>> > Vaibhav Shukla
>> >     DU-MCA
>>
>> >  --
>> > You received this message because you are subscribed to the Google
>> > Groups
>> > "Algorithm Geeks" group.
>> > To post to this group, send email to algogeeks@googlegroups.com.
>> > To unsubscribe from this group, send email to
>> > algogeeks+unsubscr...@googlegroups.com.
>> > For more options, visit this group at
>> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
Regards,
Akash Agrawal
http://tech-queries.blogspot.com/

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser] Sequence Puzzle 13april

[AKS]

@Akash : how , can u explain a bit more clearly ??

On Apr 13, 3:27 pm, Akash Agrawal  wrote:
> next row:
> 3 1 2 2 1 1
>
> just read the previous row: THREE 1 TWO 2 ONE 1
>
> Regards,
> Akash Agrawalhttp://tech-queries.blogspot.com/
>
> On Wed, Apr 13, 2011 at 3:27 PM, vaibhav shukla 
> wrote:
>
>
>
>
>
>
>
>
>
> > On Wed, Apr 13, 2011 at 1:02 PM, Lavesh Rawat wrote:
>
> >> * Sequence Puzzle  *
> >> *
> >> *
> >> *The below is a number puzzle. It should be read left to right, top to
> >> bottom.
> >> Question 1 What is the next two rows of numbers.
> >> Question 2 How was this reached.
> >> 1 1
> >> 2 1
> >> 1 2 1 1
> >> 1 1 1 2 2 1*
>
> > next two rows:
> >     *3 1 2 2 1 1
> >     1 3 1 1 2 2 2 1
>
> > *
>
> >>  
> >> *Update Your Answers at* : Click 
> >> Here
>
> >> Solution:
> >> Will be updated after 1 day
>
> >> --
>
> >>                     "Never explain yourself. Your friends don’t need it
> >> and your enemies won’t believe it" .
>
> >> --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> >   best wishes!!
> > Vaibhav Shukla
> >     DU-MCA
>
> >  --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: [brain teaser ] 8april

[uttam tiwari]

ans: A is lying monkey
 B is lying human
explanation:

let A is speaking truth..den B will be a lying monkey accordingly..but
B is  saying dat A is speaking truth..dat shud b a lie..as watever B
will speak is a lie...so A cant speak truth..now...if A lies then
recprocating his sentence ..B will be a lying human..and A is a
monkey..now watever B speaks is also a lie without generating any
contradiction.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[Tushar Bindal]

That is the point I wanted to make.
they can hear what the previous person has said.

you have repeated the answer given above.

-- 
Tushar Bindal
Computer Engineering
Delhi College of Engineering
Mob: +919818442705
E-Mail : tusharbin...@jugadengg.com

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[rajul jain]

First guy is a coin toss - let's wish him good luck.
His job is to establish the parity of black hats visible to him.
He says "Black" if he sees an odd number of black hats; "Red" otherwise.
By paying attention to what has been said, each prisoner will know his hat's
color.

*Example:*
Second to speak hears "Black" and sees an even number of black hats.
He knows his hat is black [odd changed to even - must be his is black] and
says "black".

Third guy has heard "black" and "black" and sees an even number of black
hats.
He knows his hat is red [even stayed even - his hat can't be black] and says
"red".

And so on, to the front of the line.

*General algorithm:*
The first time you hear "black", say to yourself "odd".
Each time your hear "black" after that, change the parity: "even", "odd",
... etc.
When it's your turn, if the black hats you see match the running parity,
you're Red; Black otherwise.
Call out your color.

On Fri, Mar 4, 2011 at 7:51 PM, rajul jain  wrote:

>
> they only hear the answer given by prisoner
>
> On Fri, Mar 4, 2011 at 6:43 PM, rajul jain  wrote:
>
>> they can see persons in front of them.
>>
>>
>> On Fri, Mar 4, 2011 at 6:42 PM, rajul jain wrote:
>>
>>> @vipin if thay can hear then then what would be the purpose of this
>>> question
>>> then last person just sacrifice himself and just tell the color of hat of
>>> person standing in front  of him
>>> dont give this type of comments
>>> keep in mind "No communication" rule in this question
>>> On Fri, Mar 4, 2011 at 5:53 PM, Vipin Agrawal 
>>> wrote:
>>>
 If they cant hear than what the point to create strategy ?

 On Mar 4, 2:40 pm, Tushar Bindal  wrote:
 > can't they hear what the previous person has just said?

 --
 You received this message because you are subscribed to the Google
 Groups "Algorithm Geeks" group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.


>>>
>>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[rajul jain]

they only hear the answer given by prisoner
On Fri, Mar 4, 2011 at 6:43 PM, rajul jain  wrote:

> they can see persons in front of them.
>
>
> On Fri, Mar 4, 2011 at 6:42 PM, rajul jain  wrote:
>
>> @vipin if thay can hear then then what would be the purpose of this
>> question
>> then last person just sacrifice himself and just tell the color of hat of
>> person standing in front  of him
>> dont give this type of comments
>> keep in mind "No communication" rule in this question
>> On Fri, Mar 4, 2011 at 5:53 PM, Vipin Agrawal 
>> wrote:
>>
>>> If they cant hear than what the point to create strategy ?
>>>
>>> On Mar 4, 2:40 pm, Tushar Bindal  wrote:
>>> > can't they hear what the previous person has just said?
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[rajul jain]

they can see persons in front of them.

On Fri, Mar 4, 2011 at 6:42 PM, rajul jain  wrote:

> @vipin if thay can hear then then what would be the purpose of this
> question
> then last person just sacrifice himself and just tell the color of hat of
> person standing in front  of him
> dont give this type of comments
> keep in mind "No communication" rule in this question
> On Fri, Mar 4, 2011 at 5:53 PM, Vipin Agrawal wrote:
>
>> If they cant hear than what the point to create strategy ?
>>
>> On Mar 4, 2:40 pm, Tushar Bindal  wrote:
>> > can't they hear what the previous person has just said?
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[rajul jain]

@vipin if thay can hear then then what would be the purpose of this question
then last person just sacrifice himself and just tell the color of hat of
person standing in front  of him
dont give this type of comments
keep in mind "No communication" rule in this question
On Fri, Mar 4, 2011 at 5:53 PM, Vipin Agrawal wrote:

> If they cant hear than what the point to create strategy ?
>
> On Mar 4, 2:40 pm, Tushar Bindal  wrote:
> > can't they hear what the previous person has just said?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: brain teaser

[Vipin Agrawal]

If they cant hear than what the point to create strategy ?

On Mar 4, 2:40 pm, Tushar Bindal  wrote:
> can't they hear what the previous person has just said?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[Tushar Bindal]

can't they hear what the previous person has just said?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[rajul jain]

but they cannot communicate with each other (neither talking not hearing)
they just see person stand in front of him.

On Thu, Mar 3, 2011 at 11:04 PM, Dave  wrote:

> I have a way to save 19. Let each prisoner have his own private
> variable C, which he initializes to RED if he sees an odd number of
> red hats, or to BLACK if he sees an even number of red hats. The last
> man in the row announces his C. Every time someone announces the color
> RED, everyone ahead of him flips his C to the other color. In turn,
> each remaining man announces his C.
>
> Dave
>
> On Mar 3, 2:18 am, freecoder  wrote:
> > You are one of 20 prisoners on death row with the execution date set
> > for tomorrow.
> >
> > Your king is a ruthless man who likes to toy with his people's
> > miseries. He comes to your cell today and tells you:
> >
> > “I’m gonna give you prisoners a chance to go free tomorrow. You will
> > all stand in a row (queue) before the executioner and we will put a
> > hat on your head, either a red or a black one. Of course you will not
> > be able to see the color of your own hat; you will only be able to see
> > the prisoners in front of you with their hats on; you will not be
> > allowed to look back or communicate together in any way (talking,
> > touching.)
> >
> > (The prisoner in the back will be able to see the 19 prisoners in
> > front of him
> > The one in front of him will be able to see 18…)
> >
> > Starting with the last person in the row, the one who can see
> > everybody in front of him, he will be asked a simple question: WHAT IS
> > THE COLOR OF YOUR HAT?
> >
> > He will be only allowed to answer “BLACK” or “RED”. If he says
> > anything else you will ALL be executed immediately.
> >
> > If he guesses the right color of the hat on his head he is set free,
> > otherwise he is put to death. And we move on to the one in front of
> > him and ask him the same question and so on…
> >
> > Well, good luck tomorrow, HA HA HA HA HA HA!”
> >
> > Now since you all can communicate freely during the night, can you
> > find a way to guarantee the freedom of some prisoners tomorrow? How
> > many?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: brain teaser

[Dave]

I have a way to save 19. Let each prisoner have his own private
variable C, which he initializes to RED if he sees an odd number of
red hats, or to BLACK if he sees an even number of red hats. The last
man in the row announces his C. Every time someone announces the color
RED, everyone ahead of him flips his C to the other color. In turn,
each remaining man announces his C.

Dave

On Mar 3, 2:18 am, freecoder  wrote:
> You are one of 20 prisoners on death row with the execution date set
> for tomorrow.
>
> Your king is a ruthless man who likes to toy with his people's
> miseries. He comes to your cell today and tells you:
>
> “I’m gonna give you prisoners a chance to go free tomorrow. You will
> all stand in a row (queue) before the executioner and we will put a
> hat on your head, either a red or a black one. Of course you will not
> be able to see the color of your own hat; you will only be able to see
> the prisoners in front of you with their hats on; you will not be
> allowed to look back or communicate together in any way (talking,
> touching.)
>
> (The prisoner in the back will be able to see the 19 prisoners in
> front of him
> The one in front of him will be able to see 18…)
>
> Starting with the last person in the row, the one who can see
> everybody in front of him, he will be asked a simple question: WHAT IS
> THE COLOR OF YOUR HAT?
>
> He will be only allowed to answer “BLACK” or “RED”. If he says
> anything else you will ALL be executed immediately.
>
> If he guesses the right color of the hat on his head he is set free,
> otherwise he is put to death. And we move on to the one in front of
> him and ask him the same question and so on…
>
> Well, good luck tomorrow, HA HA HA HA HA HA!”
>
> Now since you all can communicate freely during the night, can you
> find a way to guarantee the freedom of some prisoners tomorrow? How
> many?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: brain teaser

[Don]

They agree on the following plan:

The prisoner at the back of the line counts up the number of red hats
he sees. If the number is odd, he says "Red". If it is even, he says
"Black".

Now the 19th prisoner can count the red hats he sees. He can deduce
what color his hat must be to make the total odd or even, as indicated
by the previous prisoner.

Each prisoner in line must keep track of the current state, odd or
even, which changes each time someone behind him indicates having a
red hat.

Don

On Mar 3, 2:18 am, freecoder  wrote:
> You are one of 20 prisoners on death row with the execution date set
> for tomorrow.
>
> Your king is a ruthless man who likes to toy with his people's
> miseries. He comes to your cell today and tells you:
>
> “I’m gonna give you prisoners a chance to go free tomorrow. You will
> all stand in a row (queue) before the executioner and we will put a
> hat on your head, either a red or a black one. Of course you will not
> be able to see the color of your own hat; you will only be able to see
> the prisoners in front of you with their hats on; you will not be
> allowed to look back or communicate together in any way (talking,
> touching.)
>
> (The prisoner in the back will be able to see the 19 prisoners in
> front of him
> The one in front of him will be able to see 18…)
>
> Starting with the last person in the row, the one who can see
> everybody in front of him, he will be asked a simple question: WHAT IS
> THE COLOR OF YOUR HAT?
>
> He will be only allowed to answer “BLACK” or “RED”. If he says
> anything else you will ALL be executed immediately.
>
> If he guesses the right color of the hat on his head he is set free,
> otherwise he is put to death. And we move on to the one in front of
> him and ask him the same question and so on…
>
> Well, good luck tomorrow, HA HA HA HA HA HA!”
>
> Now since you all can communicate freely during the night, can you
> find a way to guarantee the freedom of some prisoners tomorrow? How
> many?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: brain teaser

[rajul jain]

@param But how can u prove that.

On Thu, Mar 3, 2011 at 5:16 PM, Param10k  wrote:

> At d Max 1 person 'll die
>
>
> -Param
> http://teknotron-param.blogspot.com/
>
> On Mar 3, 3:20 pm, rajul jain  wrote:
> > @naveen you are right there is a variant similar to this problem but here
> > come to discuss solution to this problem.
> >
> > On Thu, Mar 3, 2011 at 3:38 PM, Naveen Kumar  >wrote:
> >
> >
> >
> >
> >
> >
> >
> > > There are many variants of this puzzle listed there.
> >
> > > checkout for "Ten-Hat Variant"
> >
> > > On Thu, Mar 3, 2011 at 3:32 PM, rajul jain 
> wrote:
> >
> > >> @naveen
> > >> but in this question don't know numbers of black and red hats like
> prison
> > >> and hat puzzle
> >
> > >> On Thu, Mar 3, 2011 at 3:25 PM, Naveen Kumar <
> naveenkumarve...@gmail.com>wrote:
> >
> > >>>http://en.wikipedia.org/wiki/Prisoners_and_hats_puzzle
> >
> > >>> On Thu, Mar 3, 2011 at 3:01 PM, amit kumar  >wrote:
> >
> >  ya at least 10 can be easily freed
> >
> >  On Thu, Mar 3, 2011 at 2:18 PM, Manish Pathak  >wrote:
> >
> > > I think that the last person will tell the color of next front
> person
> > > of him, that means next person will sure that his hat color will be
> color
> > > ,telling by back person.
> > > thus person 19 ,17,15,13,11,9,7,5,3,1 th position will get free,and
> > > rest amy or may not be...
> >
> > > if i am wrong ,tell me
> >
> > > On Thu, Mar 3, 2011 at 1:48 PM, freecoder  >wrote:
> >
> > >> You are one of 20 prisoners on death row with the execution date
> set
> > >> for tomorrow.
> >
> > >> Your king is a ruthless man who likes to toy with his people's
> > >> miseries. He comes to your cell today and tells you:
> >
> > >> “I’m gonna give you prisoners a chance to go free tomorrow. You
> will
> > >> all stand in a row (queue) before the executioner and we will put
> a
> > >> hat on your head, either a red or a black one. Of course you will
> not
> > >> be able to see the color of your own hat; you will only be able to
> see
> > >> the prisoners in front of you with their hats on; you will not be
> > >> allowed to look back or communicate together in any way (talking,
> > >> touching.)
> >
> > >> (The prisoner in the back will be able to see the 19 prisoners in
> > >> front of him
> > >> The one in front of him will be able to see 18…)
> >
> > >> Starting with the last person in the row, the one who can see
> > >> everybody in front of him, he will be asked a simple question:
> WHAT IS
> > >> THE COLOR OF YOUR HAT?
> >
> > >> He will be only allowed to answer “BLACK” or “RED”. If he says
> > >> anything else you will ALL be executed immediately.
> >
> > >> If he guesses the right color of the hat on his head he is set
> free,
> > >> otherwise he is put to death. And we move on to the one in front
> of
> > >> him and ask him the same question and so on…
> >
> > >> Well, good luck tomorrow, HA HA HA HA HA HA!”
> >
> > >> Now since you all can communicate freely during the night, can you
> > >> find a way to guarantee the freedom of some prisoners tomorrow?
> How
> > >> many?
> >
> > >> --
> > >> You received this message because you are subscribed to the Google
> > >> Groups "Algorithm Geeks" group.
> > >> To post to this group, send email to algogeeks@googlegroups.com.
> > >> To unsubscribe from this group, send email to
> > >> algogeeks+unsubscr...@googlegroups.com.
> > >> For more options, visit this group at
> > >>http://groups.google.com/group/algogeeks?hl=en.
> >
> > > --
> >
> > > Thanks and Regards,
> >
> > > Manish Pathak **
> > > TimesJobs.com
> > >  manish.pat...@timesgroup.com
> > > Mo.  9015687266
> >
> > >  --
> > > You received this message because you are subscribed to the Google
> > > Groups "Algorithm Geeks" group.
> > > To post to this group, send email to algogeeks@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com.
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
> >
> >   --
> >  You received this message because you are subscribed to the Google
> >  Groups "Algorithm Geeks" group.
> >  To post to this group, send email to algogeeks@googlegroups.com.
> >  To unsubscribe from this group, send email to
> >  algogeeks+unsubscr...@googlegroups.com.
> >  For more options, visit this group at
> > http://groups.google.com/group/algogeeks?hl=en.
> >
> > >>> --
> > >>> Cheers
> > >>> Naveen Kumar
> >
> > >>> --
> > >>> You received this message because you are subscribed to the Google
> Groups
> > >>> "Algorithm Geeks" group.
> > >>> To post to this group, send email to algogeeks@googlegroups.com.
> > >>> To unsubscribe from this group, send email to
> > >>> algogeeks+unsubscr...@googlegroups.

[algogeeks] Re: brain teaser

[Param10k]

At d Max 1 person 'll die


-Param
http://teknotron-param.blogspot.com/

On Mar 3, 3:20 pm, rajul jain  wrote:
> @naveen you are right there is a variant similar to this problem but here
> come to discuss solution to this problem.
>
> On Thu, Mar 3, 2011 at 3:38 PM, Naveen Kumar 
> wrote:
>
>
>
>
>
>
>
> > There are many variants of this puzzle listed there.
>
> > checkout for "Ten-Hat Variant"
>
> > On Thu, Mar 3, 2011 at 3:32 PM, rajul jain  wrote:
>
> >> @naveen
> >> but in this question don't know numbers of black and red hats like prison
> >> and hat puzzle
>
> >> On Thu, Mar 3, 2011 at 3:25 PM, Naveen Kumar 
> >> wrote:
>
> >>>http://en.wikipedia.org/wiki/Prisoners_and_hats_puzzle
>
> >>> On Thu, Mar 3, 2011 at 3:01 PM, amit kumar wrote:
>
>  ya at least 10 can be easily freed
>
>  On Thu, Mar 3, 2011 at 2:18 PM, Manish Pathak 
>  wrote:
>
> > I think that the last person will tell the color of next front person
> > of him, that means next person will sure that his hat color will be 
> > color
> > ,telling by back person.
> > thus person 19 ,17,15,13,11,9,7,5,3,1 th position will get free,and
> > rest amy or may not be...
>
> > if i am wrong ,tell me
>
> > On Thu, Mar 3, 2011 at 1:48 PM, freecoder wrote:
>
> >> You are one of 20 prisoners on death row with the execution date set
> >> for tomorrow.
>
> >> Your king is a ruthless man who likes to toy with his people's
> >> miseries. He comes to your cell today and tells you:
>
> >> “I’m gonna give you prisoners a chance to go free tomorrow. You will
> >> all stand in a row (queue) before the executioner and we will put a
> >> hat on your head, either a red or a black one. Of course you will not
> >> be able to see the color of your own hat; you will only be able to see
> >> the prisoners in front of you with their hats on; you will not be
> >> allowed to look back or communicate together in any way (talking,
> >> touching.)
>
> >> (The prisoner in the back will be able to see the 19 prisoners in
> >> front of him
> >> The one in front of him will be able to see 18…)
>
> >> Starting with the last person in the row, the one who can see
> >> everybody in front of him, he will be asked a simple question: WHAT IS
> >> THE COLOR OF YOUR HAT?
>
> >> He will be only allowed to answer “BLACK” or “RED”. If he says
> >> anything else you will ALL be executed immediately.
>
> >> If he guesses the right color of the hat on his head he is set free,
> >> otherwise he is put to death. And we move on to the one in front of
> >> him and ask him the same question and so on…
>
> >> Well, good luck tomorrow, HA HA HA HA HA HA!”
>
> >> Now since you all can communicate freely during the night, can you
> >> find a way to guarantee the freedom of some prisoners tomorrow? How
> >> many?
>
> >> --
> >> You received this message because you are subscribed to the Google
> >> Groups "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> > --
>
> > Thanks and Regards,
>
> > Manish Pathak **
> > TimesJobs.com
> >  manish.pat...@timesgroup.com
> > Mo.  9015687266
>
> >  --
> > You received this message because you are subscribed to the Google
> > Groups "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
>   --
>  You received this message because you are subscribed to the Google
>  Groups "Algorithm Geeks" group.
>  To post to this group, send email to algogeeks@googlegroups.com.
>  To unsubscribe from this group, send email to
>  algogeeks+unsubscr...@googlegroups.com.
>  For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
> >>> --
> >>> Cheers
> >>> Naveen Kumar
>
> >>> --
> >>> You received this message because you are subscribed to the Google Groups
> >>> "Algorithm Geeks" group.
> >>> To post to this group, send email to algogeeks@googlegroups.com.
> >>> To unsubscribe from this group, send email to
> >>> algogeeks+unsubscr...@googlegroups.com.
> >>> For more options, visit this group at
> >>>http://groups.google.com/group/algogeeks?hl=en.
>
> >>  --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegrou

Re: [algogeeks] Re: Brain Teaser

[Terence]

No. 4 and 5 are consecutive.
To Amod's algo, 1,3,5,7 should be in one half, and 2,4,6,8 should be in 
the other. (both 2x2 grid)


On 2010-11-15 1:54, bittu wrote:

@amod...gr8 dude..u summarized very well acco. to ur algo..

2 5 1 6
4 7 3 8   works fine..


Regards
Shashank Mani "Don't Be Evil U Can Learn While U Earn"
Computer Science&  Engg.
Birla Institute of Technology,Mesra
Cell +91-9718508004





--
You received this message because you are subscribed to the Google Groups "Algorithm 
Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Brain Teaser

[bittu]

@amod...gr8 dude..u summarized very well acco. to ur algo..

2 5 1 6
4 7 3 8   works fine..


Regards
Shashank Mani "Don't Be Evil U Can Learn While U Earn"
Computer Science & Engg.
Birla Institute of Technology,Mesra
Cell +91-9718508004



-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Brain Teaser

[Terence]

Good point. Here is one step further:

3. Consider the center 4 numbers(regardless of order): {1,8,a,b}, 
containing 2 even and 2 odd.
   and {a,b} can be chosen from {3,4,5,6}. Then there is only one case: 
{1,8,3,6}.


The rest is trivial.


On 2010-11-12 13:26, Amod wrote:

Let me try to formalize it

1. Divide even and odd in halfs
  Since any pair of consecutive number consists of an even and an odd
number hence these two cannot be in the same half.

2 Place 1 and 8 on the separation line between even and odd.
  Since 1 and 8 have affinity for one number only hence solution is
possible.

Comments and inputs are welcome

On Nov 12, 8:18 am, Amod  wrote:

Gr8, guys :)

If any body can formalize the solution, then it would be great

On Nov 12, 12:17 am, Shiv Shankar Prajapati



  wrote:

Several solutions are possible for it
518 2
736 4
Here we can swap the position of 5<->7, 1<->3 etc.
On Thu, Nov 11, 2010 at 11:48 PM, jagannath prasad das
wrote:

4 8 3 7
2 6 1 5
On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawalwrote:

@rohit
4 5 are  diagonally adjacent .
On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhalwrote:

1 5 2 6
- - - - - -
3 7 4 8
On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain<
mail2abhila...@gmail.com>  wrote:

solution is
5 1 6 2
_ _ _ _
7 3 8 4
On Thu, Nov 11, 2010 at 1:26 PM, Amod  wrote:

We have a rectangle
It is divided in eight parts by three vertical and one horizontal line
so that there are 8 chambers.
Now we have numbers from 1-8 to be filled in these chambers.
Rule : No two consecutive numbers must be present either side to side
or diagonal
Invalid situation example
Given 5 at position 2 then 4 cannot occur at any of the give position.
4 5 4
_ _ _ _
4 4 4
_ _ _ _
--
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

  --
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

--
Rohit Singhal
B.Tech. Part-IV,
Department Of Electronics Engineering,
Centre of Advanced Studies,
Institute Of Technology, BHU
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

--
Sunny Aggrawal
B-Tech IV year,CSI
Indian Institute Of Technology,Roorkee
  --
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

  --
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

--
With Regards,
Shiv Shankar,


--
You received this message because you are subscribed to the Google Groups "Algorithm 
Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Brain Teaser

[Terence]

1) There are 4 columns: {1,3}, {5,7}, {2,4}, {6,8};
2) Column {1,3} and {6,8} must be in the middle, while column {2,4} 
besides {6,8}, and {5,7} besides {1,3}

3) The 2 numbers in each column can be swapped freely.
So there are 32 solutions in total.

On 2010-11-12 11:18, Amod wrote:

Gr8, guys :)

If any body can formalize the solution, then it would be great

On Nov 12, 12:17 am, Shiv Shankar Prajapati
  wrote:

Several solutions are possible for it

518 2
736 4

Here we can swap the position of 5<->7, 1<->3 etc.

On Thu, Nov 11, 2010 at 11:48 PM, jagannath prasad das
wrote:










4 8 3 7
2 6 1 5
On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawalwrote:

@rohit
4 5 are  diagonally adjacent .
On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhalwrote:

1 5 2 6
- - - - - -
3 7 4 8
On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain<
mail2abhila...@gmail.com>  wrote:

solution is
5 1 6 2
_ _ _ _
7 3 8 4
On Thu, Nov 11, 2010 at 1:26 PM, Amod  wrote:

We have a rectangle
It is divided in eight parts by three vertical and one horizontal line
so that there are 8 chambers.
Now we have numbers from 1-8 to be filled in these chambers.
Rule : No two consecutive numbers must be present either side to side
or diagonal
Invalid situation example
Given 5 at position 2 then 4 cannot occur at any of the give position.
4 5 4
_ _ _ _
4 4 4
_ _ _ _
--
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

  --
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

--
Rohit Singhal
B.Tech. Part-IV,
Department Of Electronics Engineering,
Centre of Advanced Studies,
Institute Of Technology, BHU
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

--
Sunny Aggrawal
B-Tech IV year,CSI
Indian Institute Of Technology,Roorkee
  --
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

  --
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

--
With Regards,

Shiv Shankar,


--
You received this message because you are subscribed to the Google Groups "Algorithm 
Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Brain Teaser

[Amod]

Let me try to formalize it

1. Divide even and odd in halfs
 Since any pair of consecutive number consists of an even and an odd
number hence these two cannot be in the same half.

2 Place 1 and 8 on the separation line between even and odd.
 Since 1 and 8 have affinity for one number only hence solution is
possible.

Comments and inputs are welcome

On Nov 12, 8:18 am, Amod  wrote:
> Gr8, guys :)
>
> If any body can formalize the solution, then it would be great
>
> On Nov 12, 12:17 am, Shiv Shankar Prajapati
>
>
>
>  wrote:
> > Several solutions are possible for it
>
> > 5    1    8     2
> > 7    3    6     4
>
> > Here we can swap the position of 5<->7, 1<->3 etc.
>
> > On Thu, Nov 11, 2010 at 11:48 PM, jagannath prasad das
> > wrote:
>
> > > 4 8 3 7
> > > 2 6 1 5
>
> > > On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawal 
> > > wrote:
>
> > >> @rohit
> > >> 4 5 are  diagonally adjacent .
>
> > >> On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhal 
> > >> wrote:
>
> > >>> 1 5 2 6
>
> > >>> - - - - - -
>
> > >>> 3 7 4 8
>
> > >>> On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain <
> > >>> mail2abhila...@gmail.com> wrote:
>
> >  solution is
> >  5 1 6 2
> >  _ _ _ _
>
> >  7 3 8 4
>
> >  On Thu, Nov 11, 2010 at 1:26 PM, Amod  wrote:
>
> > > We have a rectangle
> > > It is divided in eight parts by three vertical and one horizontal line
>
> > > so that there are 8 chambers.
> > > Now we have numbers from 1-8 to be filled in these chambers.
> > > Rule : No two consecutive numbers must be present either side to side
> > > or diagonal
> > > Invalid situation example
> > > Given 5 at position 2 then 4 cannot occur at any of the give position.
> > > 4 5 4
> > > _ _ _ _
>
> > > 4 4 4
> > > _ _ _ _
>
> > > --
> > > You received this message because you are subscribed to the Google
> > > Groups "Algorithm Geeks" group.
> > > To post to this group, send email to algoge...@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com > >  .com>
> > > .
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
>
> >   --
> >  You received this message because you are subscribed to the Google
> >  Groups "Algorithm Geeks" group.
> >  To post to this group, send email to algoge...@googlegroups.com.
> >  To unsubscribe from this group, send email to
> >  algogeeks+unsubscr...@googlegroups.com >   .com>
> >  .
> >  For more options, visit this group at
> > http://groups.google.com/group/algogeeks?hl=en.
>
> > >>> --
> > >>> Rohit Singhal
> > >>> B.Tech. Part-IV,
> > >>> Department Of Electronics Engineering,
> > >>> Centre of Advanced Studies,
> > >>> Institute Of Technology, BHU
>
> > >>> --
> > >>> You received this message because you are subscribed to the Google 
> > >>> Groups
> > >>> "Algorithm Geeks" group.
> > >>> To post to this group, send email to algoge...@googlegroups.com.
> > >>> To unsubscribe from this group, send email to
> > >>> algogeeks+unsubscr...@googlegroups.com > >>>  .com>
> > >>> .
> > >>> For more options, visit this group at
> > >>>http://groups.google.com/group/algogeeks?hl=en.
>
> > >> --
> > >> Sunny Aggrawal
> > >> B-Tech IV year,CSI
> > >> Indian Institute Of Technology,Roorkee
>
> > >>  --
> > >> You received this message because you are subscribed to the Google Groups
> > >> "Algorithm Geeks" group.
> > >> To post to this group, send email to algoge...@googlegroups.com.
> > >> To unsubscribe from this group, send email to
> > >> algogeeks+unsubscr...@googlegroups.com > >>  .com>
> > >> .
> > >> For more options, visit this group at
> > >>http://groups.google.com/group/algogeeks?hl=en.
>
> > >  --
> > > You received this message because you are subscribed to the Google Groups
> > > "Algorithm Geeks" group.
> > > To post to this group, send email to algoge...@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com > >  .com>
> > > .
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> > With Regards,
>
> > Shiv Shankar,

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Brain Teaser

[Amod]

Gr8, guys :)

If any body can formalize the solution, then it would be great

On Nov 12, 12:17 am, Shiv Shankar Prajapati
 wrote:
> Several solutions are possible for it
>
> 5    1    8     2
> 7    3    6     4
>
> Here we can swap the position of 5<->7, 1<->3 etc.
>
> On Thu, Nov 11, 2010 at 11:48 PM, jagannath prasad das
> wrote:
>
>
>
>
>
>
>
>
>
> > 4 8 3 7
> > 2 6 1 5
>
> > On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawal 
> > wrote:
>
> >> @rohit
> >> 4 5 are  diagonally adjacent .
>
> >> On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhal 
> >> wrote:
>
> >>> 1 5 2 6
>
> >>> - - - - - -
>
> >>> 3 7 4 8
>
> >>> On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain <
> >>> mail2abhila...@gmail.com> wrote:
>
>  solution is
>  5 1 6 2
>  _ _ _ _
>
>  7 3 8 4
>
>  On Thu, Nov 11, 2010 at 1:26 PM, Amod  wrote:
>
> > We have a rectangle
> > It is divided in eight parts by three vertical and one horizontal line
>
> > so that there are 8 chambers.
> > Now we have numbers from 1-8 to be filled in these chambers.
> > Rule : No two consecutive numbers must be present either side to side
> > or diagonal
> > Invalid situation example
> > Given 5 at position 2 then 4 cannot occur at any of the give position.
> > 4 5 4
> > _ _ _ _
>
> > 4 4 4
> > _ _ _ _
>
> > --
> > You received this message because you are subscribed to the Google
> > Groups "Algorithm Geeks" group.
> > To post to this group, send email to algoge...@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com >  .com>
> > .
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
>   --
>  You received this message because you are subscribed to the Google
>  Groups "Algorithm Geeks" group.
>  To post to this group, send email to algoge...@googlegroups.com.
>  To unsubscribe from this group, send email to
>  algogeeks+unsubscr...@googlegroups.com   .com>
>  .
>  For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
> >>> --
> >>> Rohit Singhal
> >>> B.Tech. Part-IV,
> >>> Department Of Electronics Engineering,
> >>> Centre of Advanced Studies,
> >>> Institute Of Technology, BHU
>
> >>> --
> >>> You received this message because you are subscribed to the Google Groups
> >>> "Algorithm Geeks" group.
> >>> To post to this group, send email to algoge...@googlegroups.com.
> >>> To unsubscribe from this group, send email to
> >>> algogeeks+unsubscr...@googlegroups.com >>>  .com>
> >>> .
> >>> For more options, visit this group at
> >>>http://groups.google.com/group/algogeeks?hl=en.
>
> >> --
> >> Sunny Aggrawal
> >> B-Tech IV year,CSI
> >> Indian Institute Of Technology,Roorkee
>
> >>  --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algoge...@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com >>  .com>
> >> .
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> >  --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algoge...@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com > .com>
> > .
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> With Regards,
>
> Shiv Shankar,

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.