News for hackers. Stuff that matters.
Re:You Can Prove a Negative [pdf] by Dylan16807 on Saturday August 08, 2015 @06:04PM (#10028771)
You don't need a proper 'infinity' to have integers be unbounded.

>Let X be the highest positive integer

That contradicts the definition of integer, so it doesn't really show anything.

Pretty much all I need for the proof is a working successor function, and if you take away the successor function you have something that doesn't even resemble integers.

Re:You Can Prove a Negative [pdf] by shkkmo on Saturday August 08, 2015 @06:35PM (#10028842)
> You don't need a proper 'infinity' to have integers be unbounded.

What do you mean by unbounded? If you mean something like a 64 bit integer that loops around to negatives eventually, then the statement either "every (non-zero) integer is a factor of another integer" is no longer true.

> That contradicts the definition of integer, so it doesn't really show anything.

Which definition does it contradict?

> Pretty much all I need for the proof is a working successor function, and if you take away the successor function you have something that doesn't even resemble integers.

You can have a successor function, but if you can only apply it a finite number of times if you don't have infinity.

Re:You Can Prove a Negative [pdf] by Dylan16807 on Saturday August 08, 2015 @06:50PM (#10028877)
> What do you mean by unbounded?

There is no largest integer.

> If you mean something like a 64 bit integer that loops around to negatives eventually, then the statement either "every (non-zero) integer is a factor of another integer" is no longer true.

Sort of, it depends on how you define factor. What stops me from factoring -4 into 4 * 63?

> Which definition does it contradict?

Where you take counting numbers and add 0 and negatives. If you reach a point where you can't count more, you screwed something up.

> You can have a successor function, but if you can only apply it a finite number of times if you don't have infinity.

When you give me an integer n, I only need to apply the successor function n times to provide your factoring example. No problem there.

Re:You Can Prove a Negative [pdf] by shkkmo on Saturday August 08, 2015 @08:20PM (#10029058)
> Where you take counting numbers and add 0 and negatives. If you reach a point where you can't count more, you screwed something up.

Or you ran out of time, or atoms.