Can you see a counter example that i can't, divisibility problem

Click For Summary

Homework Help Overview

The discussion revolves around a divisibility problem involving integers a and b, specifically examining the statement: if a|10b, then a|10 or a|b. The original poster is seeking a counterexample to potentially disprove this statement.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to find a counterexample using specific values for a and b, questioning the validity of the statement. Some participants suggest reconsidering the choice of a and b, emphasizing the need for a valid example where a|10b holds true while a does not divide 10 or b.

Discussion Status

Participants are actively engaging in exploring the problem, with some offering hints and suggestions for selecting appropriate values for a and b. There is a recognition that a counterexample is necessary for disproof, and the conversation is focused on clarifying the conditions needed for such an example.

Contextual Notes

There is a mention of the need for a to be greater than 10 and greater than b, as well as considerations regarding the definitions of divisibility and the implications of choosing specific integers.

mr_coffee
Messages
1,613
Reaction score
1
HEllo everyone. I'm trying to find a counter example that will prove this false. But it may be true but I'm hoping it isn't :)

For all integers a and b, if a|10b then a|10 or a|b. I said false, a = 3, b = 5. 3 is not divisible by 50. 3 is also not divisble by 10 nor 3 divisible by 5. But then i saw, p has to be true for q to be true. I have to prove q to be false, then p is also false. Its looking like this has to be true, can anyone spot a counter example? I"m not looking for an answer, but it would motivate me to keep looking for one.

THanks!
 
Physics news on Phys.org
Try having a > 10 and a > b
 
So we're starting with

prove or disprove that for all a,b if a|10b then a|10 or a|b.

A disproof does require one counter example. However, why did you pick a=3 and b=5, since we need to have a|10b and a doesn't divide 10 or b for a counter example, and 3 does not divide 50.

Hint: p is *prime* if and only if for all m,n p|mn implies p|m or p|n. (so of course a counter example exists, and can be found just by thinking about prime factorizations.
 
mr_coffee said:
HEllo everyone. I'm trying to find a counter example that will prove this false. But it may be true but I'm hoping it isn't :)

For all integers a and b, if a|10b then a|10 or a|b. I said false, a = 3, b = 5. 3 is not divisible by 50. 3 is also not divisble by 10 nor 3 divisible by 5.
The question would not be whether 3 is divisible by 50 but whether 50 is divisible by 3. a| 10b means "a divides 10b". I.e. "10b is divisible by a". In any case, the statement says "If a|10b" so you cannot choose an example in which that is not true.
But then i saw, p has to be true for q to be true. I have to prove q to be false, then p is also false.
Well, I don't know because you didn't tell us what p and q are!
Its looking like this has to be true, can anyone spot a counter example? I"m not looking for an answer, but it would motivate me to keep looking for one.

THanks!
I hope you mean you are not asking for an answer. You certainly should be looking for one! Try this: pick b to be anything you like and pick a to be the biggest number you can find that will divide 10b.
 

Similar threads

Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
7K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
4K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K