trustmebro.to/r/…

✓ checked

trust me, bro:

here is the receipt.

the claim

Odd numbers cannot be composite numbers.

the verdict

REFUTED

the evidence says no

Recorded sources

0 sources for · 5 against

Counts group repeated records of the same source within each side. They do not measure evidence strength or source independence.

Is it true that odd numbers cannot be composite numbers?

No. Odd numbers can indeed be composite numbers (for example, 9, 15, and 21 are both odd and composite), directly refuting the claim.

Verdict: REFUTED · 0 sources for, 5 against · Last checked 6 Aug 2026

How claims like this are judged

Judged against reference works: claims of this kind are settled by reference works, not journal abstracts.

Evidence against · 5

Wikipedia: Composite number

Reference article covering this claim directly

Get citation

Wikipedia: Composite number. (n.d.). Wikipedia. https://en.wikipedia.org/wiki/Composite_number

See more details

More against · 4

OpenAIRE: The Definition of Prime Numbers Contradicts Its Very Own Existence.pdf

2021

Item 13 explicitly refers to 'odd composite numbers' and discusses their properties, refuting the claim.

Get citation

OpenAIRE: The Definition of Prime Numbers Contradicts Its Very Own Existence.pdf. (2021). OpenAIRE. https://doi.org/10.6084/m9.figshare.17041013

OpenAIRE: The Definition of Prime Numbers Contradicts Its Very Own Existence

2021

Item 14 explicitly notes that 'odd composite numbers' exist and analyzes them.

Get citation

OpenAIRE: The Definition of Prime Numbers Contradicts Its Very Own Existence. (2021). OpenAIRE. https://doi.org/10.5281/zenodo.5710379

OpenAIRE: The MokraBela Theorem: A New Algebraic Characterization of Prime Numbers via the Identity k(2n + k)

2026

Item 15 provides an algebraic characterization for the set of all 'odd composite numbers', refuting the claim.

Get citation

OpenAIRE: The MokraBela Theorem: A New Algebraic Characterization of Prime Numbers via the Identity k(2n + k). (2026). OpenAIRE. https://doi.org/10.5281/zenodo.18869236

OpenAIRE: Hard sequence regarding the Goldbach Conjecture.

2025

Item 16 explicitly cites 9 as 'the smallest odd composite number', refuting the claim.

Get citation

OpenAIRE: Hard sequence regarding the Goldbach Conjecture.. (2025). OpenAIRE. https://doi.org/10.5281/zenodo.15507308

Related receipts

Is it true that mathematical numbers cannot be depleted through use? SUPPORTED related question, same topic
Is it true that Huygens' principle is valid only in an odd number of spatial dimensions? REFUTED related question, same topic
Is it true that people exhibit consistent aesthetic preferences for even versus odd numbers? REFUTED related question, same topic

Receipt History

first checked06 Aug 2026

judged → REFUTED · 006 Aug 2026

Anyone with this link can read the claim and its public receipt, including any personal information in that text. Open permanent receipt.

Check your own claim

Challenge the receipt

I have a source that contradicts this verdict I have a source that supports it No source: request a receipt review Requests are recorded for review. This does not start an automatic check or guarantee a response time.

See the evidence timeline

Citation formatting by citeproc-js (Frank Bennett) and the Citation Style Language project. Source and licenses.

This receipt is an automated verdict against our published method · not an opinion about any author or publication.
Terms · Privacy · How verdicts work