# Why AI can solve hard math problems but can't count

> Source: <https://www.theargumentmag.com/p/why-ai-can-solve-hard-math-problems>
> Published: 2026-06-03 10:00:49+00:00

# Why AI can solve hard math problems but can't count

### AI keeps whiffing on this simple question

There are no P’s in the word “Google,” but someone still needs to tell Gemini this — Google’s own AI Overview keeps suggesting there are P’s when asked.

Back in 2024, asking a model to count the R’s in “strawberry” became the internet’s [canonical](https://www.reddit.com/r/singularity/comments/1enqk04/how_many_rs_in_strawberry_why_is_this_a_very/) [example](https://medium.com/@danisaysskol/breaking-down-llm-thought-process-the-strawberry-question-bdc564cc77a4) of weird AI failure modes. Most models of that generation counted letters [wrong](https://arxiv.org/pdf/2412.18626) about half of the time.

Since then, LLMs [have made](https://metr.org/time-horizons/) rapid [leaps](https://artificialanalysis.ai/articles/claude-opus-4-8-analysis-and-benchmarks) in everything from scientific reasoning to agentic coding, while major businesses have begun to rely on them in critical areas like [finance](https://www.cfo.com/news/inside-anthropic-claude-rapid-expansion-across-corporate-finance-cfo-/820806/). And yet, somehow, they still suffer on tasks like counting the R’s in “strawberry,” the P’s in Google, or the N’s in the days of the week, which I asked ChatGPT to do today:

How is it that models can now solve [historic math problems](https://www.understandingai.org/p/openais-milestone-math-breakthrough) but still fail to count letters in a word?

The [typical](https://www.runpod.io/blog/llm-tokenization-limitations) explanation here has to do with “[tokenization](https://huggingface.co/docs/transformers/en/main_classes/tokenizer).” LLMs don’t read English characters; they break words into subwords, like “st -raw - berry.” Each segment of the word is a token, which is used because it’s the most efficient unit of language to compute (compared to the vast library of whole words). Under this theory, the counting issue has to do with how familiar an LLM is with a given token from its training data.

That explanation never quite made sense to me. “Strawberry” is a very common word. Even if it were tokenized several different ways within the training data (“st -raw - berry” and “straw - be -rry”), its tokens would still be quite familiar.

## Keep reading with a 7-day free trial

Subscribe to The Argument to keep reading this post and get 7 days of free access to the full post archives.
