Everybody! This is important. In a few days, these forums will be moving over to using the totally sweet Discourse platform. To ensure this migration happens smoothly with no loss of content, these forums are currently in a read-only mode. I do apologize for the inconvenience.

There is never a good time to turn the forums off for an extended period of time, but I promise the new forums will be a billion times better. I'm pretty sure of it.

See you all on the other side in a few days, and if you have any (non-technical) questions, please e-mail me at kirupa@kirupa.com. For technical questions, try to find a tutorial that corresponds to what you are looking for and post in the comments section of that page.


Results 1 to 2 of 2

Thread: How to check!!

  1. #1

    How to check!!

    How to check whether a number is prime or not however it is arranged.
    e.g:- 113 , no matter how you arrange it, it will be prime, 131, 311, how to implement it in C# ??

  2. #2
    If something is prime it has no divisors other than 1 and itself. So write some code that checks for that
    Rotating digits in a number is a rather simple problem which can be solved using modulo, division and multiplication.

    Good luck with your Project Euler answers. I'd recommend trying to solve the problems yourself rather than getting others to do them for you. It kinda defeats the purpose otherwise

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Home About kirupa.com Meet the Moderators Advertise

 Link to Us


Copyright 1999 - 2012