Self-Referential Sentences

No ... you haven't it!

In your first answer you say the number of occurrences of 1 is 7 ... but I count 8; and you say the number of occurrences of 2 is 4 ... but I count 2; and you say the number of occurrences of 4 is 1 ... but I count 2; and you say the number of occurrences of 8 is 2 ... but I count 1

And in your second answer you say the number of occurrences of 1 is 8 ... but I count 7; and you say the number of occurrences of 2 is 2 ... but I count 4; and you say the number of occurrences of 8 is 1 ... but I count 2

So all in all, you're still a long way off getting it!

 

Yep.....what SHE said.

[like I'm daft enough to disagree with the freestyle pencil-chewing champ of 1982...]

But,in truth,Little Miss grumpy IS correct. I counted 7,4 & 2 respectively,as well.

 

nope...tried and failed....don't see how it can be solved if the question evolves with every answer.....i think steam was coming out my ears
....


just the first run through ends up with 1 going up to 10....making zeros original answer incorrect


or some shit like that

 

That's close enough for jazz,rollypoly....it's just a subjugated-integer version of Fibonacci sequencing,bruv.
Just don't fall into the trap of using factorial sequentials and it becomes obvious....




meh-I DEFFO need espresso-NOW!

 

is that a real thing?...seriously i only have basic high school math....nothing fancy taught by priests

i did email this to 3 sisters and a daughter..and a stoner friend lol.....plus the grand kids...they are probably all cursing me right now haha

 

WOW......I Can't Even Pronounce Those Words Let Alone Understand What They Mean......



Cheers Glen.

 

HERE is the correct answer:

In this sentence, the number of occurrences of 0 is 1, of 1 is 7, of 2 is 3, of 3 is 2, of 4 is 1, of 5 is 1, of 6 is 1, of 7 is 2, of 8 is 1, of 9 is 1

:daisy: :daisy: :daisy: :daisy: :daisy: :daisy:


(and I DIDN'T do it by iteration ... )



I have not quite completed the maths to prove it, but I do not believe there IS a second correct solution. It's kinda complicated, however, so you might not all understand it ... best content yourself with the fact that I have provided you with the solution!

 

Oi,BeachBum,psst!
Babe-nobody likes a smartarse.....even if that arse is pert,tight and shapely. Coz so was Red Rum's!

[just a word t'the wise,Toots...m'kay?]

 

in order to understand recursion, you must furst understand recursion

 

In this sentence, the number of occurrences of 0 is one, of 1 is one, of 2 is one, of 3 is one, of 4 is one, of 5 is one, of 6 is one, of 7 is one, of 8 is one, of 9 is one.

 

If you write the numbers in the spaces using only letters it's easier to solve this.

 

^^ wot he said

 

not easier...its the answer to the question.....which I solved....other wise it isn't a proper sentence..



improper use of the comma.....ten yard penalty....loss of a down

 

It wasn't specified that the sentence had to be truthful in the original exercise, nor even grammatically correct therefore there are thousands of millions if not perhaps an infinite number of possible solutions, all of which are correct.

 

there can only be one answer...the correct one

 

No need to overthink it. Put the best answer. If no answer is given then you aren't wrong.

 

I'm going with beachball