I'm Pete, a frontend developer who enjoys building smooth and engaging websites using JavaScript, and frameworks. Am also experienced in working with smart contracts.
After observing Alexandria Math Package i will tackle the above task with the following steps:

1. Function definition: function is_prime(n: integer) -> boolean:
2. Handle edge case: Start by handling edge cases. Prime numbers are greater than 1, so I will check for numbers like 1 or negative numbers and return False.
3. Handle Small Numbers: If the number is 2 or 3, return True because both are prime.
4. Eliminate Even Numbers: Any even number greater than 2 is not prime, so return False if n is divisible by 2.
5. Check divisibility: For odd numbers greater than 3, I will check divisibility from 3 up to the square root of the number.
6. Return result: If a divisor without remender is found, return False. Otherwise, return True.

ETA <= 10hrs

Can i work on this? @coxmars
I am a good blockchain developer with ample experience with cairo.

How i will handle this

• I will fork this repo and follow the contribution guide.
• I will use the alexandria Math is_prime package for this
• I will create a cairo project called prime_checker in the cairo/scripts directory.
• I will make sure to handle edge cases in the prime_checker function
• I will make a PR within 24 hours of assignment.

Can I get assigned to this task @coxmars
I am proficient in cairo projects
View my Profile:
https://app.onlydust.com/u/Nityam573

May I take this up? I've been a Competitive Programmer, I'm specialist at codeforces and I'm also good at cairo. So this would be perfect issue for me.

ETA: 24 hrs

Proposal to Work on the Issue

I would be delighted to contribute to this issue, as I have extensive experience with Cairo programming and developing decentralized applications on StarkNet.

Estimated Timeline

I anticipate delivering a working solution within the next 24 hours. Please let me know if I can proceed.

Looking forward to contributing and collaborating!

Best regards,
Jagadeesh B

Hi,
I am proficient Blockchain developer expert in Cairo , Rust and Solidity and also in web development.
I have contributed many starknet project and more .
please /assign this issue .
Thank You !!

Hi.
This is my first issue.
May I take on this issue?

Let me try this one!

May I handle this issue?

Would love to tackle this!

I am a Software Engineer with experience working with cairo. I will build a script that takes in any number, check if it is a prime number or not, and return a boolean depending on whether it is a prime number or not and also handle edge cases like 1 and negative numbers. I will send my first PR within 24 hrs if I am assigned this issue. Thank you!

Thank you!

I’d love to work on this task and contribute to the project. I’ll be participating in the ETHDenver hackathon, and I see this as a great opportunity not only to help improve the project but also to grow my skills by tackling this issue.

May I take this issue on?

Can I try solving this issue?

Hi, my name is Matías Aguilar. I am a software development engineer with 1 year of experience in backend and some frontend. I am a maintainer of projects like RevolutionaryFarmers and StarShop, focusing on Smart Contracts using Rust, and I also have experience with Cairo, I was creating contracts for a project integrated into the Winter Hackathon and participating in the StarkNet Hacker House. I am passionate about design, which is why I enjoy UI/UX, and I have a natural ability to create effects or design anything that might be needed. Along with my team, I won first place in one of the tracks at the Eth Pura Vida hackathon. My experience in both frontend and backend enables me to carry out a wide variety of tasks to achieve set goals.

I am also skilled in documentation, ensuring that the reading experience is clean, concise, and enjoyable for the reader. I apply various visual techniques to make the content engaging and appealing. I am a member of Dojo Coding, and I would really love to participate in the project with this issue.