Question #63196

define Q(q): for all value of p in N, where p<q such that NOT(there exist k in N, where (q=k*p)^(k<q))
Concisely, for which numbers q in N, when Q(q) is true?

Expert's answer

Answer on Question #63196 – Math – Discrete Mathematics

Question

Define Q(q)Q(q): for all values of pNp \in \mathbb{N}, where p<qp < q such that NOT (there exists kNk \in \mathbb{N}, where


(q=kp)(k<q)).(q = k * p) \wedge (k < q)).


Concisely, for which numbers qNq \in \mathbb{N}, when Q(q)Q(q) is true?

Solution

Let N\mathbb{N} be a set of numbers. Obviously, the statement Q(q)Q(q) is true for number qNq \in \mathbb{N} iff the subset of its proper factors, i.e. all factors strictly less than itself, is empty or consists of one element.

Let N\mathbb{N} denote the set of natural numbers. The statement Q(q)Q(q) is true iff qq is a prime number or 1.

www.AssignmentExpert.com


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS