Euclidean Algorithm: Understanding Division

singedang2
Messages
25
Reaction score
0
http://img82.imageshack.us/img82/4458/divisonfx9.jpg
 
Last edited by a moderator:
Physics news on Phys.org
bump... help pls. thank you!
 
Please never bump threads. I was typing a post to this thread before you bumped it anyways. Prove that (ab-1) = (a-1)[(a-1)(something) + b]
 
i don't quite get it... since this is an if and only if question i have to prove it both sides. and which one are you proving?
 
Both...
 

Thread 'Finding the nth roots of a complex number'

There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
View full post »

Similar threads

Using the Euclidean algorithm .I think
Replies
5
Views
2K
Use the Euclidean algorithm to find integers ## a, b, c ##
Replies
5
Views
1K
Finding GCD with Fibonacci: Base Case
Replies
1
Views
1K
Solve the simultaneous congruence modulo equation
Replies
3
Views
2K
B Cartesian Space vs. Euclidean Space
Replies
10
Views
2K
Gcd(a,b) unique in Euclidean domain?
Replies
1
Views
2K
Division Algorithm: Understand Unique c & d
Replies
13
Views
2K
Linear combinations euclidean algoritm extended
Replies
2
Views
2K
MHB Number of steps of euclidean algorithm
Replies
4
Views
4K
Learning data structures and algorithms in different programming languages
2
Replies
84
Views
534

Hot Threads

Recent Insights

Back
Top