Help me with the Pseudo code for generating Composite and Prime numbers

Question

I need to generate a composite number n

And then two prime numbers p & q which would satisfy the condition as follows
. p&q>1
. n==p*q
. Bit_length of p and q > 512
. p and q are primes

How do I start? Can someone help me with pseudocode

Answer 1

I make my psuedocode as python comments first. I arrange by function first. Think getters and putters. What needs to be returned or passed. At the end of the day, I have a comment briefly explaining what it's doing, and then a function or possible one liner, performing the task. If you really want to make it proper, add annotations and triple quoted doc strings 👍😀👍