11–20 of 59 posts
> Prime Factorization - Have the user enter a number and find all Prime Factors (if there are any) and display them. not to sound pedantic, but for any integer greater than 1 there is always at least one prime factor: https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithme... edit: for prime numbers, it is the number itself
> Prime Factorization - Have the user enter a number and find all Prime Factors (if there are any) and display them. not to sound pedantic, but for any integer greater than 1 there is always at least one prime factor: https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithme... edit: for prime numbers, it is the number itself
and "1" does not, so the thing youre trying to be pedantic about isnt even wrong.
> Prime Factorization - Have the user enter a number and find all Prime Factors (if there are any) and display them. not to sound pedantic, but for any integer greater than 1 there is always at least one prime factor: https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithme... edit: for prime numbers, it is the number itself
Not to sound pedantic, but a number is only its own prime factor if it itself is prime! (Your point stands, though: every integer > 1 has at least one prime factor.)
My go-to for this sort of thing has always been Project Euler ( https://projecteuler.net/ ).
> Prime Factorization - Have the user enter a number and find all Prime Factors (if there are any) and display them. not to sound pedantic, but for any integer greater than 1 there is always at least one prime factor: https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithme... edit: for prime numbers, it is the number itself
and "1" does not, so the thing youre trying to be pedantic about isnt even wrong.
Earlier quoted context omitted.
and "1" does not, so the thing youre trying to be pedantic about isnt even wrong.
True, and when talking about "numbers" one would generally include 3/7 and maybe e , negative numbers and perhaps complex numbers... or at the very least negative integers...
besides, you may as well consider 1 a prime factor. the task is just a silly programming toy problem. 1 not being prime is pure definition, including 1 in the primes would not materially change the definition of primes. just make a lot of advanced math tedious to write down.
Great list for inspiration! Though, it is not true that all the problems can be solved in any programming language: try to make a "Bandwidth Monitor" in Coq.
Great list for inspiration! Though, it is not true that all the problems can be solved in any programming language: try to make a "Bandwidth Monitor" in Coq.
Coq's not really a programming language, is it? It's a proof language. So, you could prove the correctness, or perhaps possibility, of a bandwidth monitor in Coq, given certain assumptions, but it would be up to some other poor schmuck to actually write it.
Coq is certainly a programming language, as you can build programs. But you can't interact with the subsystem, you can only build pure functions (Therefore it is quite hard to build a performance monitor).
In my opinion English could also go as a programming language. Especially given the rise in NLP products. You can actually program a computer to do quite advanced tasks solely through natural languages.