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 个星标 · 0 个复刻 · 0 个作品≈42 个 token
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 个星标 · 0 个复刻 · 0 个作品≈42 个 token
v1 的社区投票。 Votes count once an account is 7 days old, or has an approved example or a published make.
还没有投票。
登录后可以投票选出它适用的模型。