RE: [algogeeks] Re: program for evaluation of remainders

2010-12-11 Thread Shiv Shankar 
Hi,
  I agree with ankit sablok. And if we get the factorial of n in 1!, 2!, 3!
Etc. Then we can find the number easily. In its complexity will be O(N)
  


-Original Message-
From: algogeeks@googlegroups.com [mailto:algoge...@googlegroups.com] On
Behalf Of Dave
Sent: Friday, December 10, 2010 8:10 PM
To: Algorithm Geeks
Subject: [algogeeks] Re: program for evaluation of remainders

@Ankit: Why not just use the algorithm I proposed in
http://groups.google.com/group/algogeeks/msg/2941ab071a39517c:

x = 0;
for( i = (n  N ? n : N) ; i  0 ; --i )
x = (i * x + i) % n;

Dave

On Dec 10, 4:23 am, ankit sablok ankit4...@gmail.com wrote:
 @Dave
 we will use residues then i think the property of modulus

 1!mod997 + 2!mod997 + 3!mod997 .. + 997!mod997

 i just proposed the solution using congruences for the case
 nN

 can u generalize the problem using congruences if so then please post
 it
 thnanx in advance

 On Dec 9, 2:13 am, Dave dave_and_da...@juno.com wrote:



  @Ankit: So how does that work with, e.g., N = n = 997? I.e., what is
  the calculation?

  Dave

  On Dec 8, 11:33 am, ankit sablok ankit4...@gmail.com wrote:

   @ all the authors thanx for the suggestions actually wt i know about
   the problem is i think we can solve the problem mathematically if we
   know about congruences

   for instance
   if N=100
   1! + 2! + . + 100!
   and n=12

   we find that
   4!mod24=0

   hence the above equation reduces to the
   (1!+2!+3!)mod 12 =9
   hence the answer is 9

   so can anyone write a program for this logic

   On Dec 8, 6:19 pm, ankit sablok ankit4...@gmail.com wrote:

Q) can anyboy find me the solution to this problem

Given an integer N and an another integer n we have to write a
program
to find the remainder of the following problems
(1! + 2! + 3! + 4! + . + N!)mod(n)

N=100
n=1000;

please help me write a program for this problem
thanx in advance- Hide quoted text -

   - Show quoted text -- Hide quoted text -

  - Show quoted text -- Hide quoted text -

 - Show quoted text -

-- 
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.

Re: [algogeeks] Brain Teaser

2010-11-11 Thread Shiv Shankar Prajapati 
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
jpdasi...@gmail.comwrote:

 4 8 3 7
 2 6 1 5

 On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawal sunny816.i...@gmail.comwrote:

 @rohit
 4 5 are  diagonally adjacent .

 On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhal 
 rsinghal.it...@gmail.comwrote:

 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 gam...@gmail.com 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.comalgogeeks%2bunsubscr...@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.comalgogeeks%2bunsubscr...@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.comalgogeeks%2bunsubscr...@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.comalgogeeks%2bunsubscr...@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.comalgogeeks%2bunsubscr...@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.