There infinite answers.Code:#include <iostream> using namespace std; int main () { int a = 1; int b = 1; int i = 1; while(i > 0) { cout << a+b; a = a+b; b = a*b; } return 0; }
It wont stop
read! Every possible answer with a .5 increment
#include <iostream>
using namespace std;
int main ()
{
long double a;
long double b;
long double incra = .1;
for(b = incra; b <= 4000000000 ; b = b + incra)
{
a = 4000000000 / b;
cout << "A is:" <<a<< " B is:" <<b<<;
if(b == 4000000000)
{
b = incra / 10;
incra = incra / 10;
}
}
return 0;
}
That's like your wife saying, "You can have sex with any women, except the good looking ones."
It isn't every possible answer, as there are an infinite number of answers.
#include <iostream>
using namespace std;
int main ()
{
long double a;
long double b;
long double incra = .1;
for(b = incra; b <= 4000000000 ; b = b + incra)
{
a = 4000000000 * b;
cout << "A is:" <<a<< " B is:" <<b<<;
if(b == 4000000000)
{
b = incra / 10;
incra = incra / 10;
}
}
return 0;
}
you can't get INFINITE answers no matter what you'll have a finite set, its just a matter of how CLOSE you can get.
this thread is certifiably stupid.
like, tap water stupid...no, not even that smart
seriously i cannot find an analogy appropriate enough to express just how stupid this thread is.
this thread is certifiably stupid.
like, tap water stupid...no, not even that smart
seriously i cannot find an analogy appropriate enough to express just how stupid this thread is.
i would have one if i weren't so busy making love to supermodels, newbyou just didn't have an answer
Probably: Stupid as this guy I know's dad, who asked him this question in response to his son's saying something about wanting a career in mathematics.
See, his dad's a hate mongering super-Christian.
edit: oh, oh, ok i get it now...you made the thread because some kid's dad is a churchie and asked the question in order to de-value math.
the way you structured that made my head hurt
No, everyone needs to understand the definition of a recursively enumerable set. It's easy to write a program that will print out an infinite set (given enough time and resources), but in this particular case the set of solutions isn't recursively enumerable, in fact it's even uncountable, so you're screwed.I'm sure the language can support more, you just need use a data structure that can grow as large as the available memory. But even then, you will not come even come close to the infinite number of solutions that exist. Maybe you need to understand the definition of "infinite".