Euclidean Algorithm: Understanding Division

Click For Summary

Homework Help Overview

The discussion revolves around the Euclidean algorithm and its application in division, specifically focusing on a proof involving the expression (ab-1) = (a-1)[(a-1)(something) + b].

Discussion Character

  • Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants are exploring the proof of an equation that requires demonstrating both directions of an "if and only if" statement. There is uncertainty about which side of the equation is being proven at various points in the discussion.

Discussion Status

Some participants are actively engaging with the proof requirements, while others are questioning the approach and clarity of the statements being made. There is no explicit consensus on the direction of the proof, but the conversation is ongoing.

Contextual Notes

One participant expresses confusion regarding the nature of the proof, indicating that the problem may involve specific assumptions about the variables involved. Additionally, there is a note against "bumping" threads, suggesting a focus on maintaining discussion flow.

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

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
86
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K