<div>
What do you mean by &quot;in random sequence&quot; ? Why using bitwise operators ?<br />
<br />
What is this for ?<br />
<br />
Do you want prime numbers within a certain range ? Or just any prime numbers ?
</div>


What do you mean by "in random sequence" ? Why using bitwise operators ?

What is this for ?

Do you want prime numbers within a certain range ? Or just any prime numbers ?

<div>
i mean prime numbers in a range<br />
<br />
how to generate prime numbers with in a certain range using bit operators ?<br />
this was the question asked to me in an interview
</div>


i mean prime numbers in a range

how to generate prime numbers with in a certain range using bit operators ?
this was the question asked to me in an interview

<div>
I'm not sure there is enough info in the Q to provide and effective or useful answer.
</div>


I'm not sure there is enough info in the Q to provide and effective or useful answer.

<div>
I've got the same impression that there's something missing ... What's the relation between prime numbers and bitwise operations ?
</div>


I've got the same impression that there's something missing ... What's the relation between prime numbers and bitwise operations ?

<div>
I8. Actually I don't know why I'm monitoring this TA as numbers are definitely your thing and not mine -- I am a self confessed Numerophobe :-&gt;
</div>


I8. Actually I don't know why I'm monitoring this TA as numbers are definitely your thing and not mine -- I am a self confessed Numerophobe :->

<div>
You might use bit operators in a Feedback Shift Register pseudo-random number generator to select the random prime once it has been generated.<br />

</div>


You might use bit operators in a Feedback Shift Register pseudo-random number generator to select the random prime once it has been generated.


<div>
you might use a binary GCD algorithm for trial divisions.<br />
You might shift by the word size to get a bit mask and an array index for doing a sieve that uses more bits than your word size.<br />
Or maybe you want to find primes in GF(2)<br />

</div>


you might use a binary GCD algorithm for trial divisions.
You might shift by the word size to get a bit mask and an array index for doing a sieve that uses more bits than your word size.
Or maybe you want to find primes in GF(2)


<div>
<div class="content wysiwyg-content">
how to generate prime numbers in a random sequence &nbsp;using bitwise operators
</div>
</div>


how to generate prime numbers in a random sequence  using bitwise operators

get prime numbers in a  random sequence using bit shift operators

C is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations. By design, C provides constructs that map efficiently to typical machine instructions, so it has found lasting use in applications that had formerly been coded in assembly language, including operating systems as well as various application software for computers ranging from supercomputers to embedded systems. It is distinct from C++ (which has its roots in C) and C#, and many later languages have borrowed directly or indirectly from C.

A programming language is a formal constructed language designed to communicate instructions to a machine, particularly a computer. Thousands of different programming languages have been created, mainly in the computer field, and many more still are being created every year. The description of a programming language is usually split into the two components of syntax (form) and semantics (meaning). Some languages are defined by a specification document (for example, the C programming language is specified by an ISO Standard), while other languages (such as Perl) have a dominant implementation that is treated as a reference. Some languages have both, with the basic language defined by a standard and extensions taken from the dominant implementation being common.