Proof of Infinite Primes in Shakespeare Style
The following prompt tests an LLM's capabilities to write a proof that there are infinitely many primes in the style of a Shakespeare play.
Prompt Engineering Guidev10 stars · 0 forks · 0 makes≈42 tokens
The following prompt tests an LLM's capabilities to write a proof that there are infinitely many primes in the style of a Shakespeare play.
Prompt Engineering Guidev10 stars · 0 forks · 0 makes≈42 tokens
Community votes for v1. Votes count once an account is 7 days old, or has an approved example or a published make.
No votes yet.
Sign in to vote on which models this works with.
Real outputs people got from this prompt.
No examples yet. Ran this prompt? Share what you got.