4 ms·
The difficulty in conceiving of a constant functions seems similar to the difficulty in recognizing that > if 4 is prime then all numbers are prime Is a true
by 77pt77 8y ago
The difficulty in conceiving of a constant functions seems similar to the difficulty in recognizing that
> if 4 is prime then all numbers are prime
Is a true theorem (and things along these lines)
- pbhjpbhj 8y ago>> if 4 is prime then all numbers are prime >Is a true theorem (and things along these lines) Saying "4 is prime" "primes are non-composite, ..." reduces to error; at least one of these premises is false. ?