New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Intro to Analysis of Algorithm

by: Laurianne Mante

Intro to Analysis of Algorithm CSCI 350

Marketplace > Bucknell University > ComputerScienence > CSCI 350 > Intro to Analysis of Algorithm
Laurianne Mante

GPA 3.54

Stephen Guattery

Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Stephen Guattery
Class Notes
25 ?




Popular in Course

Popular in ComputerScienence

This 5 page Class Notes was uploaded by Laurianne Mante on Saturday October 3, 2015. The Class Notes belongs to CSCI 350 at Bucknell University taught by Stephen Guattery in Fall. Since its upload, it has received 27 views. For similar materials see /class/218090/csci-350-bucknell-university in ComputerScienence at Bucknell University.

Popular in ComputerScienence


Reviews for Intro to Analysis of Algorithm


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 10/03/15
CSC1350 Spring 2006 Slide Set 18 The Chinese Remainder Theorem The Chinese Remainder Theorem 0 Theorem 3127 see text pp 873874 Let n 141142 nk where the Hi are pairwise relatively prime Consider the correspondence a lt gt a1 a2 a where a 6 Zn a1 6 Zni and a1 a mod ni for i 1 2 k The correspondence above is a onetoone correspondence bijection between Zn and the Cartesian product anx ZnZXgtlt an Uses of the Chinese Remainder Theorem 0 It shows that the structure of Zn is identical to that of anx anxgtlt an using the operations de ned in the text 0 Using the Cartesian product representation may give ef cient algorithms in terms of the number of bitwise operations required for arithmetic operations Additional Results 0 Corollary 3128 If n1 n2 nk are pairwise relatively prime and n 141142 nk then for any integers a a2 ak the set of simultaneous equations x E at mod ml for i 1 2 khas a unique solution modulo n for the unknown x Additional Results 2 0 Corollary 3129 If n1 n2 nk are pairwise relatively prime and n 171142 nk then for all integers x and a x E a mod ni fori l 2 kifand only if x E a mod n


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Allison Fischer University of Alabama

"I signed up to be an Elite Notetaker with 2 of my sorority sisters this semester. We just posted our notes weekly and were each making over $600 per month. I LOVE StudySoup!"

Jim McGreen Ohio University

"Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."


"Their 'Elite Notetakers' are making over $1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.