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 Guidev1스타 0개 · 포크 0개 · 작품 0개≈42 토큰
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 Guidev1스타 0개 · 포크 0개 · 작품 0개≈42 토큰
v1에 대한 커뮤니티 투표. Votes count once an account is 7 days old, or has an approved example or a published make.
아직 투표가 없습니다.
이 프롬프트가 어떤 모델에서 작동하는지 투표하려면 로그인하세요.